RPP: Automatic proof of relational properties by self-composition

Abstract : Self-composition provides a powerful theoretical approach to prove relational properties, i.e. properties relating several program executions, that has been applied to compare two runs of one or similar programs (in secure dataflow properties, code transformations, etc.). This tool demo paper presents RPP, an original implementation of self-composition for specification and verification of relational properties in C programs in the Frama-C platform. We consider a very general notion of relational properties invoking any finite number of function calls of possibly dissimilar functions with possible nested calls. The new tool allows the user to specify a relational property, to prove it in a completely automatic way using classic deductive verification, and to use it as a hypothesis in the proof of other properties that may rely on it.
Document type :
Journal articles
Complete list of metadatas

Contributor : Léna Le Roy <>
Submitted on : Wednesday, June 6, 2018 - 11:12:59 AM
Last modification on : Friday, July 26, 2019 - 4:26:20 PM

Links full text



L. Blatter, N. Kosmatov, P. Le Gall, V. Prevosto. RPP: Automatic proof of relational properties by self-composition. Lecture Notes in Computer Science, Springer, 2017, 10205 LNCS, pp.391-397. ⟨10.1007/978-3-662-54577-5_22⟩. ⟨cea-01808885⟩



Record views