Logical Analysis of Programs

Communications of the ACM

Volumn 19, Issue 4, 1976, Pages 188-206

  Katz, Shmuel ^a   Manna, Zohar ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b STANFORD UNIVERSITY   (United States)

Author keywords

automatic debugging; correctness; incorrectness; invariants; logical analysis; program verification; termination

Indexed keywords

MATHEMATICAL TECHNIQUES;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0016941016     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/360032.360048     Document Type: Article

References (29)

1. Allen, F.E. A basis for program optimization. Proc. IFIP Cong. 71, Vol. 1, North-Holland Pub. Co., Amsterdam, 1971, pp. 385-390.
2. Cooper, D.C. Programs for mechanical program verification. Machine Intelligence 6, American Elsevier, New York, 1971, pp. 43-59.
3. Caplain, M. Finding invariant assertion for proving programs. Proc. Int. Conf. on Reliable Software, Los Angeles, Calif., April 1975.
4. Dahl, O.J., Dijkstra, E.W., and Hoare, C.A.R. Structured Programming. Academic Press, New York, 1972.
5. Deutsch, L.P. An interactive program verifier. Ph.D. Th., Dept. of Computer Sci., U. of California, Berkeley, June 1973.
6. Elspas, B., Levitt, K.N., and Waldinger, R.J. An interactive system for the verification of computer programs. Research Rep., SRI, Menlo Park, Calif., Sept. 1973.
7. Elspas, B. The semiautomatic generation of inductive assertions for proving program correctness. Research Rep., SRI, Menlo Park, Calif., July 1974.
8. Floyd, R.W. Assigning meaning to programs. Proc. Symp. in Appl. Math., Vol. 19, J.T. Schwartz (Ed.), Amer. Math. Soc., Providence, R.I., 1967, pp. 19-32.
9. Floyd, R.W. Towards interactive design of correct programs. Proc. IFIP Cong., Vol. 1, North-Holland Pub. Co., Amsterdam, 1971, pp. 7-10.
10. German, S. M. A program verifier that generates inductive assertions. B.A. Th., Harvard U., May 1974.
11. Greif, I., and Waldinger, R. A more mechanical heuristic approach to program verification. Proc. Int. Symp. on Programming, Paris, April 1974, pp. 83-90.
12. Hoare, C.A.R. An axiomatic basis of computer programming. Comm. ACM 12, 10 (Oct. 1969), 576-580, 583.
13. Hoare, C.A.R. Proof of a program: FIND. Comm. ACM 14, 1 (Jan. 1971), 39-45.
14. Katz, S.M., and Manna, Z. A heuristic approach to program verification. Proc. 3rd Int. Conf. on Artificial Intelligence, Stanford U., Aug. 1973, pp. 500-512.
15. Katz, S.M., and Manna, Z. Towards automatic debugging of programs. Proc. Int. Conf. on Reliable Software, Los Angeles, Calif., April 1975, pp. 143-155.
16. Katz, S.M., and Manna, Z. A closer look at termination. Acta Informatica, to appear.
17. King, J. A program verifier. Ph.D. Th., Dep. of Computer Sci., Carnegie-Mellon U., Pittsburgh, Pa., 1969.
18. King, J. A verifying compiler. In Debugging Techniques in Large Systems, Randall Rustin (Ed.), Prentice-Hall, Englewood Cliffs, N.J. 1970, pp. 17-39.
19. Knuth, D.E. The Art of Computer Programming, Vol. I, Fundamental Algorithms. Addison-Wesley, Reading, Mass. 1968.
20. Manna, Z. The correctness of programs. J. Computer and System Sci., 3, 2 (May 1969), 119-127.
21. Manna, Z. Mathematical Theory of Computation. McGraw-Hill, New York, 1974.
22. Maurer, W.D. The theory and practice of algorithm verification. ERL-M315, U. of California, Berkeley, Aug. 1973.
23. Misra, J. Relations uniformly conserved by a loop. Proc. Int. Symp. on Proving and Improving Programs, Arc et Senans, France, July 1975, pp. 71-80.
24. Moriconi, M.S. Towards the interactive synthesis of assertions. Research Rep., U. of Texas at Austin, Oct. 1974.
25. Sussman, G.J. A computational model of skill acquisition. Ph.D. Th., MIT, Cambridge, Mass., Aug. 1973.
26. Sites, R.L. Proving that computer programs terminate cleanly. Ph.D. Th., Dep. of Computer Science, Stanford U., STAN-CS-74-418, May 1974.
27. Waldinger, R. and Levitt, K.N. Reasoning about programs. Artificial Intelligence 5 (1974), 235-316.
28. Wegbreit, B. The synthesis of loop predicates. Comm. ACM 17, 2 (Feb. 1974), 102-112.
29. Wensley, J.H. A class of non-analytical interactive processes. Computer J., 1 (1958), 163-167.