{ "access": { "embargo": { "active": false, "reason": null }, "files": "public", "record": "public", "status": "open" }, "created": "2019-02-27T18:45:47.456613+00:00", "custom_fields": {}, "deletion_status": { "is_deleted": false, "status": "P" }, "files": { "count": 1, "enabled": true, "entries": { "pldi18ae-32.tar": { "checksum": "md5:20a17f71b845239f3a1909ec79944660", "ext": "tar", "id": "ebcb7b8e-a579-493e-9a97-8e78e321036c", "key": "pldi18ae-32.tar", "metadata": null, "mimetype": "application/x-tar", "size": 7388487680 } }, "order": [], "total_bytes": 7388487680 }, "id": "2577103", "is_draft": false, "is_published": true, "links": { "access": "https://zenodo.org/api/records/2577103/access", "access_links": "https://zenodo.org/api/records/2577103/access/links", "access_request": "https://zenodo.org/api/records/2577103/access/request", "access_users": "https://zenodo.org/api/records/2577103/access/users", "archive": "https://zenodo.org/api/records/2577103/files-archive", "archive_media": "https://zenodo.org/api/records/2577103/media-files-archive", "communities": "https://zenodo.org/api/records/2577103/communities", "communities-suggestions": "https://zenodo.org/api/records/2577103/communities-suggestions", "doi": "https://doi.org/10.5281/zenodo.2577103", "draft": "https://zenodo.org/api/records/2577103/draft", "files": "https://zenodo.org/api/records/2577103/files", "latest": "https://zenodo.org/api/records/2577103/versions/latest", "latest_html": "https://zenodo.org/records/2577103/latest", "media_files": "https://zenodo.org/api/records/2577103/media-files", "parent": "https://zenodo.org/api/records/1218852", "parent_doi": "https://zenodo.org/doi/10.5281/zenodo.1218852", "parent_html": "https://zenodo.org/records/1218852", "requests": "https://zenodo.org/api/records/2577103/requests", "reserve_doi": "https://zenodo.org/api/records/2577103/draft/pids/doi", "self": "https://zenodo.org/api/records/2577103", "self_doi": "https://zenodo.org/doi/10.5281/zenodo.2577103", "self_html": "https://zenodo.org/records/2577103", "self_iiif_manifest": "https://zenodo.org/api/iiif/record:2577103/manifest", "self_iiif_sequence": "https://zenodo.org/api/iiif/record:2577103/sequence/default", "versions": "https://zenodo.org/api/records/2577103/versions" }, "media_files": { "count": 0, "enabled": false, "entries": {}, "order": [], "total_bytes": 0 }, "metadata": { "creators": [ { "affiliations": [ { "name": "Tel Aviv University" } ], "person_or_org": { "family_name": "Marcelo Taube", "name": "Marcelo Taube", "type": "personal" } }, { "affiliations": [ { "name": "University of California at Los Angeles" } ], "person_or_org": { "family_name": "Giuliano Losa", "name": "Giuliano Losa", "type": "personal" } }, { "affiliations": [ { "name": "Microsoft Research" } ], "person_or_org": { "family_name": "Kenneth L. McMillan", "name": "Kenneth L. McMillan", "type": "personal" } }, { "affiliations": [ { "name": "Tel Aviv University" } ], "person_or_org": { "family_name": "Oded Padon", "name": "Oded Padon", "type": "personal" } }, { "affiliations": [ { "name": "Tel Aviv University" } ], "person_or_org": { "family_name": "Mooly Sagiv", "name": "Mooly Sagiv", "type": "personal" } }, { "affiliations": [ { "name": "Tel Aviv University" } ], "person_or_org": { "family_name": "Sharon Shoham", "name": "Sharon Shoham", "type": "personal" } }, { "affiliations": [ { "name": "University of Washington" } ], "person_or_org": { "family_name": "James R.Wilcox", "name": "James R.Wilcox", "type": "personal" } }, { "affiliations": [ { "name": "University of Washington" } ], "person_or_org": { "family_name": "Doug Woos", "name": "Doug Woos", "type": "personal" } } ], "description": "
This is the artifact of the paper. Its a compressed virtual machine that can be imported by VirtualBox.
\n\n\n\n
Abstract of the paper:
\n\nProof 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.
", "languages": [ { "id": "eng", "title": { "en": "English" } } ], "publication_date": "2018-04-16", "publisher": "Zenodo", "resource_type": { "id": "publication-article", "title": { "de": "Zeitschriftenartikel", "en": "Journal article" } }, "rights": [ { "description": { "en": "The Creative Commons Attribution license allows re-distribution and re-use of a licensed work on the condition that the creator is appropriately credited." }, "icon": "cc-by-icon", "id": "cc-by-4.0", "props": { "scheme": "spdx", "url": "https://creativecommons.org/licenses/by/4.0/legalcode" }, "title": { "en": "Creative Commons Attribution 4.0 International" } } ], "title": "Modularity for Decidability of Deductive Verification with Applications to Distributed Systems", "version": "1" }, "parent": { "access": { "owned_by": { "user": 44975 } }, "communities": {}, "id": "1218852", "pids": { "doi": { "client": "datacite", "identifier": "10.5281/zenodo.1218852", "provider": "datacite" } } }, "pids": { "doi": { "client": "datacite", "identifier": "10.5281/zenodo.2577103", "provider": "datacite" }, "oai": { "identifier": "oai:zenodo.org:2577103", "provider": "oai" } }, "revision_id": 5, "stats": { "all_versions": { "data_volume": 1176743425228.0, "downloads": 161, "unique_downloads": 134, "unique_views": 507, "views": 552 }, "this_version": { "data_volume": 561525063680.0, "downloads": 76, "unique_downloads": 68, "unique_views": 238, "views": 260 } }, "status": "published", "updated": "2020-01-20T16:48:49.488370+00:00", "versions": { "index": 2, "is_latest": true } }