Optimizing Automatic Abstraction Refinement for Generalized Symbolic Trajectory Evaluation (2008)
by
Yan Chen
,
Fei Xie
,
Jin Yang
| Venue: | DAC 2008 |
BibTeX
@MISC{Chen08optimizingautomatic,
author = {Yan Chen and Fei Xie and Jin Yang},
title = { Optimizing Automatic Abstraction Refinement for Generalized Symbolic Trajectory Evaluation},
year = {2008}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper, we present a suite of optimizations targeting automatic abstraction refinement for Generalized Symbolic Trajectory Evaluation (GSTE). We optimize both model refinement and spec refinement supported by AutoGSTE: a counterexample-guided refinement loop for GSTE. Experiments on a family of benchmark circuits have shown that our optimizations lead to major efficiency improvements in verification involving abstraction refinement.
Citations
| 90 | Formal verification by symbolic evaluation of partially-ordered trajectories - Seger, Bryant - 1995 |
| 31 | Introduction to generalized symbolic trajectory evaluation - Yang, Seger - 2001 |
| 25 | An industrially effective environment for formal hardware verification - Seger, Jones, et al. - 2005 |
| 23 | A Simple Theorem Prover Based on Symbolic Trajectory Evaluation and BDD’s - Hazelhurst, Seger - 1995 |
| 19 | The Mathematical Foundation of Symbolic Trajectory Evaluation - Chou - 1999 |
| 8 | Sat-based assistance in abstraction refinement for symbolic trajectory evaluation - Roorda, Claessen - 2006 |
| 7 | Grumberg O., “Automatic Refinement and Vacuity Detection for Symbolic Trajectory Evaluation - Tzoref - 2006 |
| 3 | Digital Circuit Verification using Partially-Ordered State Models - Bryant, Seger - 1994 |
| 3 | Automatic Abstraction Refinement for Generalized Symbolic Trajectory Evaluation - Chen, He, et al. - 2007 |
