Bounded Model Checking of CTL

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.

[1]  Hans K. Buning,et al.  Propositional Logic: Deduction and Algorithms , 1999 .

[2]  Bozena Wozna,et al.  ACTLS properties and Bounded Model Checking , 2004, Fundam. Informaticae.

[3]  Nachum Dershowitz,et al.  Bounded Model Checking with QBF , 2005, SAT.

[4]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[5]  Kenneth L. McMillan,et al.  Symbolic model checking , 1992 .

[6]  Anil Nerode,et al.  Logic for Applications , 1997, Graduate Texts in Computer Science.

[7]  Amir Pnueli.  The Temporal Semantics of Concurrent Programs , 1981, Theor. Comput. Sci..

[8]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[9]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[10]  Yoram Hirshfeld,et al.  Logics for Real Time: Decidability and Complexity , 2004, Fundam. Informaticae.

[11]  Mordechai Ben-Ari,et al.  The temporal logic of branching time , 1981, POPL '81.

[12]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[13]  Xiaowei Li,et al.  Formal Verification Techniques Based on Boolean Satisfiability Problem , 2005, Journal of Computer Science and Technology.