Skip to Main content Skip to Navigation
Conference papers

A Concrete Memory Model for CompCert

Frédéric Besson 1 Sandrine Blazy 1 Pierre Wilke 1
1 CELTIQUE - Software certification with semantic analysis
Inria Rennes – Bretagne Atlantique , IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL
Abstract : Semantics preserving compilation of low-level C programs is challenging because their semantics is implementation defined according to the C standard. This paper presents the proof of an enhanced and more concrete memory model for the CompCert C compiler which assigns a definite meaning to more C programs. In our new formally verified memory model, pointers are still abstract but are nonetheless mapped to concrete 32-bit integers. Hence, the memory is finite and it is possible to reason about the binary encoding of pointers. We prove that the existing memory model is an abstraction of our more concrete model thus validating formally the soundness of CompCert's abstract semantics of pointers. We also show how to adapt the front-end of CompCert thus demonstrating that it should be feasible to port the whole compiler to our novel memory model.
Document type :
Conference papers
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/hal-01194549
Contributor : Sandrine Blazy <>
Submitted on : Monday, September 7, 2015 - 11:17:28 AM
Last modification on : Friday, July 10, 2020 - 4:00:25 PM
Long-term archiving on: : Tuesday, December 8, 2015 - 11:50:55 AM

File

paper.pdf
Files produced by the author(s)

Licence


Copyright

Identifiers

Citation

Frédéric Besson, Sandrine Blazy, Pierre Wilke. A Concrete Memory Model for CompCert. ITP 2015 : 6th International Conference on Interactive Theorem Proving, Aug 2015, Nanjing, China. pp.67-83, ⟨10.1007/978-3-319-22102-1_5⟩. ⟨hal-01194549⟩

Share

Metrics

Record views

1171

Files downloads

286