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

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

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 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.

Original languageEnglish
Pages (from-to)662-677
Number of pages16
JournalACM SIGPLAN Notices
Volume53
Issue number4
DOIs
StatePublished - 11 Jun 2018

Funding

FundersFunder number
National Science Foundation1655166
Google
Horizon 2020 Framework Programme
Seventh Framework Programme321174-VSSC, FP7/2007ś2013
Blavatnik Family Foundation
European Research Council
United States-Israel Binational Science Foundation2016260, 2012259
Tel Aviv University
Horizon 2020759102

    Keywords

    • Decidable logic
    • Distributed systems
    • Formal verification
    • Ivy
    • Modularity
    • Paxos
    • Raft

    Fingerprint

    Dive into the research topics of 'Modularity for decidability of deductive verification with applications to distributed systems'. Together they form a unique fingerprint.

    Cite this