Sciweavers

CAV
2007
Springer

Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra

14 years 5 months ago
Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra
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.
Chao Wang, Zijiang Yang, Aarti Gupta, Franjo Ivanc
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where CAV
Authors Chao Wang, Zijiang Yang, Aarti Gupta, Franjo Ivancic
Comments (0)