The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Record & play: a structural fixed point iteration for sequential circuit verification
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Checking Safety Properties Using Induction and a SAT-Solver
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
An approach for extracting a small unsatisfiable core
Formal Methods in System Design
Linear-Time Reductions of Resolution Proofs
HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
Interpolant-based transition relation approximation
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
| Hi-index | 0.00 |
We propose a method for extending a bounded resolution proof to an unbounded inductive proof. More specifically, given a resolution proof that a state machine beginning at an initial state satisfies some property at cycle k , we show that the existence of a Δ -invariant cut implies that the property holds for cycles k + Δ , k + 2Δ , etc. We suggest a linear algorithm for identifying such Δ -extendible proofs and develop the required theory for covering all cycles by Δ -extendible proofs. To expose Δ -invariant cuts, we develop an efficient proof manipulation algorithm that rearranges the proof by the natural temporal order. We demonstrate the applicability of our techniques on a few real-life examples.