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...

Full description

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 121; p. 100645
Main Author Filliâtre, Jean-Christophe
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.06.2021
Elsevier
Subjects
Online AccessGet full text

Cover

Loading…