Abstract
Localization reduction is an abstraction-refinement scheme for model checking which was introduced by Kurshan [12] as a means for tackling state explosion. It is completely automatic, but despite the work that has been done related to this scheme, it still suffers from computational complexity. In this paper we present algorithmic improvements to localization reduction that enabled us to overcome some of these problems. Namely, we present a new symbolic algorithm for path reconstruction including incremental refinement and backtracking. We have implemented these improvements and compared them to previous work on a large number of our industrial examples. In some cases the improvement was dramatic. Using these improvements we were able to verify circuits that we were not previously able to address.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
The texas97 verification benchmarks. http://vlsi.colorado.edu/ vis/texas-97/.
F. Balarin and A. Sangiovanni-Vincentelli. An iterative approach to language containment. In Computer Aided Verification, pages 29–40, 1993.
I. Beer, S. Ben-David, and A. Landver. On-the-fly model checking of rctl formulas. In Computer Aided Verification, pages 184–194, 1998.
A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Proc. of TACAS, 1999.
A. Biere, E. M. Clarke, and Y. Zhu. Multiple state and single state tableaux for combining local and global model checking. In Correct System Design, pages 163–179, 1999.
K. S. Brace, R. L. Rudell, and R. E. Bryant. Efficient Implentation of a BDD Package. In 27th ACM/IEEE Design Automation Conference, pages 40–45. ACM/IEEE, 1990.
E. M. Clarke, O. Grumberg, S. Jha, Y. Lu., H. Veith. Counterexample-guided abstraction refinement. In Computer Aided VerificationI, pages 154–169, 2000.
E. M. Clarke, O. Grumberg, and D. Peled. MIT Press, 2000.
E. M. Clarke, Y. Lu, P. Chauhan, and A. Gupta. Automatic abstraction by counterexample-guided refinement. Private Communication.
S. G. Govindaraju and D. L. Dill. Verification by approximate forward and backward reachability. In Inter. Conf.on Computer Aided Design, 1998.
A. Gupta and E. M. Clarke. Using fourier analysis for abstraction-refinement in model checking. Private Communication.
R. P. Kurshan. Computer-Aided-Verification of Coordinating Processes. Princeton University Press, 1994.
W. Lee, A. Pardo, J. Jang, G. Hachtel, and F. Somenzi. Tearing based automatic abstraction for ctl model checking. In Inter. Conf.on Computer Aided Design, pages 76–81, 1999.
J. Lind-Nielsenand H. Andersen. Stepwise ctl model checking of state/event systems. In Computer Aided Verification, pages 316–327, 1999.
K. L. McMillan. The SMV System DRAFT. Carnegie Mellon University, Pittsburgh, PA, 1992.
A. Pardo and G. Hachtel. Incremental ctl model checking using bdd subsetting. In IEEE DAC,, 1998.
K. Ravi and F. Somenzi. High-density reachability analysis. In ICCAD, 1995.
G. P. M. Silva and K. A. Sakallah. GRASP — a search algorithm for propositional satisfiability. IEEE Trans. on Computers, 44:506–516, 1999.
D. Wang, P. Ho, J. Long, J. Kukula, Y. Zhu, T. Ma, and R. Damiano. Formal property verification by abstraction refinement with formal, simulation and hybrid engines. In 38th IEEE DAC, pages 35–40, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barner, S., Geist, D., Gringauze, A. (2002). Symbolic Localization Reduction with Reconstruction Layering and Backtracking. In: Brinksma, E., Larsen, K.G. (eds) Computer Aided Verification. CAV 2002. Lecture Notes in Computer Science, vol 2404. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45657-0_6
Download citation
DOI: https://doi.org/10.1007/3-540-45657-0_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43997-4
Online ISBN: 978-3-540-45657-5
eBook Packages: Springer Book Archive