Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Bounded model checking for the universal fragment of CTL
Fundamenta Informaticae
Checking Safety Properties Using Induction and a SAT-Solver
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
SAT-based verification of LTL formulas
FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
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
Model checking with SAT-based characterization of ACTL formulas
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
| Hi-index | 0.00 |
SAT-based bounded model checking has been introduced as a complementary technique to BDD-based symbolic model checking in recent years and a lot of successful work has been done with this approach. The success is mostly due to the efficiency of error-detection. Verification of valid properties depends on a completeness threshold that could be too large to be practical. We discuss an approach to checking valid ACTL (the universal fragment of CTL) properties similar to bounded model checking of ACTL. Bounded model checking of ATCL has been considered in [8]. Given a model M and an ACTL formula ϕ, a series of k-models of M are constructed for k = 0, 1, 2, ..., and the process for checking ϕ proceeds as follows: start with the 0-model, if the model does not satisfy the negation of ϕ, use 1-model and so forth, until the negation of ϕ is satisfied or until a bound of k is reached. A general bound for k is the number of states of M. Trying all k-models up to the bound in order to obtain a conclusion is obviously not desirable. For attacking this problem, we propose an approach to (partly) avoid the use of such a bound.