Symbolic Model Checking: 10^20 States and Beyond

@article{Burch1992SymbolicMC,
  title={Symbolic Model Checking: 10^20 States and Beyond},
  author={Jerry R. Burch and Edmund M. Clarke and Kenneth L. McMillan and David L. Dill and L. James Hwang},
  journal={Inf. Comput.},
  year={1992},
  volume={98},
  pages={142-170}
}
Combining Symbolic Model Checking with Uninterpreted Functions for Out-of-Order Processor Verification
TLDR
This work presents a new approach to the verification of hardware systems with data dependencies using temporal logic symbolic model checking that uses symbolic values and instructions instead of concrete ones to show the correctness of the machine independently of the actual instruction set architecture and the implementation of the functional units.
Bounded model checking of infinite state systems
TLDR
A new approach to BMC is presented that extends current methods in three ways: instead of a reduction to propositional logic which restricts BMC to finite state systems, this work focuses on infinite state systems and therefore considers more powerful, yet decidable base logics.
Sequential circuit verification using symbolic model checking
TLDR
The temporal logic model algorithm of E.M. Clarke is modified to represent a state graph using binary decision diagrams (BDDs), which captures some of the regularity in the state space of sequential circuits with data path logic, and it is possible to handle a number of important liveness and fairness properties.
Paper B Compositional and Symbolic Model-checking of Real- Time Systems
In this paper, we present symbolic and compositional techniques to avoid state explosion problems in model-checking for networks of timed automata. The symbolic technique is based on partitioning the
Symbolic Model Checking with Past and Future Temporal Modalities: Fundamentals and Algorithms
TLDR
The principles and a tool for checking their properties in a temporal logic that allows both past and future oriented modalities are presented and several algorithms to traverse the set of states symbolically are presented.
Freedom, weakness, and determinism: from linear-time to branching-time
  • O. KupfermanMoshe Y. Vardi
  • Computer Science, Mathematics
    Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226)
  • 1998
TLDR
This paper shows that a linear-time property can be specified in the alternation-free /spl mu/-calculus if it can be recognized by a deterministic Buchi automation, and describes the translation, when exists.
A partial approach to model checking
TLDR
A model-checking method for linear-time temporal logic that avoids the state explosion due to the modeling of concurrency by interleaving by relying on the concept of the Mazurkiewicz trace as a semantic basis and using automata-theoretic techniques.
Algorithmic Improvements in Regular Model Checking
TLDR
One improvement is to pre-process the transducer by bi-determinization, another is to use a more powerful equivalence relation for identifying histories of states in the transitive closure, and a simplified theoretical framework for showing soundness of the optimization is presented.
From linear time to branching time
TLDR
This article shows that a linear-time property can be specified in the alternation-free μ-calculus iff it can be recognized by a deterministic Büchi automaton, and studies the problem of deciding whether a Linear-time Property, specified by either an automaton or an LTL formula, can be translated to anAlternation- free μ-Calculus formula, and describes the translation.
Systematic Acceleration in Regular Model Checking
TLDR
The approach is for the first time able to verify completely automatically both safety and absence of starvation properties for a collection of parameterized synchronization protocols from the literature and shows that symbolic state-space exploration, without using abstractions, is a viable alternative for verification of parameterization systems with a linear topology.
...
...

References

SHOWING 1-10 OF 23 REFERENCES
Sequential circuit verification using symbolic model checking
TLDR
The temporal logic model algorithm of E.M. Clarke is modified to represent a state graph using binary decision diagrams (BDDs), which captures some of the regularity in the state space of sequential circuits with data path logic, and it is possible to handle a number of important liveness and fairness properties.
A Partial Approach to Model Checking
TLDR
A model-checking method for linear-time temporal logic that avoids the state explosion due to the modeling of concurrency by interleaving by relying on the concept of the Mazurkiewicz trace as a semantic basis and using automata-theoretic techniques.
Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous Systems
TLDR
This work avoids state explosion in model checking of delay-insensitive VLSI systems by not using states, and uses a specification strategy based on partial orders that allows precise description of the branching and recurrence structure of processes.
A Unified Approach For Showing Language Containment And Equivalence Between Various Types Of Omega-Automata
TLDR
The complexity of showing language containment and equivalence between a Buchi automaton and a Muller or Streett automaton is given and a six by six matrix in which each row and column is associated with one of these types of automata is given.
Stubborn sets for reduced state space generation
  • A. Valmari
  • Computer Science
    Applications and Theory of Petri Nets
  • 1989
TLDR
The “stubborn set” theory and method for generating reduced state spaces and a more advanced version suited to the analysis of properties of reactive systems is developed.
Automatic Verification of Sequential Circuits Using Temporal Logic
TLDR
An automatic verification system for sequential circuits in which specifications are expressed in a propositional temporal logic, which does not require any user assistance and is quite fast—experimental results show that state machines with several hundred states can be checked for correctness in a matter of seconds.
Representing circuits more efficiently in symbolic model checking
TLDR
This work significantly reduces the complexity of BDD-based symbolic verification by using partitioned transition relations to represent state transition graphs and was able to handle example pipelines with over l O l Z o reachable states.
Finiteness is Mu-Ineffable
  • D. Park
  • Philosophy
    Theor. Comput. Sci.
  • 1976
Verification of Synchronous Sequential Machines Based on Symbolic Execution
TLDR
An original method to compare two synchronous sequential machines consisting in a breadth first traversal of the product machine during which symbolic expressions of its observable behaviour are computed.
...
...