Towards Bounded Model Checking for the Universal Fragment of TCTL

Evaluation of SAT-based Bounded Model Checking of ACTL Properties

“…In this section, we introduce two sat-based bounded model checking methods for ACTL properties which are for error detection [16] and verification of valid properties [23] respectively. Both algorithms are about reducing the model checking problem (M |= ϕ) to the bounded model checking problem (M k |= k ϕ), and how M k |= k ϕ relates to the satisfiability problem of the final encoding we get.…”

“…Let F ORM be the set of ECTL formulas. [16] defined a function f e k : F ORM → N which can be used instead of N k . …”

“…Due to advances in algorithms and tools for the Boolean satisfiability problem (SAT) [14], formal reasoning based on SAT is proven to be an alternative to BDDs, and bounded model checking based on SAT has been introduced as a complementary method to BDD-based symbolic model checking of LTL and ACTL properties [4,5,16,22,23]. The basic idea of the approach presented in [4,5,16] is to search for a counterexample of a particular bound k. First, the approach generates a propositional formula, and then a SAT solver will be used to check the formula, and if the formula is satisfied by the SAT solver, it means a counterexample exists, so the approach is designed to find errors.…”

“…The basic idea of the approach presented in [4,5,16] is to search for a counterexample of a particular bound k. First, the approach generates a propositional formula, and then a SAT solver will be used to check the formula, and if the formula is satisfied by the SAT solver, it means a counterexample exists, so the approach is designed to find errors. For checking systems that are error free with respect to given properties, the approach is not practical because the bound k needed to be checked is usually too big (general over approximations of the bounds for LTL and ACTL are respectively |M | · 2 |ϕ| and |M |, where |M | is the size of the model and |ϕ| is the size of the formula).…”

“…We consider two bounded model checking methods [16,23], which are for error detection and verification of ACTL properties respectively, and then combine them to a BMC algorithm. We have implemented a tool named BMV (bounded model verifier) based on this algorithm, and carried out a number of experiments, and then we make a comparison of BMV and Cadence SMV [24].…”