We propose an improvement of the famous IC3 algorithm for model checking safety properties of finite state systems. We collect models computed by the SAT-solver during the clause propagation phase of the algorithm and use them as witnesses for why the respective clauses could not be pushed forward. It only makes sense to recheck a particular clause for pushing when its witnessing model falsifies a newly added clause. Since this trigger test is both computationally cheap and sufficiently precise, we can afford to keep clauses pushed as far as possible at all times. Experiments indicate that this strategy considerably improves IC3's performance
In the framework of symbolic model checking, BDD-based approximate reachability is potentially much ...
The design of safety-critical systems often requires design space exploration: comparing several sys...
AbstractIn Bounded Model Checking (BMC), the search for counterexamples of increasing lengths is tra...
We propose an improvement of the famous IC3 algorithm for model checking safety properties of finite...
This paper addresses the problem of SAT solver per- formance in IC3, one of the major recent breakth...
We address the problem of verifying invariant properties on infinite-state systems. We present a nov...
Model checking [3] is an automatic approach to formally verifying that a given system satisfies a gi...
Abstract—This paper 1 addresses the problem of SAT solver performance in IC3, one of the major recen...
IC3/PDR and its variants have been the prominent approaches to safety model checking in recent years...
In this article, we revise our constraint-based abstraction refinement technique for checking tempor...
AbstractWe show how a very modest modification to a typical modern SAT-solver enables it to solve a ...
Abstract. We present a novel approach for generalizing the IC3 algorithm for invariant checking from...
We present a novel approach for generalizing the IC3 algorithm for invariant checking from finite-st...
Abstract. We present several algorithms for simultaneous SAT (propositional satisfiability) based mo...
International audienceModel checkers use automated state exploration in order to prove various prope...
In the framework of symbolic model checking, BDD-based approximate reachability is potentially much ...
The design of safety-critical systems often requires design space exploration: comparing several sys...
AbstractIn Bounded Model Checking (BMC), the search for counterexamples of increasing lengths is tra...
We propose an improvement of the famous IC3 algorithm for model checking safety properties of finite...
This paper addresses the problem of SAT solver per- formance in IC3, one of the major recent breakth...
We address the problem of verifying invariant properties on infinite-state systems. We present a nov...
Model checking [3] is an automatic approach to formally verifying that a given system satisfies a gi...
Abstract—This paper 1 addresses the problem of SAT solver performance in IC3, one of the major recen...
IC3/PDR and its variants have been the prominent approaches to safety model checking in recent years...
In this article, we revise our constraint-based abstraction refinement technique for checking tempor...
AbstractWe show how a very modest modification to a typical modern SAT-solver enables it to solve a ...
Abstract. We present a novel approach for generalizing the IC3 algorithm for invariant checking from...
We present a novel approach for generalizing the IC3 algorithm for invariant checking from finite-st...
Abstract. We present several algorithms for simultaneous SAT (propositional satisfiability) based mo...
International audienceModel checkers use automated state exploration in order to prove various prope...
In the framework of symbolic model checking, BDD-based approximate reachability is potentially much ...
The design of safety-critical systems often requires design space exploration: comparing several sys...
AbstractIn Bounded Model Checking (BMC), the search for counterexamples of increasing lengths is tra...