Compositional CompCert
From MaRDI portal
Publication:2819813
DOI10.1145/2676726.2676985zbMath1346.68056OpenAlexW2294599249MaRDI QIDQ2819813
Santiago Cuellar, Andrew W. Appel, Lennart Beringer, Gordon Stewart
Publication date: 29 September 2016
Published in: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2676726.2676985
Related Items (7)
Trace-Relating Compiler Correctness and Secure Compilation ⋮ Extensible Extraction of Efficient Imperative Programs with Foreign Functions, Manually Managed Memory, and Proofs ⋮ ANF preserves dependent types up to extensional equality ⋮ Foreword to the special focus on formal proofs for mathematics and computer science ⋮ Unnamed Item ⋮ The verified CakeML compiler backend ⋮ CompCert
Uses Software
This page was built for publication: Compositional CompCert
