We present a combination model checking approach using a SAT-based bounded model checker together with a BDD-based symbolic model checker to provide a more efficient counter example generation process. We provide this capability without compromising the verification capability of the symbolic model checker. The basic idea is to use the symbolic model checker to determine whether or not a property holds in the model. If the property holds, we are done. If it does not, we preempt the counterexample generation and use the SAT-based model checker for this purpose. An application of the combination approach to a version of a Flight Guidance System (FGS) from Rockwell Collins, Inc. shows huge performance gain when checking a collection of several...
Symbolic model checking with Binary Decision Diagrams (BDDs) has been successfully used in the last ...
AbstractModel checking has become a promising automated verification technique in practice. Neverthe...
Model checking has become a promising automated verification technique in practice. Nevertheless, mo...
Abstract. It has been shown that bounded model checking using a SAT solver can solve many verificati...
Symbolic model checking owes much of its success to powerful methods for reasoning about Boolean fun...
In this paper, we study the application of propositional deci-sion procedures in hardware verificati...
In this paper we present our results and experiences of using symbolic model checking to study the s...
. Bounded Model Checking based on SAT methods has recently been introduced as a complementary techni...
Symbolic Model Checking [3], [14] has proven to be a powerful technique for the verification of reac...
In this paper we present our results and experiences of using symbolic model checking to study the s...
Binary Decision Diagrams (BDDs) have been widely used in synthesis and verification. Boolean Satisfi...
Abstract. A method of symbolic model checking is introduced that uses conjunctive normal form (CNF) ...
Symbolic Model Checking [3, 14] has proven to be a powerful tech-nique for the verification of react...
Model checking has become a promising automated verification technique in practice. Nevertheless, mo...
Abstract Model checking has become a promising technique for verifying software and hardware designs...
Symbolic model checking with Binary Decision Diagrams (BDDs) has been successfully used in the last ...
AbstractModel checking has become a promising automated verification technique in practice. Neverthe...
Model checking has become a promising automated verification technique in practice. Nevertheless, mo...
Abstract. It has been shown that bounded model checking using a SAT solver can solve many verificati...
Symbolic model checking owes much of its success to powerful methods for reasoning about Boolean fun...
In this paper, we study the application of propositional deci-sion procedures in hardware verificati...
In this paper we present our results and experiences of using symbolic model checking to study the s...
. Bounded Model Checking based on SAT methods has recently been introduced as a complementary techni...
Symbolic Model Checking [3], [14] has proven to be a powerful technique for the verification of reac...
In this paper we present our results and experiences of using symbolic model checking to study the s...
Binary Decision Diagrams (BDDs) have been widely used in synthesis and verification. Boolean Satisfi...
Abstract. A method of symbolic model checking is introduced that uses conjunctive normal form (CNF) ...
Symbolic Model Checking [3, 14] has proven to be a powerful tech-nique for the verification of react...
Model checking has become a promising automated verification technique in practice. Nevertheless, mo...
Abstract Model checking has become a promising technique for verifying software and hardware designs...
Symbolic model checking with Binary Decision Diagrams (BDDs) has been successfully used in the last ...
AbstractModel checking has become a promising automated verification technique in practice. Neverthe...
Model checking has become a promising automated verification technique in practice. Nevertheless, mo...