We present a new architecture for specifying and proving optimizing compilers in the presence of shared-memory interactions such as buffer-based system calls, shared-memory concurrency, and separate compilation. The architecture, which is implemented in the context of CompCert, includes a novel interaction-oriented model for C-like languages, and a new proof technique, called logical simulation relations, for compositionally proving compiler correctness with respect to this interaction model. We apply our techniques to CompCert's primary memory-reorganizing compilation phase, Cminorgen. Our results are formalized in Coq, building on the recently released CompCert 2.0. © 2014 Springer-Verlag
Abstract. This article presents the formal verification, using the Coq proof assistant, of a memory ...
International audienceThe CompCert C compiler provides the formal guarantee that the observable beha...
CompCert is a formally verified compiler that generates compact and efficient code for a large subse...
Abstract. We present a new architecture for specifying and proving op-timizing compilers in the pres...
We report on the ongoing design of a novel architecture for verified separate compilation of C progr...
International audienceIn this article, we consider the semantic design and verified compilation of a...
International audienceThe CompCert C compiler provides the formal guarantee that the observable beha...
Compilers, and especially optimizing compilers, are complicated programs. Bugs in compilers happen, ...
Shared memory concurrency is the pervasive programming model for multicore architectures such as x8...
International audienceCompCert is the first commercially available optimizing compiler that is forma...
A memory model is an important component of the formal semantics of imperative programming languages...
Compositional compiler verification is a difficult problem that focuses on separate compilation of p...
International audienceCompCert is the first commercially available optimizing compiler that is forma...
CompCert is the first commercially available optimiz-ing compiler that is formally verified, using m...
International audienceThe CompCert C compiler guarantees that the target program behaves as the sour...
Abstract. This article presents the formal verification, using the Coq proof assistant, of a memory ...
International audienceThe CompCert C compiler provides the formal guarantee that the observable beha...
CompCert is a formally verified compiler that generates compact and efficient code for a large subse...
Abstract. We present a new architecture for specifying and proving op-timizing compilers in the pres...
We report on the ongoing design of a novel architecture for verified separate compilation of C progr...
International audienceIn this article, we consider the semantic design and verified compilation of a...
International audienceThe CompCert C compiler provides the formal guarantee that the observable beha...
Compilers, and especially optimizing compilers, are complicated programs. Bugs in compilers happen, ...
Shared memory concurrency is the pervasive programming model for multicore architectures such as x8...
International audienceCompCert is the first commercially available optimizing compiler that is forma...
A memory model is an important component of the formal semantics of imperative programming languages...
Compositional compiler verification is a difficult problem that focuses on separate compilation of p...
International audienceCompCert is the first commercially available optimizing compiler that is forma...
CompCert is the first commercially available optimiz-ing compiler that is formally verified, using m...
International audienceThe CompCert C compiler guarantees that the target program behaves as the sour...
Abstract. This article presents the formal verification, using the Coq proof assistant, of a memory ...
International audienceThe CompCert C compiler provides the formal guarantee that the observable beha...
CompCert is a formally verified compiler that generates compact and efficient code for a large subse...