Intertwined Forward-Backward Reachability Analysis Using Interpolants
نویسندگان
چکیده
In this work we develop a novel SAT-based verification approach which is based on interpolation. The novelty of our approach is in extracting interpolants in both forward and backward manner and exploiting them for an intertwined approximated forward and backward reachability analysis. Our approach is also mostly local and avoids unrolling of the checked model as much as possible. This results in an efficient and complete SAT-based verification algorithm. We implemented our algorithm and compared it with both McMillan’s interpolation-based algorithm and with IC3, on real-life industrial designs as well as on examples from the HWMCC’11 benchmark. In many cases, our algorithm outperformed both methods.
منابع مشابه
Comparing Forward and Backward Reachability as Tools for Safety Analysis
Using only the existence and uniqueness of trajectories for a generic dynamic system with inputs, we de ne and examine eight types of forward and backward reachability constructs. If the input is treated in a worst-case fashion, any forward or backward reach set or tube can be used for safety analysis, but if the input is treated in a best-case fashion only the backward reach tube always provid...
متن کاملA Combination of Forward and Backward Reachability Analysis Methods
Induction-guided falsification (IGF) is a combination of bounded model checking (BMC) and structural induction, which can be used for falsification of invariants. IGF can also be regarded as a combination of forward and backward reachability analysis methods. This is because BMC is a forward reachability analysis method and structural induction can be regarded as a backward reachability analysi...
متن کاملImproving Reachability Analysis of Infinite State Systems by Specialization
We consider infinite state reactive systems specified by using linear constraints over the integers, and we address the problem of verifying safety properties of these systems by applying reachability analysis techniques. We propose a method based on program specialization, which improves the effectiveness of the backward and forward reachability analyses. For backward reachability our method c...
متن کاملRegular Symbolic Analysis of Dynamic Networks of Pushdown Systems
We introduce two abstract models for multithreaded programs based on dynamic networks of pushdown systems. We address the problem of symbolic reachability analysis for these models. More precisely, we consider the problem of computing effective representations of their reachability sets using finite-state automata. We show that, while forward reachability sets are not regular in general, backwa...
متن کاملCombining Forward and Backward Abstract Interpretation of Horn Clauses
Alternation of forward and backward analyses is a standard technique in abstract interpretation of programs, which is in particular useful when we wish to prove unreachability of some undesired program states. The current state-ofthe-art technique for combining forward (bottom-up, in logic programming terms) and backward (top-down) abstract interpretation of Horn clauses is query-answer transfo...
متن کامل