Add to ORKGThis document reports on our work in extending CompCert memory model with a relation to model relocations. It preserves undefined values unlike similar relations defined in CompCert. This relation commutes with memory operations. Our main contributions are the relation itself and mechanically checked proofs of its commutation properties. We intend to use this extension to construct and verify a refactoring tool for programs written in C
We present a new architecture for specifying and proving optimizing compilers in the presence of sha...
Abstract. We discuss the difference between a formal semantics of the C standard, and a formal seman...
Abstract. We present a new architecture for specifying and proving op-timizing compilers in the pres...
This document reports on our work in extending CompCert memory model with a relation to model reloca...
International audienceThe CompCert C compiler guarantees that the target program behaves as the sour...
International audienceSemantics preserving compilation of low-level C programs is challenging becaus...
A memory model is an important component of the formal semantics of imperative programming languages...
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...
Abstract. Real life C programs are often written using C dialects which, for the ISO C standard, hav...
International audienceReal life C programs are often written using C dialects which, for the ISO C s...
This thesis presents an extension of the CompCert compiler that aims at providing formal guarantees ...
Refactoring has become a popular technique for the development and maintenance of object-oriented sy...
It has been observed in previous work that it is desirable to avoid causal violations in any executi...
We present a new architecture for specifying and proving optimizing compilers in the presence of sha...
Abstract. We discuss the difference between a formal semantics of the C standard, and a formal seman...
Abstract. We present a new architecture for specifying and proving op-timizing compilers in the pres...
This document reports on our work in extending CompCert memory model with a relation to model reloca...
International audienceThe CompCert C compiler guarantees that the target program behaves as the sour...
International audienceSemantics preserving compilation of low-level C programs is challenging becaus...
A memory model is an important component of the formal semantics of imperative programming languages...
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...
Abstract. Real life C programs are often written using C dialects which, for the ISO C standard, hav...
International audienceReal life C programs are often written using C dialects which, for the ISO C s...
This thesis presents an extension of the CompCert compiler that aims at providing formal guarantees ...
Refactoring has become a popular technique for the development and maintenance of object-oriented sy...
It has been observed in previous work that it is desirable to avoid causal violations in any executi...
We present a new architecture for specifying and proving optimizing compilers in the presence of sha...
Abstract. We discuss the difference between a formal semantics of the C standard, and a formal seman...
Abstract. We present a new architecture for specifying and proving op-timizing compilers in the pres...