ParaVerifier: An Automatic Framework for Proving Parameterized Cache Coherence Protocols

Li, Yongjian; Pang, Jun; Lv, Yi; Fan, Dongrui; Cao, Shan; Duan, Kaiqiang

doi:10.1007/978-3-319-24953-7_15

“…Verification of parameterized systems using SMT solvers is further explored in MCMT [66], Cubicle [22], and paraVerifier [52]. Abdulla et al [6] proposed view abstraction to compute the reachable set for finite instances using forward reachability until cutoff is reached.…”

Section: Related Workmentioning

confidence: 99%

On Symmetry and Quantification: A New Approach to Verify Distributed Protocols

Goel

¹

,

Sakallah

²

2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Proving that an unbounded distributed protocol satisfies a given safety property amounts to finding a quantified inductive invariant that implies the property for all possible instance sizes of the protocol. Existing methods for solving this problem can be described as search procedures for an invariant whose quantification prefix fits a particular template. We propose an alternative constructive approach that does not prescribe, a priori, a specific quantifier prefix. Instead, the required prefix is automatically inferred without any search by carefully analyzing the structural symmetries of the protocol. The key insight underlying this approach is that symmetry and quantification are closely related concepts that express protocol invariance under different re-arrangements of its components. We propose symmetric incremental induction, an extension of the finite-domain IC3/PDR algorithm, that automatically derives the required quantified inductive invariant by exploiting the connection between symmetry and quantification. While various attempts have been made to exploit symmetry in verification applications, to our knowledge, this is the first demonstration of a direct link between symmetry and quantification in the context of clause learning during incremental induction. We also describe a procedure to automatically find a minimal finite size, the cutoff, that yields a quantified invariant proving safety for any size.Our approach is implemented in IC3PO, a new verifier for distributed protocols that significantly outperforms the state-of-the-art, scales orders of magnitude faster, and robustly derives compact inductive invariants fully automatically.

show abstract

“…Verification of parameterized systems using SMT solvers is further explored in MCMT [67], Cubicle [23], and paraVerifier [52]. Abdulla et al [7] proposed view abstraction to compute the reachable set for finite instances using forward reachability until cutoff is reached.…”

Section: Related Workmentioning

confidence: 99%

On Symmetry and Quantification: A New Approach to Verify Distributed Protocols

Goel,

Sakallah

2021

Preprint

0

View full text Add to dashboard Cite

Proving that an unbounded distributed protocol satisfies a given safety property amounts to finding a quantified inductive invariant that implies the property for all possible instance sizes of the protocol. Existing methods for solving this problem can be described as search procedures for an invariant whose quantification prefix fits a particular template. We propose an alternative constructive approach that does not prescribe, a priori, a specific quantifier prefix. Instead, the required prefix is automatically inferred without any search by carefully analyzing the structural symmetries of the protocol. The key insight underlying this approach is that symmetry and quantification are closely related concepts that express protocol invariance under different re-arrangements of its components. We propose symmetric incremental induction, an extension of the finite-domain IC3/PDR algorithm, that automatically derives the required quantified inductive invariant by exploiting the connection between symmetry and quantification. While various attempts have been made to exploit symmetry in verification applications, to our knowledge, this is the first demonstration of a direct link between symmetry and quantification in the context of clause learning during incremental induction. We also describe a procedure to automatically find a minimal finite size, the cutoff, that yields a quantified invariant proving safety for any size.Our approach is implemented in IC3PO, a new verifier for distributed protocols that significantly outperforms the state-of-the-art, scales orders of magnitude faster, and robustly derives compact inductive invariants fully automatically.

show abstract

“…We have implemented our approach in a prototype paraVerifier [Li et al 2015] and used it to check some other examples: typical bus-snoop benchmarks such as MESI and MOESI, as well as directory-based benchmarks such as German. The MESI protocol (also known as the Illinois protocol) is an invalidate-based cache coherence protocol, and it is one of the Fig.…”

Section: Other Experimentsmentioning

confidence: 99%

An Automatic Proving Approach to Parameterized Verification

Li

¹

,

Duan

²

,

Jansen

³

et al. 2018

ACM Trans. Comput. Logic

Self Cite

View full text Add to dashboard Cite

Formal verification of parameterized protocols such as cache coherence protocols is a significant challenge. In this paper, we propose an automatic proving approach and its prototype paraVerifier to handle this challenge within a unified framework: (1) in order to prove the correctness of a parameterized protocol, our approach automatically discovers auxiliary invariants and the corresponding dependency relations among the discovered invariants and protocol rules from a small instance of the to-be-verified protocol; (2) the discovered invariants and dependency graph are then automatically generalized into a parameterized form and sent to the theorem prover Isabelle. As a side product, the final verification result of a protocol is provided by a formal and human-readable proof. Our approach has been successfully applied to a number of benchmarks including snoopying-based and directory-based cache coherence protocols.

show abstract

ParaVerifier: An Automatic Framework for Proving Parameterized Cache Coherence Protocols

Cited by 5 publications

References 15 publications

On Symmetry and Quantification: A New Approach to Verify Distributed Protocols

On Symmetry and Quantification: A New Approach to Verify Distributed Protocols

On Symmetry and Quantification: A New Approach to Verify Distributed Protocols

An Automatic Proving Approach to Parameterized Verification

Contact Info

Product

Resources

About