Automatic Verification of Parameterized Cache Coherence Protocols

Delzanno, Giorgio

doi:10.1007/10722167_8

Cited by 146 publications

(178 citation statements)

References 28 publications

Supporting

Mentioning

176

Contrasting

Order By: Relevance

“…Moreover [14,16,21] do not report experimental results for cache protocols. In [8], Delzanno uses arithmetical constraints to model global states of systems with many identical caches. His method uses invariant checking via backward reachability analysis of [1] and provides a broad framework for reasoning about cache coherence protocols but his procedure does not terminate on some examples.…”

Section: Discussionmentioning

confidence: 99%

“…More recently, a decision procedure based on a modification of the backward reachability algorithm that guarantees termination for all snoopy cache protocols has been given in [12]. However, the backward reachability algorithm of [1] that [8,12,16], make use of, although general, suffers from the handicap that the best known bound for its running time is not known to be primitive recursive. Furthermore, this technique does not provide a way to generate error traces when a bug is detected.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Exact and Efficient Verification of Parameterized Cache Coherence Protocols

Kahlon

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. For reasoning about general snoopy cache protocols, we introduce the guarded broadcast protocols model and show how an abstract history graph construction can be used to reason about safety properties for this framework. Although the worst case size of the abstract history graph can be exponential in the size of the transition diagram of the given protocol, the actual size is small for standard cache protocols as is evidenced by our experimental results. The framework can handle all 8 of the cache protocols in [19] as well as their split-transaction versions. We next identify a framework called initialized broadcast protocols suitable for reasoning about invalidation-based snoopy cache protocols and show how to reduce reasoning about such systems with an arbitrary number of caches to a system with at most 7 caches. This yields a provably polynomial time algorithm for the parameterized verification of invalidation based snoopy protocols. Our results apply to both safety and liveness properties. Finally, we present a methodology for reducing parameterized reasoning about directory based protocols to snoopy protocols, thus leveraging techniques developed for verifying snoopy protocols to directory based ones, which are typically are much harder to reason about. We demonstrate by reducing reasoning about a directory based protocol suggested by German [17] to the ESI snoopy protocol, a modification of the MSI snoopy protocol.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

Exact and Efficient Verification of Parameterized Cache Coherence Protocols

Kahlon

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Since parameterized systems contain process types with large number of behaviorally similar processes (whose behavior follows a local finite state machine or FSM), a natural state space abstraction is to group the processes based on which state of the local FSM they reside in [23,7,24]. Thus, instead of saying "process 1 is in state s, process 2 is in state t and process 3 is in state s" -we simply say "2 processes are in state s and 1 is in state t".…”

Section: Introductionmentioning

confidence: 99%

Fair Model Checking with Process Counter Abstraction

Sun

Liu

Roychoudhury

et al. 2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Parameterized systems are characterized by the presence of a large (or even unbounded) number of behaviorally similar processes, and they often appear in distributed/concurrent systems. A common state space abstraction for checking parameterized systems involves not keeping track of process identifiers by grouping behaviorally similar processes. Such an abstraction, while useful, conflicts with the notion of fairness. Because process identifiers are lost in the abstraction, it is difficult to ensure fairness (in terms of progress in executions) among the processes. In this work, we study the problem of fair model checking with process counter abstraction. Even without maintaining the process identifiers, our on-the-fly checking algorithm enforces fairness by keeping track of the local states from where actions are enabled / executed within an execution trace. We enhance our home-grown PAT model checker with the technique and show its usability via the automated verification of several real-life protocols.

show abstract

“…This case study is the verification of parameterized mutual exclusion protocol, which was used as a running example in [2]. The protocol is specified as a parameterized system of finite automata arranged in the linear array.We conclude with a general claim of relative completeness of the proposed method with respect to the verification methods presented in [1,4,2]. In the ongoing work we aim to formally support this claim.…”

mentioning

confidence: 52%

“…We conclude with a general claim of relative completeness of the proposed method with respect to the verification methods presented in [1,4,2]. In the ongoing work we aim to formally support this claim.…”

mentioning

confidence: 52%

Finite countermodels as invariants. A case study in verification of parameterized mutual exclusion protocol

Lisitsa¹

EPiC Series in Computing

View full text Add to dashboard Cite

In [5,6] we proposed a simple but powerful approach to the verification of safety properties of parameterized and infinite state systems. Consider encoding e : s → ϕ s of states of a transition system S = S, → by formulae of first-order predicate logic satisfying the folowing property. The state s ′ is reachable from s, i.e. s → * s ′ if and only if ϕ s ′ is the logical consequence ofUnder such assumptions establishing reachability amounts to theorem proving, while deciding nonreachability, becomes theorem disproving. To verify a safety property, i.e non-reachability of unsafe states, it is sufficient to disprove a formula of the form φ → ψ. We proposed in [5,6] to delegate the latter task to generic finite model finding procedures for first-order predicate logic [3]. We show in [5] that the parallel composition of a complete finite model finder and a complete theorem prover is a decision procedure for safety properties of lossy channel systems [1] under appropriate encoding. Using a finite model finder Mace4 coupled with a theorem prover Prover9 [7] we successfully applied the method to the verification of alternating bit protocol, specified by a lossy channel system; all parameterized cache coherence protocols from [4]; series of coverability and reachability tasks for Petri Nets; parameterized Dining Philosophers Problem (DPP) and to parameterized linear systems (arrays) of finite automata. 1 When the safety is verified, the method produces a finite countermodel, which is a concise representation of a system invariant. We discuss the invariants produced for some of the mentioned examples, focussing on the one case study. This case study is the verification of parameterized mutual exclusion protocol, which was used as a running example in [2]. The protocol is specified as a parameterized system of finite automata arranged in the linear array.We conclude with a general claim of relative completeness of the proposed method with respect to the verification methods presented in [1,4,2]. In the ongoing work we aim to formally support this claim. References[1] Parosh Aziz Abdulla, Jonsson B. Verifying programs with unreliable channels.

show abstract

Automatic Verification of Parameterized Cache Coherence Protocols

Cited by 146 publications

References 28 publications

Exact and Efficient Verification of Parameterized Cache Coherence Protocols

Exact and Efficient Verification of Parameterized Cache Coherence Protocols

Fair Model Checking with Process Counter Abstraction

Finite countermodels as invariants. A case study in verification of parameterized mutual exclusion protocol

Contact Info

Product

Resources

About