Verified Code Generation for the Polyhedral Model - Inria - Institut national de recherche en sciences et technologies du numérique
Journal Articles Proceedings of the ACM on Programming Languages Year : 2021

Verified Code Generation for the Polyhedral Model

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.
Fichier principal
Vignette du fichier
polyhedral-codegen.pdf (573.02 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-03000244 , version 1 (11-11-2020)

Identifiers

Cite

Nathanaël Courant, Xavier Leroy. Verified Code Generation for the Polyhedral Model. Proceedings of the ACM on Programming Languages, 2021, 5 (POPL), pp.40:1-40:24. ⟨10.1145/3434321⟩. ⟨hal-03000244⟩
121 View
569 Download

Altmetric

Share

More