Certified Complexity (CerCo)

Amadio, Roberto M., Ayache, Nicolas, Bobot, Francois, Boender, Jaap, Campbell, Brian, Garnier, Ilias, Madet, Antoine, McKinna, James, Mulligan, Dominic P., Piccolo, Mauro, Pollack, Randy, Régis-Gianas, Yann, Sacerdoti Coen, Claudio, Stark, Ian and Tranquilli, Paolo (2014) Certified Complexity (CerCo). Foundational and Practical Aspects of Resource Analysis: Third International Workshop, FOPARA 2013, Bertinoro, Italy, August 29-31, 2013, Revised Selected Papers. In: Third International Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA 2013), 29-31 Aug 2013, Bertinoro, Italy. ISBN 9783319124650. ISSN 0302-9743 [Conference or Workshop Item] (doi:10.1007/978-3-319-12466-7_1)

PDF - Published version (with publisher's formatting) Restricted to Repository staff and depositor only Download (305kB)

Abstract

We provide an overview of the FET-Open Project CerCo (‘Certified Complexity’). Our main achievement is the development of a technique for analysing non-functional properties of programs (time, space) at the source level with little or no loss of accuracy and a small trusted code base. The core component is a C compiler, verified in Matita, that produces an instrumented copy of the source code in addition to generating object code. This instrumentation exposes, and tracks precisely, the actual (non-asymptotic) computational cost of the input program at the source level. Untrusted invariant generators and trusted theorem provers may then be used to compute and certify the parametric execution time of the code.

Actions (login required)

View Item

Statistics

DownloadsShow export options

Export as CSVXMLJSON

Activity Overview

6 month trend

13Downloads

6 month trend

478Hits

Additional statistics are available via IRStats2.