Bounded model checking of CTL

Authors:
Zhi-Hong Tao;Cong-Hua Zhou;Zhong Chen;Li-Fu Wang
Affiliations:
Department of Computer Science and Technology, Peking University, Beijing, China;Department of Mathematics, Nanjing University, Nanjing, China;Department of Computer Science and Technology, Peking University, Beijing, China;Department of Computer Science and Technology, Peking University, Beijing, China
Venue:
Journal of Computer Science and Technology
Year:
2007

Citing 8
Cited 2

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Symbolic model checking: 1020 states and beyond

Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
A machine program for theorem-proving

Communications of the ACM
Symbolic Model Checking

Symbolic Model Checking
Logic for Applications

Logic for Applications
Propositional Logic: Deduction and Algorithms

Propositional Logic: Deduction and Algorithms
ACTLS properties and Bounded Model Checking

Fundamenta Informaticae
Bounded model checking with QBF

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing

Bounded Semantics of CTL and SAT-Based Verification

ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Implication-based approximating bounded model checking

FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bounded Model Checking has been recently introduced as an efficient verification method for reactive systems. This technique reduces model checking of linear temporal logic to propositional satisfiability. In this paper we first present how quantified Boolean decision procedures can replace BDDs. We introduce a bounded model checking procedure for temporal logic CTL* which reduces model checking to the satisfiability of quantified Boolean formulas. Our new technique avoids the space blow up of BDDs, and extends the concept of bounded model checking.