There is a newer version of this record available.

Journal article Open Access

Modularity for Decidability of Deductive Verification with Applications to Distributed Systems

Marcelo Taube; Giuliano Losa; Kenneth L. McMillan; Oded Padon; Mooly Sagiv; Sharon Shoam; James R.Wilcox; Doug Woos

This is the artifact of the paper. Its a compressed virtual machine that can be imported by VirtualBox.


Abstract of the paper:

Proof automation can substantially increase productivity in formal verification of complex systems. However, unpredictablility of automated provers in handling quantified formulas presents a major hurdle to usability of these tools. We propose to solve this problem not by improving the provers, but by using a modular proof methodology that allows us to produce \emph{decidable} verification conditions. Decidability greatly improves predictability of proof automation, resulting in a more practical verification approach. We apply this methodology to develop verified implementations of distributed protocols, demonstrating its effectiveness.

Files (7.2 GB)
Name Size
7.2 GB Download
All versions This version
Views 298183
Downloads 8545
Data volume 621.2 GB325.6 GB
Unique views 244175
Unique downloads 7341


Cite as