Modularity for decidability of deductive verification with applications to distributed systems

被引:21
|
作者
Taube M. [1 ]
Losa G. [2 ]
McMillan K.L. [3 ]
Padon O. [1 ]
Sagiv M. [1 ]
Shoham S. [1 ]
Wilcox J.R. [4 ]
Woos D. [4 ]
机构
[1] Taube, Marcelo
[2] Losa, Giuliano
[3] McMillan, Kenneth L.
[4] Padon, Oded
[5] Sagiv, Mooly
[6] Shoham, Sharon
[7] Wilcox, James R.
[8] Woos, Doug
来源
| 2018年 / Association for Computing Machinery, 2 Penn Plaza, Suite 701, New York, NY 10121-0701, United States卷 / 53期
基金
欧洲研究理事会; 美国国家科学基金会; 欧盟地平线“2020”;
关键词
Decidable logic; Distributed systems; Formal verification; Ivy; Modularity; Paxos; Raft;
D O I
10.1145/3192366.3192414
中图分类号
学科分类号
摘要
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. © 2018 ACM.
引用
收藏
页码:662 / 677
页数:15
相关论文
共 50 条