Journal article Open Access
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.
Name | Size | |
---|---|---|
pldi18ae-32.zip
md5:90744c2ea105cddd842f7a9c00b2469a |
7.2 GB | Download |
All versions | This version | |
---|---|---|
Views | 230 | 149 |
Downloads | 50 | 27 |
Data volume | 365.3 GB | 195.4 GB |
Unique views | 198 | 146 |
Unique downloads | 45 | 25 |