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


Citation Style Language JSON Export

{
  "publisher": "Zenodo", 
  "DOI": "10.5281/zenodo.2577103", 
  "language": "eng", 
  "title": "Modularity for Decidability of Deductive Verification with Applications to Distributed Systems", 
  "issued": {
    "date-parts": [
      [
        2018, 
        4, 
        16
      ]
    ]
  }, 
  "abstract": "<p>This is the artifact of the paper. Its a compressed virtual machine that can be imported by VirtualBox.</p>\n\n<p>&nbsp;</p>\n\n<p>Abstract of the paper:</p>\n\n<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>", 
  "author": [
    {
      "family": "Marcelo Taube"
    }, 
    {
      "family": "Giuliano Losa"
    }, 
    {
      "family": "Kenneth L. McMillan"
    }, 
    {
      "family": "Oded Padon"
    }, 
    {
      "family": "Mooly Sagiv"
    }, 
    {
      "family": "Sharon Shoham"
    }, 
    {
      "family": "James R.Wilcox"
    }, 
    {
      "family": "Doug Woos"
    }
  ], 
  "version": "1", 
  "type": "article-journal", 
  "id": "2577103"
}
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