Abstract
In this paper, we emphasize the importance of efficient debugging in formal verification and present capabilities that we have developed in order to augment debugging in Intel’s Formal Verification Environment. We have given the name the “counter-example wizard” to the bundle of capabilities that we have developed to address the needs of the verification engineer in context of counter-example diagnosis and rectification. The novel features of the counterexample wizard are the “multi-value counter-example annotation,” “multiple root cause detection,” and “constraint-based debugging” mechanisms. Our experience with the verification of real-life Intel designs shows that these capabilities complement one another and can considerably help the verification engineer diagnose and fix a reported failure. We use real-life verification cases to illustrate how our system solution can significantly reduce the time spent in the loop of model checking, specification and design modification.
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
R. Bryant, “Graph-based Algorithms for Boolean Function Manipulations”,, IEEE Transactions on Computers, C-35:677–691, August 1986.
K.L. McMillan. “Symbolic Model Checking”, Kluwer Academics, 1993.
K. Ravi, F. Somenzi, “Efficient Fixpoint Computation for Invariant Checking”, In Proceedings of ICCD’9, pp. 467–474.
R. Fraer, G. Kamhi, L. Fix, M. Vardi. “Evaluating Semi-Exhaustive Verification Techniques for Bug-Hunting” in Proceedings of SMC’99.
R. Fraer, G. Kamhi, B. Ziv, M. Vardi, L. Fix. “Prioritized Traversal: Efficient Reachability Computation for Verification and Falsification”, in Proceedings of CAV’00,Chicago,IL.
I. Beer, S. Ben-Davis, A. Landver. “On-the-Fly Model Checking” of RCTL Formulas”, in Proceedings of CAV’98.
R.H. Hardin, R. P. Kurshan, K.L. McMillan, J.A. Reeds and N.J.A. Sloane, “Efficient Regression Verification”, Int’l Workshop on Discrete Event Systems (WODES’ 96)
E. Clarke, O. Grumberg, K. McMillan, X. Zhao, ‘‘Efficient generation of counterexamples and witnesses in symbolic model checking”, in the proceeding of DAC’95.
B. Kurshan, “Formal Verification in a Commercial Setting”, In Proceedings of DAC’97.
J. Jang, S. Quader, M. Kaufmann, C. Pixley,“Formal Verification of FIRE: A Case Study”, in Proceedings of Design Automation Conference, 1997, Anaheim, CA
R.K. Brayton, G.D. Hachtel, A. Sangiovanni-Vincentelli, F. Somenzi, A. Aziz, S.T. Cheng, S. Edwards, S. Khatri, Y. Kukimoto, A. Pardo, S. Qadeer, R.K. Ranjan, S. Sarwary, T.R. Shiple, G. Swamy, T. Villa, “VIS: A system for Verification and Synthesis”, in Proc. of DAC’94.
I. Beer, S. Ben-David, C. Eisner, A. Landver. “RuleBase: An industry-oriented formal verification tool”. In Proc. of Design Automation Conference 1996 (DAC’96)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Copty, F., Irron, A., Weissberg, O., Kropp, N., Gila, K. (2001). Efficient Debugging in a Formal Verification Environment. In: Margaria, T., Melham, T. (eds) Correct Hardware Design and Verification Methods. CHARME 2001. Lecture Notes in Computer Science, vol 2144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44798-9_23
Download citation
DOI: https://doi.org/10.1007/3-540-44798-9_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42541-0
Online ISBN: 978-3-540-44798-6
eBook Packages: Springer Book Archive