Property Checking via Structural Analysis

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.

DOI: 10.1007/3-540-45657-0_12

Extracted Key Phrases

3 Figures and Tables

Statistics

01020'03'05'07'09'11'13'15'17
Citations per Year

76 Citations

Semantic Scholar estimates that this publication has 76 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Baumgartner2002PropertyCV, title={Property Checking via Structural Analysis}, author={Jason Baumgartner and Andreas Kuehlmann and Jacob A. Abraham}, booktitle={CAV}, year={2002} }