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 Shoham; 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.tar
md5:20a17f71b845239f3a1909ec79944660 |
7.4 GB | Download |
| All versions | This version | |
|---|---|---|
| Views | 274 | 103 |
| Downloads | 77 | 37 |
| Data volume | 562.8 GB | 273.4 GB |
| Unique views | 223 | 94 |
| Unique downloads | 66 | 32 |
- Publication date:
- April 16, 2018
- DOI:
-
- License (for files):
- Creative Commons Attribution 4.0 International