An efficient VCGen-based modular verification of relational properties - CEA - Commissariat à l’énergie atomique et aux énergies alternatives Access content directly
Conference Papers Year : 2022

An efficient VCGen-based modular verification of relational properties


Deductive verification typically relies on function contracts that specify the behavior of each function for a single function call. Rela- tional properties link several function calls together within a single spe- cification. They can express more advanced properties of a given function or relate calls to different functions, possibly run in parallel. However, relational properties cannot be expressed and verified directly in the tra- ditional setting of modular deductive verification. Recent work proposed a new technique for relational property verification that relies on a veri- fication condition generator to produce logical formulas that must be verified to ensure a given relational property. This paper presents an overview of this approach and proposes important enhancements. We integrate an optimized verification condition generator and extend the underlying theory to show how relational properties can be proved in a modular way, where one relational property can be used to prove another one, like in modular verification of function contracts. Our results have been fully formalized and proved sound in the Coq proof assistant.
Embargoed file
Embargoed file
0 0 7
Year Month Jours
Avant la publication

Dates and versions

cea-04119217 , version 1 (06-06-2023)



Lionel Blatter, Nikolai Kosmatov, Virgile Prevosto, Pascale Le Gall. An efficient VCGen-based modular verification of relational properties. ISoLA 2022 - 11th International Symposium On Leveraging Applications of Formal Methods, Oct 2022, Rhodes, Greece. pp.498-516, ⟨10.1007/978-3-031-19849-6_28⟩. ⟨cea-04119217⟩
11 View
4 Download



Gmail Facebook Twitter LinkedIn More