Using counterexamples for improving the precision of reachability computation with polyhedra
Chao Wang,Zijiang Yang,Aarti Gupta,Franjo Ivancic +3 more
- 03 Jul 2007
- pp 352-365
TL;DR: An extrapolation with care set operator is presented to accelerate termination of reachability computation with polyhedra and two heuristic algorithms called interpolate and restrict are introduced to minimize the polyhedral representations without reducing the accuracy.
read more
Abstract: We present an extrapolation with care set operator to accelerate termination of reachability computation with polyhedra. At the same time, a counterexample guided refinement algorithm is used to iteratively expand the care set to improve the precision of the reachability computation. We also introduce two heuristic algorithms called interpolate and restrict to minimize the polyhedral representations without reducing the accuracy. We present some promising experimental results from a preliminary implementation of these techniques.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Journal Article
Interpolation and SAT-based model checking
TL;DR: In benchmark studies using a set of large industrial circuit verification instances, this method is greatly more efficient than BDD-based symbolic model checking, and compares favorably to some recent SAT-based model checking methods on positive instances.
775
Software model checking
Ranjit Jhala,Rupak Majumdar +1 more
TL;DR: A survey of recent progress in software model checking finds that the current state of the art in model checking is improving, but the pace of improvement is still slow.
Program analysis as constraint solving
Sumit Gulwani,Saurabh Srivastava,Ramarathnam Venkatesan +2 more
- 07 Jun 2008
TL;DR: This paper shows how the constraint- based approach can be used to model a wide spectrum of program analyses in an expressive domain containing disjunctions and conjunctions of linear inequalities, and presents the first constraint-based approach to weakest precondition and strongest postcondition inference.
253
Template-based program verification and program synthesis
TL;DR: This work shows how to reduce the template-based search problem to satisfiability solving, which permits the use of off-the-shelf solvers to efficiently explore the search space.
114
Craig interpretation
Aws Albarghouthi,Arie Gurfinkel,Marsha Chechik +2 more
- 11 Sep 2012
TL;DR: Vinta is an iterative algorithm that uses Craig interpolants to refine and guide AI away from false alarms, based on a novel refinement strategy that capitalizes on recent advances in SMT and interpolation-based verification.
55
References
A 2dvEv- bit distributed algorithm for the directed Euler trail problem
Wen-Huei Chen,Chuan Yi Tang +1 more
TL;DR: The algorithm can be used as a building block for solving other distributed graph problems, and can be slightly modified to run on a strongly-connected diagraph for generating the existent Euler trail or to report that no Euler trails exist.
14K
Graph-Based Algorithms for Boolean Function Manipulation
TL;DR: In this paper, the authors present a data structure for representing Boolean functions and an associated set of manipulation algorithms, which have time complexity proportional to the sizes of the graphs being operated on, and hence are quite efficient as long as the graphs do not grow too large.
•Book
Symbolic Model Checking
Edmund M. Clarke,Kenneth L. McMillan,Sérgio Campos,Vassili Hartonas-Garmhausen +3 more
- 31 Jul 1993
TL;DR: Using symbolic model checking techniques it is possible to verify industrial-size finite state systems and models with more than 10120 states have been verified using special techniques.
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Edmund M. Clarke,E. Allen Emerson +1 more
- 01 May 1981
TL;DR: It is shown that it is possible to automatically synthesize the synchronization skeleton of a concurrent program from a Temporal Logic specification and it is believed that this approach may in the long run turn out to be quite practical.
2.6K
Related Papers (5)
Patrick Cousot,Nicolas Halbwachs +1 more
- 01 Jan 1978
[...]
Denis Gopan,Thomas Reps +1 more
- 17 Aug 2006
[...]
Thomas A. Henzinger,Ranjit Jhala,Rupak Majumdar,Grégoire Sutre +3 more
- 01 Jan 2002
Bertrand Jeannet,Antoine Miné +1 more
- 23 Jun 2009