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 compilation process itself. Further, we must raise our level of trust in the (cost inducing) compiler. We plan to formally verify the compiler, proving it respects both intensional and extensional—w.r.t the cost model—properties of the source program.

Certified Complexity / R. Armadio; A. Asperti; N. Ayache; B. Campbell; D. Mulligan; R. Pollack; Y. Regis-Gianas; C. Sacerdoti Coen; I. Stark. - In: PROCEDIA COMPUTER SCIENCE. - ISSN 1877-0509. - ELETTRONICO. - 7:(2011), pp. 175-177. [10.1016/j.procs.2011.09.054]

Certified Complexity

ASPERTI, ANDREA;SACERDOTI COEN, CLAUDIO;
2011

Abstract

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 compilation process itself. Further, we must raise our level of trust in the (cost inducing) compiler. We plan to formally verify the compiler, proving it respects both intensional and extensional—w.r.t the cost model—properties of the source program.
2011
Certified Complexity / R. Armadio; A. Asperti; N. Ayache; B. Campbell; D. Mulligan; R. Pollack; Y. Regis-Gianas; C. Sacerdoti Coen; I. Stark. - In: PROCEDIA COMPUTER SCIENCE. - ISSN 1877-0509. - ELETTRONICO. - 7:(2011), pp. 175-177. [10.1016/j.procs.2011.09.054]
R. Armadio; A. Asperti; N. Ayache; B. Campbell; D. Mulligan; R. Pollack; Y. Regis-Gianas; C. Sacerdoti Coen; I. Stark
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/112537
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 2
social impact