Certifying compilers using higher-order theorem provers as certificate checkers

Abstract

Correct software requires compilers to work correctly. Especially code generation can be an error prone task, since it potentially uses sophisticated algorithms to produce efficient code.In this paper we present an approach to guarantee the correctness of compiler transformations with respect to a formal notion of correctness. We certify the results of each compilation run. With the help of a compiler generated certificate and a certificate checker, we verify the results of each compilation run automatically. Thereby we ensure the correctness of the compilation run without having to look at concrete compilation algorithms.We use higher-order theorem provers to check the certificates and to formally define syntax, and semantics of the involved languages as well as a criterion under which we regard a compilation as correct. The use of higher-order theorem provers ensures a small and well understood trusted computing base. The task of efficient certificate checking is especially crucial for the acceptance of certifying compilation. We present methods to facilitate this task, most notably by using computational reflection: We present small-in an executable way specified-evaluators that solve certain properties appearing in our certificates and are used to speed up certain subtasks in the checking process.We discuss an implemented prototype performing code generation. Using Coq and Isabelle/HOL as certificate checkers we highlight typical challenges and their solutions

Modelling and Formal Verification of Timing Aspects in Large PLC Programs

“…Using more abstract models for verification purposes and lifting results to realistic models is a well known technique (Clarke et al (1999); Loiseaux et al (1995)) and we apply it to the PLC domain. Specifically to PLC timer models and we perform a proof in a similar fashion as the refinement proofs described in Blech and Grégoire (2011).…”

On Formal Reasoning on the Semantics of PLC using Coq

“…The problem of providing a proof carrying code approach with respect to a mathematically founded semantics is addressed in [24]. In previous work we have also addressed the problem of establishing a formal semantics for related scenarios [7,10].…”

Towards Certified Runtime Verification

“…Moreover, none of the previous tools or framework contains a certified subset. The presented verification technique, explicitely establishing a simulation relation that captures characteristics between property and states of a monitor in Coq, is similar to one of the authors work on compiler verification [BG11]. data from the sensors and processes them.…”