Fast falsification based on symbolic bounded property checking

Symbolic property verification is an increasingly popular debugging method based on binary decision diagrams (BDDs). The lack of optimization of the state space search is often responsible for the excessive growth of the BDDs. In this paper, we present accelerated symbolic property verification by means of a new guiding technique that automatically finds the set of interesting variables by exploiting the property and the transition relation of a design. Our property based state space guiding can substantially speed up the verification process. The heuristic picks up the interesting state or the input variables automatically and utilizes them in guiding the state space traversal. This guiding approach is automatic, efficient and stable for fast falsification. Furthermore it does not degrade as much for full validation.