Abstract
Our experience with semi-exhaustive verification shows a severe degradation in usability for the corner-case bugs, where the tuning effort becomes much higher and recovery from dead-ends is more and more difficult. Moreover, when there are no bugs at all, shifting semi-exhaustive traversal to exhaustive traversal is very expensive, if not impossible. This makes the output of semi-exhaustive verification on non-buggy designs very ambiguous. Furthermore, since after the design fixes each falsification task needs to converge to full verification, there is a strong need for an algorithm that can handle efficiently both verification and falsification. We address these shortcomings with an enhanced reachability algorithm that is more robust in detecting corner-case bugs and that can potentially converge to exhaustive reachability. Our approach is similar to that of Cabodi et al. in partitioning the frontiers during the traversal, but differs in two respects. First, our partitioning algorithm trades quality for time resulting in a significantly faster traversal. Second, the subfrontiers are processed according to some priority function resulting in a mixed BFS/DFS traversal. It is this last feature that makes our algorithm suitable for both falsification and verification.
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
Ravi, K., Somenzi, F.: High Density Reachability Analysis. In: Proceedings of ICCAD 1995 (1995)
Ganai, M., Aziz, A.: Efficient Coverage Directed State Space Search. In: Proceedings of IWLS 1998 (1998)
Yuan, J., Shen, J., Abraham, J., Aziz, A.: On Combining Formal and Informal Verification. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254. Springer, Heidelberg (1997)
Yang, C., Dill, D.: Validation with Guided Search of the State Space. In: Proceedings of DAC 1998 (1998)
Aziz, A., Kukula, J., Shiple, T.: Hybrid Verification Using Saturated Simulation. In: Proceedings of DAC 1998 (1998)
Bryant, R.: Graph-based Algorithms for Boolean Function Manipulations. IEEE Transactions on Computers C-35, 677–691 (1986)
McMillan, K.L.: Symbolic Model Checking. Kluwer, Dordrecht (1993)
Shiple, T.R.: Formal Analysis of Synchronous Circuits. PhD thesis, University of California at Berkeley (1996)
Ravi, K., McMillan, K.L., Shiple, T.R., Somenzi, F.: Approximation and Decomposition of Binary Decision Diagrams. In: Proceedings of DAC 1998 (1998)
Coudert, O., Madre, J.: A Unified Framework for the Formal Verification of Sequential Circuits. In: Proceedings of ICCAD 1990 (1990)
Ravi, K., Somenzi, F.: Efficient Fixpoint Computation for Invariant Checking. In: Proceedings of ICCD 1999, pp. 467–474 (1999)
Lin, B., Newton, R.: Implicit Manipulation of Equivalence Classes Using Binary Decision Diagrams. In: Proceedings of ICCD 1991 (1991)
Cabodi, G., Camurati, P., Quer, S.: Improved Reachability Analysis of Large Finite State Machines. In: Proceedings of ICCAD 1996 (1996)
Narayan, A., Jain, J., Fujita, M., Sangiovanni-Vincentelli, A.: Partitioned ROBDDs – A Compact, Canonical and Efficiently Manipulable Representation for Boolean Functions. In: Proceedings of ICCAD 1996 (1996)
Fraer, R., Kamhi, G., Fix, L., Vardi, M.: Evaluating Semi-Exhaustive Verification Techniques for Bug Hunting. In: Proceedings of SMC 1999 (1999)
Beer, I., Ben-David, S., Landver, A.: On-the-Fly Model Checking of RCTL Formulas. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427. Springer, Heidelberg (1998)
Cabodi, G., Camurati, P., Quer, S.: Improving the Efficiency of BDD-Based Operators by Means of Partitioning. IEEE Transactions on CAD, 545–556 (May 1999)
Somenzi, F.: CUDD: CU Decision Diagram Package – Release 2.3.0., Technical Report, Dept. Electrical and Computer Engineering, University of Colorado, Boulder
Hardin, R.H., Kurshan, R.P., McMillan, K.L., Reeds, J.A., Sloane, N.J.A.: Efficient Regression Verification. In: Int’l Workshop on Discrete Event Systems (WODES 1996), Edinburgh, August 19-21, pp. 147–150. IEE, London (1996)
Burch, J.R., Clarke, E.M., Long, D.E., McMillan, K.L., Dill, D.L.: Symbolic Model Checking for Sequential Circuit Verification. IEEE Transactions on Computer-Aided Designs of Integrated Circuits and Systems 13(4), 401–424 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fraer, R., Kamhi, G., Ziv, B., Vardi, M.Y., Fix, L. (2000). Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification. In: Emerson, E.A., Sistla, A.P. (eds) Computer Aided Verification. CAV 2000. Lecture Notes in Computer Science, vol 1855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722167_30
Download citation
DOI: https://doi.org/10.1007/10722167_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67770-3
Online ISBN: 978-3-540-45047-4
eBook Packages: Springer Book Archive