Abstract
Equality is perhaps the most widely-used relation among data in programs. In this chapter, we consider equality among variables, constants, and function applications (Section 9.1); among recursive data structures (records, lists, trees, and stacks) and their elements (Section 9.4); and among elements of arrays (Section 9.5). For all three theories, we examine their quantifier-free fragments.
Keywords
Directed Acyclic Graph Decision Procedure Function Symbol Congruence Relation Congruence Class
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.
Preview
Unable to display preview. Download preview PDF.
Bibliographic Remarks
- 1.W. Ackermann. Solvable cases of the decision problem. The Journal of Symbolic Logic, 22(1):68–72, March 1957.CrossRefGoogle Scholar
- 29.P. J. Downey, R. Sethi, and R. E. Tarjan. Variations on the common subex-pressions problem. Journal of the ACM, 27(4):758–771, 1980.MATHCrossRefGoogle Scholar
- 50.J. King. A Program Verifier. PhD thesis, Carnegie Mellon University, September 1969.Google Scholar
- 58.J. McCarthy. Towards a mathematical science of computation. In International Federation for Information Processing, pages 21–28, 1962.Google Scholar
- 66.G. Nelson and D. C. Oppen. Fast decision procedures based on congruence closure. Journal of the ACM, 27(2):356–364, April 1980.MATHCrossRefGoogle Scholar
- 69.D. C. Oppen. Reasoning about recursively defined data structures. In Principles of Programming Languages, pages 151–157. ACM Press, 1978.Google Scholar
- 71.D. C. Oppen. Reasoning about recursively defined data structures. Journal of the ACM, 27(3):403–411, July 1980.MATHCrossRefGoogle Scholar
- 83.R. E. Shostak. An algorithm for reasoning about equality. Communications of the ACM, 21(7):583–585, July 1978.MATHCrossRefGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2007