RPP: Automatic proof of relational properties by self-composition - CEA - Commissariat à l’énergie atomique et aux énergies alternatives Access content directly
Conference Papers Year : 2017

RPP: Automatic proof of relational properties by self-composition


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.

Dates and versions

cea-01808885 , version 1 (06-06-2018)



L. Blatter, N. Kosmatov, P. Le Gall, V. Prevosto. RPP: Automatic proof of relational properties by self-composition. TACAS 2017: Tools and Algorithms for the Construction and Analysis of Systems, Apr 2017, Uppsala, Sweden. pp.391-397, ⟨10.1007/978-3-662-54577-5_22⟩. ⟨cea-01808885⟩
193 View
0 Download



Gmail Mastodon Facebook X LinkedIn More