2577103
doi
10.5281/zenodo.2577103
oai:zenodo.org:2577103
Giuliano Losa
University of California at Los Angeles
Kenneth L. McMillan
Microsoft Research
Oded Padon
Tel Aviv University
Mooly Sagiv
Tel Aviv University
Sharon Shoham
Tel Aviv University
James R.Wilcox
University of Washington
Doug Woos
University of Washington
Modularity for Decidability of Deductive Verification with Applications to Distributed Systems
Marcelo Taube
Tel Aviv University
info:eu-repo/semantics/openAccess
Creative Commons Attribution 4.0 International
https://creativecommons.org/licenses/by/4.0/legalcode
<p>This is the artifact of the paper. Its a compressed virtual machine that can be imported by VirtualBox.</p>
<p> </p>
<p>Abstract of the paper:</p>
<p>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.</p>
Zenodo
2018-04-16
info:eu-repo/semantics/article
1218852
1
1579538929.48837
7388487680
md5:20a17f71b845239f3a1909ec79944660
https://zenodo.org/records/2577103/files/pldi18ae-32.tar
public
10.5281/zenodo.1218852
isVersionOf
doi