Certified Complexity (CerCo)
- Amadio, R.
- Ayache, N.
- Bobot, F.
- Boender, J.
- Campbell, B.
- Garnier, I.
- Madet, A.
- McKinna, J.
- Mulligan, D.
- Piccolo, M.
- Pollack, R.
- Régis-Gianas, Y.
- Sacerdoti Coen, C.
- Stark, I.
- Tranquilli, P.
- Amadio, R.
- Ayache, N.
- Bobot, F.
- Boender, J.
- Campbell, B.
- Garnier, I.
- Madet, A.
- McKinna, J.
- Mulligan, D.
- Piccolo, M.
- Pollack, R.
- Régis-Gianas, Y.
- Sacerdoti Coen, C.
- Stark, I.
- Tranquilli, P.
Publication date
January 2014
DOIAbstract
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
Add to ORKG