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). In: Third International Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA 2013), 29-31 Aug 2013, Bertinoro, Italy. (doi:10.1007/978-3-319-12466-7_1)

[img] 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.

Item Type: Conference or Workshop Item (Paper)
Research Areas: A. > School of Science and Technology > Computer Science > Foundations of Computing group
Item ID: 15830
Notes on copyright: Access to full text restricted pending copyright check.
Depositing User: Jaap Boender
Date Deposited: 11 May 2015 10:06
Last Modified: 30 May 2019 19:39
URI: https://eprints.mdx.ac.uk/id/eprint/15830

Actions (login required)

Edit Item Edit Item

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year