The core message of this paper is to present an approach for automatically constructing product programs that facilitate relational verification, by leveraging e-graphs to compactly represent and explore the space of possible program alignments.
The authors propose a novel paradigm of intrinsic definitions for data structures, which avoids recursion and instead uses monadic maps satisfying local conditions. This enables a predictable verification methodology that allows engineers to write ghost code to update monadic maps and perform verification using reduction to decidable logics.
The core message of this paper is to present a novel methodology for automatically generating formal proofs that validate the soundness of front-end translations from a source language (e.g. Viper) to an intermediate verification language (e.g. Boogie) used in practical program verification tools.