Simpler Proofs with Decentralized Invariants - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Logical and Algebraic Methods in Programming Year : 2021

Simpler Proofs with Decentralized Invariants


When verifying programs where the data have some recursive structure, it is natural to make use of global invariants that are themselves recursively defined. Though this is mathematically elegant, this makes the proofs more complex, as the preservation of these invariants now requires induction. In particular, this makes the proofs less amenable to automation. An alternative is to use local invariants attached to individual components of the structure and which only involve a bounded number of elements. We call these decentralized invariants. When the structure is updated, the footprint of the modification only impacts a limited number of invariants and reestablishing them does not require induction. In this paper, we illustrate this idea on three non-trivial programs, for which we achieve fully automated proofs.
Fichier principal
Vignette du fichier
main.pdf (229.8 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02518570 , version 1 (25-03-2020)



Jean-Christophe Filliâtre. Simpler Proofs with Decentralized Invariants. Journal of Logical and Algebraic Methods in Programming, 2021, 121, ⟨10.1016/j.jlamp.2021.100645⟩. ⟨hal-02518570⟩
280 View
513 Download



Gmail Mastodon Facebook X LinkedIn More