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

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="" xmlns:oai_dc="" xmlns:xsi="" xsi:schemaLocation="">
  <dc:creator>Marcelo Taube</dc:creator>
  <dc:creator>Giuliano Losa</dc:creator>
  <dc:creator>Kenneth L. McMillan</dc:creator>
  <dc:creator>Oded Padon</dc:creator>
  <dc:creator>Mooly Sagiv</dc:creator>
  <dc:creator>Sharon Shoam</dc:creator>
  <dc:creator>James R.Wilcox</dc:creator>
  <dc:creator>Doug Woos</dc:creator>
  <dc: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.</dc:description>
  <dc:title>Modularity for Decidability of Deductive Verification with Applications to Distributed Systems</dc:title>
All versions This version
Views 275174
Downloads 7740
Data volume 562.8 GB289.4 GB
Unique views 224166
Unique downloads 6637


Cite as