The Trusted CerCo Cost Annotating Compiler is a (partially) certified compiler from a large subset of C to the object code of the 8051/8052 processor family. The code of the compiler is automatically extracted from a formalization in the proof assistant Matita of: 1) the semantics of the source code; 2) the semantics of the target code; 3) the semantics of a sequence of intermediate languages; 4) the code that implements the translation between consecutive languages in the compilation chain; 5) the proof that every compilation step preserves the semantics of the code, i.e. that the output code simulates the input. The main peculiarity of the compiler is that of returning in output also a copy of the source code annotated with the exact cos...
none15siWe provide an overview of the FET-Open Project CerCo (‘Certified Complexity’). Our main achi...
International audienceThis paper reports on the development and formal certification (proof of seman...
International audienceGiven the complexity and sophistication of code generation and optimization al...
The Trusted CerCo Cost Annotating Compiler is a (partially) certified compiler from a large subset o...
The Cost Annotating Compiler is a special compiler from a very large subset of Standard C to the obj...
The project aims to the construction of a formally verified complexity preserving compiler from a la...
We discuss the problem of building a compiler which can lift in a provably correct way pieces of inf...
International audienceWe present a so-called labelling method to enrich a compiler in order to turn ...
CerCo (‘Certified Complexity’) aims to develop tools for reasoning about intensional properties of p...
This paper presents the design and implementation of a compiler that translates programs written in ...
We present an extension to the labelling approach, a technique for lifting resource consumption info...
Certifying compilers use static information of a program to verify that it complies with certain sec...
AbstractCerCo (‘Certified Complexity’) aims to develop tools for reasoning about intensional propert...
Compilers, and especially optimizing compilers, are complicated programs. Bugs in compilers happen, ...
A translation contract is a binary predicate corrTransl(S,T) for source programs S and target progra...
none15siWe provide an overview of the FET-Open Project CerCo (‘Certified Complexity’). Our main achi...
International audienceThis paper reports on the development and formal certification (proof of seman...
International audienceGiven the complexity and sophistication of code generation and optimization al...
The Trusted CerCo Cost Annotating Compiler is a (partially) certified compiler from a large subset o...
The Cost Annotating Compiler is a special compiler from a very large subset of Standard C to the obj...
The project aims to the construction of a formally verified complexity preserving compiler from a la...
We discuss the problem of building a compiler which can lift in a provably correct way pieces of inf...
International audienceWe present a so-called labelling method to enrich a compiler in order to turn ...
CerCo (‘Certified Complexity’) aims to develop tools for reasoning about intensional properties of p...
This paper presents the design and implementation of a compiler that translates programs written in ...
We present an extension to the labelling approach, a technique for lifting resource consumption info...
Certifying compilers use static information of a program to verify that it complies with certain sec...
AbstractCerCo (‘Certified Complexity’) aims to develop tools for reasoning about intensional propert...
Compilers, and especially optimizing compilers, are complicated programs. Bugs in compilers happen, ...
A translation contract is a binary predicate corrTransl(S,T) for source programs S and target progra...
none15siWe provide an overview of the FET-Open Project CerCo (‘Certified Complexity’). Our main achi...
International audienceThis paper reports on the development and formal certification (proof of seman...
International audienceGiven the complexity and sophistication of code generation and optimization al...