Strengthening a property allows it to be falsified/verified at an earlier induction depth. In this paper, we propose new preprocessing techniques for explicitly identifying co-invariants for a given safety property which are then added to that property for faster verification. First, we employ a path-oriented decision making engine to quickly identify several states which have paths to states violating the property. Next, we generate a set of candidate co-invariants and propose an induction-based technique to learn true co-invariants among those candidates. All the learned co-invariants are minimized using resolution and added to the original property to strengthen it. Experiments show that the induction depth needed to prove many safety pr...
Proving that an unbounded distributed protocol satisfies a given safety property amounts to finding ...
Abstract. We present a general scheme for automated instantiation-based in-variant discovery. Given ...
Abstract. A fundamental method of analyzing a system such as a program or a circuit is invariance an...
We show how a very modest modification to a typical modern SAT-solver enables it to solve a series o...
AbstractWe show how a very modest modification to a typical modern SAT-solver enables it to solve a ...
Abstract. We present several algorithms for simultaneous SAT (propositional satisfiability) based mo...
We propose a heuristic-based method for discovering inductive invariants in the parameterized verifi...
AbstractThe work presented in this paper addresses the challenge of fully verifying complex temporal...
This paper focuses on checking safety properties for sequential circuits specified on the RT-level. ...
The work presented in this paper addresses the challenge of fully verifying complex temporal propert...
In the area of formal verification it is well known that there can be no single logic that suits all...
These are the preliminary proceedings of the second international workshop on Bounded Model Checking...
The induction-guided falsification searches a bounded reachable state space of a transition system f...
The problem of synthesizing adequate inductive invariants to prove a program correct lies at the he...
In earlier work, we developed a xpoint algorithm for automatically generating state invariants, prop...
Proving that an unbounded distributed protocol satisfies a given safety property amounts to finding ...
Abstract. We present a general scheme for automated instantiation-based in-variant discovery. Given ...
Abstract. A fundamental method of analyzing a system such as a program or a circuit is invariance an...
We show how a very modest modification to a typical modern SAT-solver enables it to solve a series o...
AbstractWe show how a very modest modification to a typical modern SAT-solver enables it to solve a ...
Abstract. We present several algorithms for simultaneous SAT (propositional satisfiability) based mo...
We propose a heuristic-based method for discovering inductive invariants in the parameterized verifi...
AbstractThe work presented in this paper addresses the challenge of fully verifying complex temporal...
This paper focuses on checking safety properties for sequential circuits specified on the RT-level. ...
The work presented in this paper addresses the challenge of fully verifying complex temporal propert...
In the area of formal verification it is well known that there can be no single logic that suits all...
These are the preliminary proceedings of the second international workshop on Bounded Model Checking...
The induction-guided falsification searches a bounded reachable state space of a transition system f...
The problem of synthesizing adequate inductive invariants to prove a program correct lies at the he...
In earlier work, we developed a xpoint algorithm for automatically generating state invariants, prop...
Proving that an unbounded distributed protocol satisfies a given safety property amounts to finding ...
Abstract. We present a general scheme for automated instantiation-based in-variant discovery. Given ...
Abstract. A fundamental method of analyzing a system such as a program or a circuit is invariance an...