Symbolic model checking: 1020 States and beyond

Burch, Jerry R.; Clarke, Edmund M.; McMillan, Kenneth L.; Dill, David L.; Hwang, L.J.

doi:10.1016/0890-5401(92)90017-a

Cited by 1,587 publications

(429 citation statements)

References 6 publications

Supporting

Mentioning

424

Contrasting

Unclassified

Order By: Relevance

“…In other words, in Fig. 7, an event signals the completion of a state machine's execution 1. This can be done in SMV by putting the invariant in a TRANS statement.…”

Section: Oblivious Vs Nonoblivious Synchronizationmentioning

confidence: 99%

“…The method is impractical for many large systems because of the state-explosion problem. Much more efficient for large state spaces is symbolic model checking, in which the model checker visits the whole set of states at the same time [1].…”

Section: Symbolic Model Checkingmentioning

confidence: 99%

“…The main idea is to symbolically encode a state set as a predicate over the state variables in , in the same way we encoded the initial global states s in (1 …”

Section: Symbolic Model Checkingmentioning

confidence: 99%

“…That is, if AE is the set of mutually exclusive events, we can compute the conjunction of and e I Ye P PAE e I T e P Y X e I e P Y and use the result as the transition relation in the traversals. 1 This technique requires finding a set of mutually exclusive events. To do this, we may perform a simple conservative static analysis on the precedence relation of the events.…”

Section: Pruning Using Invariantsmentioning

confidence: 99%

“…Symbolic model checking [1] based on binary decision diagrams (BDDs) [2] is an efficient state-exploration technique for finite-state systems. It has been successful in verifying and in detecting faults in many industry-scale hardware systems.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Optimizing symbolic model checking for statecharts

Chan

Anderson

Beame

et al. 2001

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

AbstractÐSymbolic model checking based on binary decision diagrams is a powerful formal verification technique for reactive systems. In this paper, we present various optimizations for improving the time and space efficiency of symbolic model checking for systems specified as statecharts. We used these techniques in our analyses of the models of a collision avoidance system and a faulttolerant electrical power distribution (EPD) system, both used on commercial aircraft. The techniques together reduce the time and space requirements by orders of magnitude, making feasible some analysis that was previously intractable. We also elaborate on the results of verifying the EPD model. The analysis disclosed subtle modeling and logical flaws not found by simulation.

show abstract

“…In other words, in Fig. 7, an event signals the completion of a state machine's execution 1. This can be done in SMV by putting the invariant in a TRANS statement.…”

Section: Oblivious Vs Nonoblivious Synchronizationmentioning

confidence: 99%

Section: Symbolic Model Checkingmentioning

confidence: 99%

“…The main idea is to symbolically encode a state set as a predicate over the state variables in , in the same way we encoded the initial global states s in (1 …”

Section: Symbolic Model Checkingmentioning

confidence: 99%

Section: Pruning Using Invariantsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Optimizing symbolic model checking for statecharts

Chan

Anderson

Beame

et al. 2001

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

show abstract

Theorem Proving

Plaisted¹

1999

Wiley Encyclopedia of Electrical and Electronics Engineering

View full text Add to dashboard Cite

The sections in this article are History, Status, and Future Prospects Propositional Logic Propositional Proof Procedures First‐order Logic First‐Order Proof Systems Equality Other Logics Current Research Areas Acknowledgment

show abstract

Model Checking

Peled

Spoletini

2009

Wiley Encyclopedia of Computer Science and Engineering

View full text Add to dashboard Cite

Model checking is an automatic technique for verifying models of software or hardware systems against their specification. This analysis is based on an exploration of the checked system's state space, hence, it is in general affected by the state explosion problem. In this article, we present the classic model checking approaches and different techniques to deal with the complexity problem. We also describe some popular model checking systems.

show abstract

Symbolic model checking: 1020 States and beyond

Cited by 1,587 publications

References 6 publications

Optimizing symbolic model checking for statecharts

Optimizing symbolic model checking for statecharts

Theorem Proving

Model Checking

Contact Info

Product

Resources

About