A Partial Order Approach to Branching Time Logic Model Checking

Gerth, Rob; Kuiper, Ruurd; Peled, Doron; Penczek, Wojciech

doi:10.1006/inco.1998.2778

Cited by 53 publications

(30 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Condition D1' is very similar to condition C1 [5], which is common in the context of ample sets. However, C1 requires that action a is globally independent of each of the actions a 1 , .…”

Section: Strengthening Condition D1mentioning

confidence: 78%

See 1 more Smart Citation

The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction

Neele

Valmari

Willemse

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In model checking, partial-order reduction (POR) is an effective technique to reduce the size of the state space. Stubborn sets are an established variant of POR and have seen many applications over the past 31 years. One of the early works on stubborn sets shows that a combination of several conditions on the reduction is sufficient to preserve stutter-trace equivalence, making stubborn sets suitable for model checking of linear-time properties. In this paper, we identify a flaw in the reasoning and show with a counter-example that stutter-trace equivalence is not necessarily preserved. We propose a solution together with an updated correctness proof. Furthermore, we analyse in which formalisms this problem may occur. The impact on practical implementations is limited, since they all compute a correct approximation of the theory.

show abstract

“…Condition D1' is very similar to condition C1 [5], which is common in the context of ample sets. However, C1 requires that action a is globally independent of each of the actions a 1 , .…”

Section: Strengthening Condition D1mentioning

confidence: 78%

“…When applying stubborn sets in that context, stronger conditions are required to preserve the branching structure that CTL −X reasons about. Namely, the original LSTS must be deterministic and one more condition needs to be added [5]:…”

Section: Deterministic Lstss and Ctl −X Model Checkingmentioning

confidence: 99%

The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction

Neele

Valmari

Willemse

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The heuristic function takes structural properties of the state space as well as properties of the requirements specification into account. (1) procedure GSEA(s) (2) Closed ← ∅; Open ← {s} (3) while not Open.empty() do (4) u ← Open.extract(); Closed.insert(u); (5) if goal(u) then return solution; (6) for each a ∈ enabledT do (7) v ← τ (u, a); process (v); (8) if reopenOK(v) then Closed .delete(v); (9) if v ∈ Closed and v ∈ Open then Open.insert(v);…”

Section: Directed Model Checkingmentioning

confidence: 99%

Partial-Order Reduction for General State Exploring Algorithms

Bošnački

Leue

Lafuente

2006

Model Checking Software

View full text Add to dashboard Cite

An important component of partial-order based reduction algorithms is the condition that prevents action ignoring, commonly known as the cycle proviso. In this paper we give a new version of this proviso that is applicable to a general search algorithm skeleton also known as the General State Expanding Algorithm (GSEA). GSEA maintains a set of open (visited but not expanded) states from which states are iteratively selected for exploration and moved to a closed set of states (visited and expanded). Depending on the open set data structure used, GSEA can be instantiated as depth-first, breadth-first, or a directed search algorithm. The proviso is characterized by reference to the open and closed set of states in GSEA. As a result the proviso can be computed in an efficient manner during the search based on local information. We implemented partial-order reduction for GSEA based on our proposed proviso in the tool HSF-SPIN, which is an extension of the model checker SPIN for directed model checking. We evaluate the state space reduction achieved by partial-order reduction according to the proviso that we propose by comparing it on a set of benchmark problems to other reduction approaches. We also compare the use of breadth-first search and A*, two algorithms ensuring that counterexamples of minimal length will be found, together with the proviso that we propose.

show abstract

“…The BIR fragment in figure 5 illustrates how the compound test on lines [18][19][20] of figure 2 is translated to a series of guarded transformations in BIR and how a field assignment is expressed directly.…”

Section: Basic Transformations and Visibilitymentioning

confidence: 99%

“…An invisible action is however not independent with other non-deterministic choices of the same thread, and for this reason we need to preserve the internal branching structure of a thread when defining the transition system. It can been shown that treating invisible transformations by disallowing interleavings with other threads generates a labeled transition system that is branching bisimilar [20] to the fully interleaved one. Assuming that the invisible labeling of transformations preserves state stuttering i.e., two states connected by an invisible transition will satisfy the same set of predicates, this semantics strongly preserves the truth value of formulas written in the next-free CTL* temporal logic [44].…”

Section: Transition Systemmentioning

confidence: 99%

Translating Java for Multiple Model Checkers: The Bandera Back-End

Iosif

Dwyer

Hatcliff

2005

Form Method Syst Des

View full text Add to dashboard Cite

One approach to model checking program source code is to view a model checker as a target machine. In this setting, program source code is translated to a model checker's input language using a process that shares much in common with program compilation. For example, well-defined intermediate program representations are used to stage the translation through a series of analyses and optimizing transformations and target-specific details are isolated in code generation modules.In this paper, we present the Bandera Intermediate Representation (BIR)-a guarded-assignment transformation system language that has been designed to support the translation of Java programs to a variety of model checkers. BIR includes constructs, such as inheritance, dynamic creation of data, and locking primitives, that are designed to model the semantics of Java primitives. BIR also includes several non-deterministic choice constructs that support abstraction in modeling and specification of properties of dynamic heap structures.We have developed a BIR-based tool infrastructure that has been applied to develop customized analysis frameworks for several different input languages using different model checking tools. We present BIR's type system and operational semantics in sufficient detail to support similar applications by other researchers. This semantics details several state space reductions and state space search variations. We describe the translation of Java to BIR and how BIR is translated to the input languages of several model checkers.

show abstract

A Partial Order Approach to Branching Time Logic Model Checking

Cited by 53 publications

References 2 publications

The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction

The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction

Partial-Order Reduction for General State Exploring Algorithms

Translating Java for Multiple Model Checkers: The Bandera Back-End

Contact Info

Product

Resources

About