A Method for Analyzing Loop Programs

IEEE Transactions on Software Engineering

Volumn SE-5, Issue 3, 1979, Pages 237-247

  Waters, Richard C ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Index Terms Loops; plans; program analysis; program understanding; program verification

Indexed keywords

COMPUTER PROGRAMMING;

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

References (29)

1. B. S. Baker, “An algorithm for structuring flowgraphs,” J. Ass. Comput. Mach., vol. 24, pp. 98–120, Jan. 1977.
2. S. Basu and J. Misra, “Proving loop programs,” IEEE Trans. Soft-ware Eng., vol. 1, pp. 76–86, Mar. 1975.
3. S. Basu and J. Misra, “Some classes of naturally provable programs,” in Proc. 2nd Int. Conf. Software Eng., Oct. 1976, pp. 400–406.
4. R. W. Floyd, “Assigning meaning to programs,” in Proc. Symp. Applied Math., vol. 19, 1967, pp. 19–32.
5. D. P. Friedman and D. S. Wise, “CONS should not evaluate its arguments,” Indiana Tech. Rep. 44, Nov. 1975.
6. I. P. Goldstein, “Understanding simple picture programs,” MIT, Cambridge, MA, MIT/AI/TR-294, Sept. 1974.
7. L. J. Guibas and D. K. Wyatt, “Compilation and delayed evaluation in APL,” in Proc. 5th ACMPOPL Conf., 1978.
8. P. Henderson and J. H. Morris, “A lazy evaluator,” presented at the SIGPLAN-SIGACT Symp. Principles of Programming Lan-guages, Atlanta, Jan. 1976.
9. C. Hewitt and B. Smith, ‘Towards a programming apprentice,” IEEE Trans. Software Eng., vol. 1, pp. 26–46, Mar. 1975.
10. C. A. R. Hoare, “An axiomatic basis for computer programming,” Commun. Ass. Comput. Mach., vol. 12, pp. 576–583, Oct. 1969.
11. IBM, “FORTRAN IV language,” IBM, White Plains, NY, C28-6515-6, 1966. 6515-6, 1966.
12. IBM, Scientific Subroutine Package Version III Programmer's Manual, IBM, White Plains, NY, GH20-0205-4, 1970.
13. G. Kahn and D. B. MacQueen, “Coroutines and networks of parallel processes,” in 1977 Proc. IFIP Congr. Amsterdam, The Netherlands: North-Holland, 1977.
14. S. Katz and Z. Manna, “Logical analysis of programs,” Commun. Ass. Comput. Mach., vol. 19, pp. 188–206, Apr. 1976.
15. B. H. Liskov, A. Snyder, R. Atkinson, and C. Schaffert, “Abstraction mechanisms in CLU,” Commun. Ass. Comput. Mach., vol. 20, pp. 564–576, Aug. 1977.
16. D. A. Moon, MACLISP Reference Manual, MIT, Cambridge, MA, 1974.
17. J. H. Morris, Jr. and B. Wegbreit, “Subgoal induction,” Commun. Ass. Comput. Mach., pp. 209–222, Apr. 1977.
18. R. P. Polivka and S. Pakin, APL: The Language and Its Usage. Englewood Cliffs, NJ: Prentice-Hall, 1975.
19. T. W. Pratt, “Control computations and the design of loop control structures,” IEEE Trans. Software Eng., vol. 4, pp. 81–89, Mar. 1978.
20. C. Rich, “A representation for programming knowledge and applications to recognition, generation, and cataloguing of programs,” forthcoming Ph.D. dissertation, MIT.
21. C. Rich and H. Shrobe, “Initial report on a LISP programmer's apprentice,” MIT, Cambridge, MA, MIT/AI/TR-354, Dec. 1976.
22. C. Rich and H. Shrobe, “Initial report on a LISP programmer's apprentice,” IEEE Trans. Software Eng., vol. 4, pp. 456–466, Nov. 1978.
23. C. Rich, H. E. Shrobe, R. C. Waters, G. J. Sussman, and C. E. Hewitt, “Programming viewed as an engineering activity,” MIT, Cambridge, MA, MIT/AIM-459, Jan. 1978.
24. M. Shaw and W. A. Wulf, “Abstraction and verification in ALPHARD: Defining and specifying iteration and generators,” Commun. Ass. Comput. Mach., vol. 20, pp. 553–564, Aug. 1977.
25. H. E. Shrobe, “Reasoning and logic for complex program understanding,” Ph.D. dissertation, MIT, Aug. 1978.
26. G. Sussman, “A computational model of skill acquisition,” MIT, Cambridge, MA, MIT/AI/TR-297, Aug. 1973.
27. R. C. Waters, “A system for understanding mathematical FORTRAN programs,” MIT, Cambridge, MA, MIT/AIM-368, Aug. 1976.
28. R. C. Waters, “Automatic analysis of the logical structure of programs,” (based on an MIT Ph.D. dissertation, Aug. 1978), MIT/AI/TR-492, 492, Dec. 1978.
29. B. Wegbreit, “The synthesis of loop predicates,” Commun. Ass. Comput. Mach., vol. 17, pp. 102–112, Feb. 1974.