There is a newer version of the record available.

Published April 16, 2018 | Version 1
Journal article Open

Modularity for Decidability of Deductive Verification with Applications to Distributed Systems

  • 1. Tel Aviv University
  • 2. University of California at Los Angeles
  • 3. Microsoft Research
  • 4. University of Washington

Description

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

pldi18ae-32.zip

Files (7.2 GB)

Name Size Download all
md5:90744c2ea105cddd842f7a9c00b2469a
7.2 GB Preview Download