 |
PREUVES, PROGRAMMES et SYSTÈMES |  |
|
PREUVES, PROGRAMMES et SYSTÈMES | |
| HAL : hal-00524715, version 1 |
| arXiv : 1010.1697 |
| Fiche détaillée |  Récupérer au format |
 |
|
|
| Certifying cost annotations in compilers |
|
|
| Roberto M. Amadio 1Nicolas Ayache 1, 2 |
|
|
| Certified Complexity (CerCo), Project FP7-ICT-2009-C-243881 Collaboration(s) |
|
|
| (01/10/2010) |
|
|
|
| We discuss the problem of building a compiler which can lift in a provably correct way pieces of information on the execution cost of the object code to cost annotations on the source code. To this end, we need a clear and flexible picture of: (i) the meaning of cost annotations, (ii) the method to prove them sound and precise, and (iii) the way such proofs can be composed. We propose a so-called labelling approach to these three questions. As a first step, we examine its application to a toy compiler. This formal study suggests that the labelling approach has good compositionality and scalability properties. In order to provide further evidence for this claim, we report our successful experience in implementing and testing the labelling approach on top of a prototype compiler written in OCAML for (a large fragment of) the C language. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Preuves, Programmes et Systèmes (PPS) |
|
|
|
CNRS : UMR7126 – Université Paris VII - Paris Diderot |
|
|
| 2 : | PI.R2 (INRIA Paris - Rocquencourt) |
|
|
|
INRIA – Université Paris VII - Paris Diderot – CNRS : UMR7126 |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Langage de programmation |
|
|
| Certified compilation. Worst case execution time. |
|
|
|
| Liste des fichiers attachés à ce document : | ||||||||||
|
||||||||||
|
|
|
| hal-00524715, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00524715 | |
| oai:hal.archives-ouvertes.fr:hal-00524715 | |
| Contributeur : Roberto Amadio | |
| Soumis le : Vendredi 8 Octobre 2010, 16:01:31 | |
| Dernière modification le : Vendredi 25 Mai 2012, 09:05:31 | |
