Parameterized Compositional Model Checking

Namjoshi, Kedar S.; Trefler, Richard J.

doi:10.1007/978-3-662-49674-9_39

Cited by 12 publications

(29 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results build on our earlier work on balance relations and local symmetry [17,18,20]. That work focused on compositional invariants [21] the central result being that the strongest compositional invariants for balanced nodes are isomorphic.…”

Section: Discussion and Related Workmentioning

confidence: 55%

“…This is an approximate method for parameterized verification. In prior work [20], we had introduced the local PCMCP (parameterized compositional model-checking) question as a decision problem that is, in many cases, more tractable than the global PMCP (parameterized model-checking) problem. Deciding PCMCP for local mu-calculus properties is a challenging open question.…”

Section: Discussion and Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Symmetry Reduction for the Local Mu-Calculus

Namjoshi

Trefler

2018

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

Model checking large networks of processes is challenging due to state explosion. In many cases, individual processes are isomorphic, but there is insufficient global symmetry to simplify model checking. This work considers the verification of local properties, those defined over the neighborhood of a process. Considerably generalizing earlier results on invariance, it is shown that all local mu-calculus properties, including safety and liveness properties, are preserved by neighborhood symmetries. Hence, it suffices to check them locally over a set of representative process neighborhoods. In general, local verification approximates verification over the global state space; however, if process interactions are outward-facing, the relationship is shown to be exact. For many network topologies, even those with little global symmetry, analysis with representatives provides a significant, even exponential, reduction in the cost of verification. Moreover, it is shown that for network families generated from building-block patterns, neighborhood symmetries are easily determined, and verification over the entire family reduces to verification over a finite set of representative process neighborhoods.

show abstract

Section: Discussion and Related Workmentioning

confidence: 55%

Section: Discussion and Related Workmentioning

confidence: 99%

Symmetry Reduction for the Local Mu-Calculus

Namjoshi

Trefler

2018

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…Another approach is to use properties of the topology to reduce reasoning about FO-protocols to FOL. This is similar to the use of topology to reduce reasoning about parameterized finite-state systems to reasoning about finite combinations of finite-state systems in [11]. In the next section, we show how this approach can be extended to FO-protocols.…”

Section: Given the Signatures σ Cmentioning

confidence: 99%

“…In that work, cut off points are calculated during program analysis. As another example, in [7,11,12] the "cutoffs" are based on the program topology and the local structural symmetries amongst the nodes of the process interconnection networks.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Local Reasoning for Parameterized First Order Protocols

Ashmore

Gurfinkel

Trefler

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

First Order Logic (FOL) is a powerful reasoning tool for program verification. Recent work on Ivy shows that FOL is well suited for verification of parameterized distributed systems. However, specifying many natural objects, such as a ring topology, in FOL is unexpectedly inconvenient. We present a framework based on FOL for specifying distributed multi-process protocols in a process-local manner together with an implicit network topology. In the specification framework, we provide an auto-active analysis technique to reason about the protocols locally, in a process-modular way. Our goal is to mirror the way designers often describe and reason about protocols. By hiding the topology behind the FOL structure, we simplify the modelling, but complicate the reasoning. To deal with that, we use an oracle for the topology to develop a sound and relatively complete proof rule that reduces reasoning about the implicit topology back to pure FOL. This completely avoids the need to axiomatize the topology. Using the rule, we establish a property that reduces verification to a fixed number of processes bounded by the size of local neighbourhoods. We show how to use the framework on two examples, including leader election on a ring.

show abstract