Model Checking with Quantified Boolean Formulas

@inproceedings{Sackler2005ModelCW,
  title={Model Checking with Quantified Boolean Formulas},
  author={Beverly Sackler},
  year={2005}
}
Modern symbolic model checking techniques use Binary Decision Diagrams (BDD) and propositional satisfiability (SAT) decision procedures for checking validity and satisfiability of propositional Boolean formulas, which are used to encode sub-problems of symbolic model checking. Usage of propositional formulas imposes a potential exponential memory blow-up on the model checking algorithms due to the big formula sizes. Model checking methods based on the validity of Quantified Boolean Formulas… CONTINUE READING

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…