CerCo (‘Certified Complexity’) aims to develop tools for reasoning about intensional properties of programs written in high level languages. If successful, it will be possible to write correct hard real time programs and to formally prove, in a high level way, that programs meet all deadlines. Further, as many clock cycles as possible can be wrought from the processor by using a cost model that does not over-estimate. Cost models for high level languages compiled to machine code are non-compositional. The cost model must be determined by the compilation process and must assign costs to instructions depending on context. Our approach—letting the compiler output the cost model—induces a precise cost model for the source program from the c...
Information about the computational cost of programs is potentially useful for a variety of purposes...
International audienceGiven the complexity and sophistication of code generation and optimization al...
This paper describes an inter-procedural technique for computing symbolic bounds on the number of st...
CerCo (‘Certified Complexity’) aims to develop tools for reasoning about intensional properties of p...
AbstractCerCo (‘Certified Complexity’) aims to develop tools for reasoning about intensional propert...
The project aims to the construction of a formally verified complexity preserving compiler from a la...
The Trusted CerCo Cost Annotating Compiler is a (partially) certified compiler from a large subset o...
none15siWe provide an overview of the FET-Open Project CerCo (‘Certified Complexity’). Our main achi...
The Cost Annotating Compiler is a special compiler from a very large subset of Standard C to the obj...
International audienceWe present a so-called labelling method to enrich a compiler in order to turn ...
International audienceImplicit Computational Complexity (ICC) aims atgiving machine-free characteris...
This work drafts a strategy that leverages the field of Implicit Computational Complexity to certify...
Cost analysis aims at statically inferring the amount of resources, such as time or memory, needed t...
. This paper focuses on the compile-time cost analysis of programs expressed in the BMF-style, which...
We discuss the problem of building a compiler which can lift in a provably correct way pieces of inf...
Information about the computational cost of programs is potentially useful for a variety of purposes...
International audienceGiven the complexity and sophistication of code generation and optimization al...
This paper describes an inter-procedural technique for computing symbolic bounds on the number of st...
CerCo (‘Certified Complexity’) aims to develop tools for reasoning about intensional properties of p...
AbstractCerCo (‘Certified Complexity’) aims to develop tools for reasoning about intensional propert...
The project aims to the construction of a formally verified complexity preserving compiler from a la...
The Trusted CerCo Cost Annotating Compiler is a (partially) certified compiler from a large subset o...
none15siWe provide an overview of the FET-Open Project CerCo (‘Certified Complexity’). Our main achi...
The Cost Annotating Compiler is a special compiler from a very large subset of Standard C to the obj...
International audienceWe present a so-called labelling method to enrich a compiler in order to turn ...
International audienceImplicit Computational Complexity (ICC) aims atgiving machine-free characteris...
This work drafts a strategy that leverages the field of Implicit Computational Complexity to certify...
Cost analysis aims at statically inferring the amount of resources, such as time or memory, needed t...
. This paper focuses on the compile-time cost analysis of programs expressed in the BMF-style, which...
We discuss the problem of building a compiler which can lift in a provably correct way pieces of inf...
Information about the computational cost of programs is potentially useful for a variety of purposes...
International audienceGiven the complexity and sophistication of code generation and optimization al...
This paper describes an inter-procedural technique for computing symbolic bounds on the number of st...