@article{Courant2021, abstract = {The polyhedral model is a high-level intermediate representation for loop nests that supports elegantly a great many loop optimizations. In a compiler, after polyhedral loop optimizations have been performed, it is necessary and difficult to regenerate sequential or parallel loop nests before continuing compilation. This paper reports on the formalization and proof of semantic preservation of such a code generator that produces sequential code from a polyhedral representation. The formalization and proofs are mechanized using the Coq proof assistant.}, author = {Courant, Nathanaƫl and Leroy, Xavier}, doi = {10.1145/3434321}, journal = {Proceedings of the ACM on Programming Languages}, month = {jan}, pages = {1-24}, title = {Verified code generation for the polyhedral model}, url = {https://doi.org/10.1145/3434321}, volume = {5}, year = {2021} }