A Synthesizer of Inductive Assertions

IEEE Transactions on Software Engineering

Volumn SE-1, Issue 1, 1975, Pages 68-75

  German, Steven M ^a   Wegbreit, Ben ^a  

^a PALO ALTO RESEARCH CENTER   (United States)

Author keywords

Completing inductive assertions; inductive assertions; loop invariants; loop predicates; program verification; synthesis of inductive assertions; theorem proving; weak interpretations

Indexed keywords

COMPUTER PROGRAMMING;

EID: 0016486505     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSE.1975.6312821     Document Type: Article

References (21)

1. R. Boyer and J. Moore, “Proving theorems about LISP functions,” in Proc. 3rd Int. Joint Conf. Artif. Intell., Aug. 1973, pp. 486-493.
2. D. C. Cooper, “Programs for mechanical program verification,” in Machine Intelligence 6, B. Meltzer and D. Michie, Ed. New York: American Elsevier, 1971, pp. 43-59.
3. L. P. Deutsch, “An interactive program verifier,” Ph.D. dissertation, Dept. Comput. Sci., Univ. California, Berkeley, 1973.
4. B. Elspas, “The semiautomatic generation of inductive assertions for proving program correctness,” Stanford Res. Inst., Stanford, Calif, SRI Project 2686, July 1974.
5. B. Elspas, K. N. Levitt, R. J. Waldinger, and A. Waksman, “An assessment of techniques for proving programs correct,” Computing Surveys, vol. 4, pp. 97-147, June 1972.
6. R. Floyd, “Assigning meanings to programs,” in Proc. Symp. Applied Mathematics, vol. 19, J. T. Schwartz, Ed., AMS, 1967, pp19-32.
7. S. M. German, “A program verifier that generates inductive assertions,” Center for Research in Computing Technology, Harvard Univ., Cambridge, Mass., Tech Rep. TR 19-74, Aug. 1974.
8. D. I. Good, “Provable programs and processors,” in 1974 Nat. Comput. Conf., AFIPS Conf. Proc, vol. 43. Montvale, N.J.: AFIPS Press, 1974, pp. 357-363.
9. I. Greif and R. Waldinger, “A more mechanical heuristic approach to program verification,” in Proc. Int. Symp. Programming, Paris, April 1974, pp. 83-90.
10. C. A. R. Hoare,. “Proof of a program: FIND,” Commun. Ass. Comput. Mach., vol. 14, pp. 39-45, Jan. 1971.
11. S. Igarashi, R. L. London, and D. C. Luckham, “Automatic program verification I: AIM-200,” Dept. Comput. Sci., Stanford Univ., Stanford, Calif, CS-73-365, May 1973
12. S. M. Katz and Z. Manna, “A heuristic approach to program verification,” in Proc. 3rd Int. Joint Conf Artif. Intell., Aug. 1973, pp. 500-512.
13. S. Katz and Z. Manna, “Logical analysis of programs,” Dept. Applied Mathematics, Weizmann Inst. Science, Rehovot, Israel, July 1974.
14. J. King, “A program verifier,” Ph.D. dissertation, Dept. Comput Sci., Carnegie-Mellon Univ., Pittsburgh, Pa., 1969.
15. R. L. London “The current state of proving programs correct,” in Proc. Ass. Comput. Mach. 25th Annu. Conf, 1972, pp. 39-46.
16. R. L. London and D. R. Musser, “The application of a symbolic mathematical system to program verification,” in Proc. Ass. Comput. Mach. Nat. Conf, 1974, pp. 265-273.
17. E. Marmier, “A program verifier for PASCAL,” in 1974 Proc. IFIP Congr. Amsterdam: North-Holland Publishing Co., pp.177-181
18. M. Moriconi, “Semiautomatic synthesis of inductive predicates,” Depts. Mathematics and Computer Sciences, Univ. Texas Austin, ATP-16, June 1974.
19. R. J. Waldinger and K. N. Levitt, “Reasoning about programs,” Artif. Intell Center, Stanford Res. Inst., Stanford Univ., Stanford, Calif, Tech. Note 86, Oct. 1973.
20. B. Wegbreit, “Property extraction in well-founded property sets,” Center for Research in Computing Technology, Harvard Univ., Cambridge, Mass., Feb. 1973.
21. “The synthesis of loop predicates,” Commun. Ass. Comput. Mach., vol. 17, pp. 102-112, Feb. 1974.