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

doi:10.1145/3192366.3192414

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

School of Physics and Astronomy

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	662-677
Number of pages	16
Journal	ACM SIGPLAN Notices
Volume	53
Issue number	4
DOIs	https://doi.org/10.1145/3192366.3192414
State	Published - 11 Jun 2018

Keywords

Decidable logic
Distributed systems
Formal verification
Ivy
Modularity
Paxos
Raft

All Science Journal Classification (ASJC) codes

General Computer Science

Access to Document

10.1145/3192366.3192414

Cite this

@article{3a338ef4936542b4abe435c6279ccf2e,

title = "Modularity for decidability of deductive verification with applications to distributed systems",

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

keywords = "Decidable logic, Distributed systems, Formal verification, Ivy, Modularity, Paxos, Raft",

author = "Marcelo Taube and Giuliano Losa and McMillan, \{Kenneth L.\} and Oded Padon and Mooly Sagiv and Sharon Shoham and Wilcox, \{James R.\} and Doug Woos",

note = "Publisher Copyright: {\textcopyright} 2018 ACM.",

year = "2018",

month = jun,

day = "11",

doi = "10.1145/3192366.3192414",

language = "الإنجليزيّة",

volume = "53",

pages = "662--677",

journal = "ACM SIGPLAN Notices",

issn = "1523-2867",

publisher = "Association for Computing Machinery (ACM)",

number = "4",

}

TY - JOUR

T1 - Modularity for decidability of deductive verification with applications to distributed systems

AU - Taube, Marcelo

AU - Losa, Giuliano

AU - McMillan, Kenneth L.

AU - Padon, Oded

AU - Sagiv, Mooly

AU - Shoham, Sharon

AU - Wilcox, James R.

AU - Woos, Doug

PY - 2018/6/11

Y1 - 2018/6/11

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

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

KW - Decidable logic

KW - Distributed systems

KW - Formal verification

KW - Ivy

KW - Modularity

KW - Paxos

KW - Raft

UR - http://www.scopus.com/inward/record.url?scp=85084444976&partnerID=8YFLogxK

U2 - 10.1145/3192366.3192414

DO - 10.1145/3192366.3192414

M3 - مقالة

SN - 1523-2867

VL - 53

SP - 662

EP - 677

JO - ACM SIGPLAN Notices

JF - ACM SIGPLAN Notices

IS - 4

ER -

Modularity for decidability of deductive verification with applications to distributed systems

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this