Founding offer · lifetime membership for a single £24, exclusive to our first members · closes 20 June Claim your place →
Global Research Partnerships £24 Lifetime Log inCreate free account

Funded Projects › FP7

CerCo · CERTIFIED COMPLEXITY

FP7Status: CLOSED1 February 201031 March 2013EU funding €1,164,533

The project aims to the construction of a formally verified complexity preserving compiler from a large subset of C to some typical microcontroller assembly, of the kind traditionally used in embedded systems. The work comprise the definition of cost models for the input and target languages, and the machine-checked proof of preservation of complexity (concrete, not asymptotic) along compilation. The compiler will also return tight and certified cost annotations for the source program, providing a reliable infrastructure to draw temporal assertions on the executable code while reasoning on the source.The compiler will be open source, and all proofs will be public domain.

Consortium · 3 organisations

coordinator

ALMA MATER STUDIORUM - UNIVERSITA DI BOLOGNA

IT · €429,565

participant

Université Paris Diderot-Paris 7

FR · €314,457

participant

THE UNIVERSITY OF EDINBURGH

UK · €420,511

View the official record on CORDIS →

← Find collaborators and more funded projects

Source: CORDIS, Publications Office of the European Union. Global Research Partnerships surfaces open EU research data to help you find collaborators; we are not affiliated with the European Union.