Journal article Open Access
Marcelo Taube; Giuliano Losa; Kenneth L. McMillan; Oded Padon; Mooly Sagiv; Sharon Shoham; James R.Wilcox; Doug Woos
{ "files": [ { "links": { "self": "https://zenodo.org/api/files/d94b242c-bdea-41f5-a732-fd3d3207ebc9/pldi18ae-32.tar" }, "checksum": "md5:20a17f71b845239f3a1909ec79944660", "bucket": "d94b242c-bdea-41f5-a732-fd3d3207ebc9", "key": "pldi18ae-32.tar", "type": "tar", "size": 7388487680 } ], "owners": [ 44975 ], "doi": "10.5281/zenodo.2577103", "stats": { "version_unique_downloads": 46.0, "unique_views": 81.0, "views": 87.0, "version_views": 239.0, "unique_downloads": 22.0, "version_unique_views": 205.0, "volume": 177323704320.0, "version_downloads": 51.0, "downloads": 24.0, "version_volume": 372697592349.0 }, "links": { "doi": "https://doi.org/10.5281/zenodo.2577103", "conceptdoi": "https://doi.org/10.5281/zenodo.1218852", "bucket": "https://zenodo.org/api/files/d94b242c-bdea-41f5-a732-fd3d3207ebc9", "conceptbadge": "https://zenodo.org/badge/doi/10.5281/zenodo.1218852.svg", "html": "https://zenodo.org/record/2577103", "latest_html": "https://zenodo.org/record/2577103", "badge": "https://zenodo.org/badge/doi/10.5281/zenodo.2577103.svg", "latest": "https://zenodo.org/api/records/2577103" }, "conceptdoi": "10.5281/zenodo.1218852", "created": "2019-02-27T18:45:47.456613+00:00", "updated": "2020-01-20T16:48:49.488370+00:00", "conceptrecid": "1218852", "revision": 5, "id": 2577103, "metadata": { "access_right_category": "success", "doi": "10.5281/zenodo.2577103", "description": "<p>This is the artifact of the paper. Its a compressed virtual machine that can be imported by VirtualBox.</p>\n\n<p> </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>", "language": "eng", "title": "Modularity for Decidability of Deductive Verification with Applications to Distributed Systems", "license": { "id": "CC-BY-4.0" }, "relations": { "version": [ { "count": 2, "index": 1, "parent": { "pid_type": "recid", "pid_value": "1218852" }, "is_last": true, "last_child": { "pid_type": "recid", "pid_value": "2577103" } } ] }, "version": "1", "publication_date": "2018-04-16", "creators": [ { "affiliation": "Tel Aviv University", "name": "Marcelo Taube" }, { "affiliation": "University of California at Los Angeles", "name": "Giuliano Losa" }, { "affiliation": "Microsoft Research", "name": "Kenneth L. McMillan" }, { "affiliation": "Tel Aviv University", "name": "Oded Padon" }, { "affiliation": "Tel Aviv University", "name": "Mooly Sagiv" }, { "affiliation": "Tel Aviv University", "name": "Sharon Shoham" }, { "affiliation": "University of Washington", "name": "James R.Wilcox" }, { "affiliation": "University of Washington", "name": "Doug Woos" } ], "access_right": "open", "resource_type": { "subtype": "article", "type": "publication", "title": "Journal article" }, "related_identifiers": [ { "scheme": "doi", "identifier": "10.5281/zenodo.1218852", "relation": "isVersionOf" } ] } }
All versions | This version | |
---|---|---|
Views | 239 | 87 |
Downloads | 51 | 24 |
Data volume | 372.7 GB | 177.3 GB |
Unique views | 205 | 81 |
Unique downloads | 46 | 22 |