Abstract
This paper describes a structurally-guided framework for the decomposition of a verification task into subtasks, each solved by a specialized algorithm for overall efficiency. Our contributions include the following: (1) a structural algorithm for computing a bound of a state-transition diagram’s diameter which, for several classes of netlists, is sufficiently small to guarantee completeness of a bounded property check; (2) a robust backward unfolding technique for structural target enlargement: from the target states, we perform a series of compose- based pre-image computations, truncating the search if resource limitations are exceeded; (3) similar to frontier simplification in symbolic reachability analysis, we use induction via don’t cares for enhancing the presented target enlargement. In many practical cases, the verification problem can be discharged by the enlargement process; otherwise, it is passed in simplified form to an arbitrary subsequent solution approach. The presented techniques are embedded in a flexible verification framework, allowing arbitrary combinations with other techniques. Extensive experimental results demonstrate the effectiveness of the described methods at solving and simplifying practical verification problems.
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
Armin Biere, Alessandro Cimatti, Edmund M. Clarke, and Yunshan Zhu. Symbolic model checking without BDDs. In 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems, March 1999.
J. R. Burch, E. M. Clarke, D. E. Long, K. L. McMillan, and D. L. Dill. Symbolic model checking for sequential circuit verification. IEEE Transactions on Computer-Aided Design, 13(4), April 1994.
H. Cho, G. Hachtel, E. Macii, B. Pleisser, and F. Somenzi. Algorithms for approximate FSM traversal based on state space decomposition. IEEE Transactions on Computer-Aided Design, 15(12), Dec. 1996.
O. Coudert, C. Berthet, and J. C. Madre. Verification of sequential machines using Boolean functional vectors. In IMEC-IFIP International Workshop on Applied Formal Methods for Correct VLSI Design, Nov. 1989.
Luca de Alfaro, Thomas A. Henzinger, and Freddy Y. C. Mang. Detecting errors before reaching them. In Computer-Aided Verification, July 2000.
Thomas Filkorn. Functional extensions of symbolic model checking. In Computer-Aided Verification, June 1991.
Malay K. Ganai. Algorithms for Efficient State Space Search. PhD thesis, University of Texas at Austin, May 2001.
Youpyo Hong, Peter A. Beerel, Jerry R. Burch, and Kenneth L. McMillan. Safe BDD minimization using don’t cares. In Proc. 34th ACM/IEEE Design Automation Conference, June 1997.
Andreas Kuehlmann and Jason Baumgartner. Transformation-based verification using generalized retiming. In Computer-Aided Verification, July 2001.
Andreas Kuehlmann, Malay K. Ganai, and Viresh Paruthi. Circuit-based Boolean reasoning. In Proc. 38th ACM/IEEE Design Automation Conference, June 2001.
Robert P. Kurshan. Computer-Aided Verification of Coordinating Processes. Princeton University Press, 1994.
In-Ho Moon, Gary D. Hachtel, and Fabio Somenzi. Border-block triangular form and conjunction schedule in image computation. In Formal Methods in Computer-Aided Design, Nov. 2000.
Mary Sheeran, Satnam Singh, and Gunnar Stalmarck. Checking safety properties using induction and a SAT-solver. In Formal Methods in Computer-Aided Design, Nov. 2000.
Poul F. Williams, Armin Biere, Edmund M. Clarke, and Anubhav Gupta. Combining decision diagrams and SAT procedures for efficient symbolic model checking. In Computer-Aided Verification, July 2000.
C. Han Yang and David L. Dill. Validation with guided search of the state space. In Proc. 35th ACM/IEEE Design Automation Conference, June 1998.
Jun Yuan, Jian Shen, Jacob Abraham, and Adnan Aziz. On combining formal and informal verification. In Computer-Aided Verification, June 1997.
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
Baumgartner, J., Kuehlmann, A., Abraham, J. (2002). Property Checking via Structural Analysis. 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_12
Download citation
DOI: https://doi.org/10.1007/3-540-45657-0_12
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