Skip to Main content Skip to Navigation
Conference papers

Qed. Computing What Remains to Be Proved

Abstract : We propose a framework for manipulating in a efficient way terms and formulæ in classical logic modulo theories. Qed was initially designed for the generation of proof obligations of a weakest-precondition engine for C programs inside the Frama-C framework, but it has been implemented as an independent library. Key features of Qed include on-the-fly strong normalization with various theories and maximal sharing of terms in memory. Qed is also equipped with an extensible simplification engine. We illustrate the power of our framework by the implementation of non-trivial simplifications inside the Wp plug-in of Frama-C. These optimizations have been used to prove industrial, critical embedded softwares.
Document type :
Conference papers
Complete list of metadatas
Contributor : Loïc Correnson <>
Submitted on : Wednesday, June 6, 2018 - 12:16:18 PM
Last modification on : Monday, February 10, 2020 - 6:14:14 PM





Loïc Correnson. Qed. Computing What Remains to Be Proved. NASA Formal Methods - 6th International Symposium, NFM 2014, Houston, TX, USA, Apr 2014, Houston, United States. pp.215-229, ⟨10.1007/978-3-319-06200-6_17⟩. ⟨cea-01809013⟩



Record views