Abstract
The logic of equality with uninterpreted functions has been proposed for verifying abstract hardware designs. The ability to perform fast satisfiability checking over this logic is imperative for this verification paradigm to be successful. We present symbolic methods for satisfiability checking for this logic. The first procedure is based on restricting analysis to finite instantiations of the design. The second procedure directly reasons about equality by introducing Boolean-valued indicator variables for equality. Theoretical and experimental evidence shows the superiority of the second approach.
Chapter PDF
References
Wilhelm Ackermann. Solvable Cases of the Decision Problem. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1954.
C. Barrett, D. Dill, and Jeremy Levitt. Validity Checking for Combinations of Theories with Equality. In Proc. of the Formal Methods in CAD Conf., November 1996.
J. Burch and D. Dill. Automatic Verification of Microprocessor Control. In Proc. of the Computer Aided Verification Conf., July 1994.
W. Chan, R. Anderson, P. Deame, and D. Notkin. Combining Constraint Solving and Symbolic Model Checking for a Class of Systems with Non-linear Constraints. In Proc. of the Computer Aided Verification Conf., July 1997.
T. H. Cormen, C. E. Leiserson, and R. H. Rivest. Introduction to Algorithms. MIT Press, 1989.
R. K. Brayton et al. VIS: A system for Verification and Synthesis. In Proc. of the Computer Aided Verification Conf., July 1996.
M. R. Carey and D. S. Johnson. Computers and Intractability. W. H. Freeman and Co., 1979.
R. Hojati, A. Isles, D. Kirkpatrick, and R. Brayton. Verification Using Finite Instantiations and Uninterpreted Functions. In Proc. of the Formal Methods in CAD Conf., November 1996.
R. Hojati, A. Kuehlmann, S. German, and R. Brayton. Validity Checking in the Theory of Equality Using Finite Instantiations. In Proc. Intl. Workshop on Logic Synthesis, May 1997.
Robert B. Jones, David Dill, and Jerry R. Burch. Efficient Validity Checking for Processor Validation. In Proc. Intl. Conf. on Computer-Aided Design, pages 2–6, 1995.
Andreas Kuehlmann and Florian Krolun. Equivalence Checking Using Cuts and Heaps. In Proc. of the Design Automation Conf., June 1997.
R. Rudell. Dynamic Variable Ordering for Binary Decision Diagrams. In Proc. Intl. Conf. on Computer-Aided Design, pages 42–47, November 1993.
R. E. Shostak. A practical decision procedure for arithmetic with function symbols. Journal of the ACM, 26(2):351–360, 1979.
Mandayam Srivas and Mark Bickford. Formal verification of a pipelined microprocessor. IEEE Software, 7(5):52–64, September 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goel, A., Sajid, K., Zhou, H., Aziz, A., Singhal, V. (1998). BDD based procedures for a theory of equality with uninterpreted functions. In: Hu, A.J., Vardi, M.Y. (eds) Computer Aided Verification. CAV 1998. Lecture Notes in Computer Science, vol 1427. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028749
Download citation
DOI: https://doi.org/10.1007/BFb0028749
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64608-2
Online ISBN: 978-3-540-69339-0
eBook Packages: Springer Book Archive