Inadequacy of Computable Loop Invariants

ACM Transactions on Computational Logic

Volumn 2, Issue 1, 2001, Pages 1-11

  Blass, Andreas ^a   Gurevich, Yuri ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Algorithms; Assertion; Automated; Automated deduction; Computable; Hoare logic; Inseparability; Loop invariants; Postcondition; Precondition; Reasoning; Recursive; Theory; Uncomputable; Verification

Indexed keywords

EID: 78149265261     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/371282.371285     Document Type: Article

References (12)

1. Apt, K. R., “Ten years of Hoare's logic: A survey—Part 1,” ACM Transactions on Programming Languages and Systems 3:4 (October 1981), 431-483.
2. Apt, K. R., Bergstra, J. A., and Meertens, L. G. L. T., “Recursive assertions are not enough—or are they?,” Theoret. Comp. Sci. 8 (1979), 73-87.
3. Apt, K. R. and Olderog, E.-R., Verification of sequential and concurrent programs,” Springer-Verlag, 1991.
4. Bergstra, J. A. and J. V. Tucker, “Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs,” Theoret. Comput. Sci. 17 (1982) 303-315.
5. Blass, A. and Gurevich, Y., “Existential fixed-point logic,” in “Logic and Complexity” (ed. E. Borger), Springer Lecture Notes in Computer Science 270 (1987), 20-36.
6. Blass, A. and Gurevich, Y., “The underlying logic of Hoare logic,” Bull. European Assoc. Theoret. Comp. Sci. To appear.
7. Börger, E., Grädel, E., and Gurevich, Y., “The Classical Decision Problem,” Springer-Verlag, 1997.
8. Cook, S. A., “Soundness and completeness of an axiom system for program verification,” SIAM Journal of Computing 7:1 (1978), 70-90.
9. Gurevich, Y., “For every sequential algorithm there is an equivalent sequential abstract state machine,” ACM Transactions on Computational Logic 1:1 (July 2000).
10. Hoare, C. A. R., “An axiomatic basis for computer programming,” Communications of ACM 12:10 (October 1969), 576-580, 583.
11. Shoenfield, J. R., “Mathematical Logic,” Addison-Wesley, 1967.
12. Trakhtenbrot, B. A., “On Recursive Separability,” Doklady Acad. Nauk SSSR 88 (1953), 953-955, in Russian.