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


DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="DOI">10.5281/zenodo.2577103</identifier>
  <creators>
    <creator>
      <creatorName>Marcelo Taube</creatorName>
      <affiliation>Tel Aviv University</affiliation>
    </creator>
    <creator>
      <creatorName>Giuliano Losa</creatorName>
      <affiliation>University of California at Los Angeles</affiliation>
    </creator>
    <creator>
      <creatorName>Kenneth L. McMillan</creatorName>
      <affiliation>Microsoft Research</affiliation>
    </creator>
    <creator>
      <creatorName>Oded Padon</creatorName>
      <affiliation>Tel Aviv University</affiliation>
    </creator>
    <creator>
      <creatorName>Mooly Sagiv</creatorName>
      <affiliation>Tel Aviv University</affiliation>
    </creator>
    <creator>
      <creatorName>Sharon Shoham</creatorName>
      <affiliation>Tel Aviv University</affiliation>
    </creator>
    <creator>
      <creatorName>James R.Wilcox</creatorName>
      <affiliation>University of Washington</affiliation>
    </creator>
    <creator>
      <creatorName>Doug Woos</creatorName>
      <affiliation>University of Washington</affiliation>
    </creator>
  </creators>
  <titles>
    <title>Modularity for Decidability of Deductive Verification with Applications to Distributed Systems</title>
  </titles>
  <publisher>Zenodo</publisher>
  <publicationYear>2018</publicationYear>
  <dates>
    <date dateType="Issued">2018-04-16</date>
  </dates>
  <language>en</language>
  <resourceType resourceTypeGeneral="Text">Journal article</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/2577103</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.5281/zenodo.1218852</relatedIdentifier>
  </relatedIdentifiers>
  <version>1</version>
  <rightsList>
    <rights rightsURI="https://creativecommons.org/licenses/by/4.0/legalcode">Creative Commons Attribution 4.0 International</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">&lt;p&gt;This is the artifact of the paper. Its a compressed virtual machine that can be imported by VirtualBox.&lt;/p&gt;

&lt;p&gt;&amp;nbsp;&lt;/p&gt;

&lt;p&gt;Abstract of the paper:&lt;/p&gt;

&lt;p&gt;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.&lt;/p&gt;</description>
  </descriptions>
</resource>
184
46
views
downloads
All versions This version
Views 18462
Downloads 4620
Data volume 335.9 GB147.8 GB
Unique views 15858
Unique downloads 4218

Share

Cite as