A Heuristic for Deriving Loop Functions

IEEE Transactions on Software Engineering

Volumn SE-10, Issue 3, 1984, Pages 275-285

  Dunlop, Douglas D ^a   Basili, Victor R ^b  

^a Intermetrics Inc   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Constraints; initialized loop programs; loop functions; program verification

Indexed keywords

COMPUTER PROGRAMMING;

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

References (19)

1. S. Basu, “A note on synthesis of inductive assertions,” IEEE Trans. Software Eng., vol. SE-6, pp. 32–39, Jan. 1980.
2. S. Basu and J. Misra, “Proving loop programs,” IEEE Trans. Software Eng., vol. SE-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., San Francisco, CA, Oct. 1976, pp. 400–406.
4. E. W. Dijkstra, A Discipline of Programming. Englewood Cliffs, NJ: Prentice-Hall, 1976.
5. D. Dunlop and V. Basili, “Generalizing specifications for uniformly implemented loops,” Univ. Maryland, Comput. Sci. Tech. Rep. TR-1116, Oct. 1981.
6. H. Ellozy, “The determination of loop invariants for programs with arrays,” IEEE Trans. Software Eng., vol. SE-7, pp. 197–206, Mar. 1981.
7. D. Gries, “Is sometime ever better than always?,” Trans. Programming Languages and Syst., vol. 1, pp. 258–265, Oct. 1979.
8. D. Gries, The Science of Programming. New York: Spring-Verlag, 1981.
9. C. A. R. Hoare, “An axiomatic basis for computer programming,” Commun. Ass. Comput. Mach., vol. 12, pp. 576–583, Oct. 1969.
10. S. Katz and Z. Manna, “A heuristic approach to program verification,” in Proc. 3rd Int. Joint Conf. Artificial Intell., Stanford, CA, 1973, pp. 5O0–512.
11. S. Katz and Z. Manna, “Logical analysis of programs,” Commun. Ass. Comput. Mach., vol. 19, pp. 188–206, Apr. 1976.
12. Z. Manna and R. Waldinger, “Towards automatic program synthesis,” Stanford Artificial Intell. Project, Memo. AIM-127, July 1970.
13. H. D. Mills, “Mathematical foundations for structured programming,” IBM Federal Syst. Div., FSC 72–6012, 1972.
14. H. D. Mills, “The new math of computer programming,” Commun. Ass. Comput. Mach., vol. 18, pp. 43–48, Jan. 1975.
15. J. Misra, “Some aspects of the verification of loop computations,” IEEE Trans. Software Eng., vol. SE-4, pp. 478–486, Nov. 1978.
16. J. Misra, “Systematic verification of simple loops,” Univ. Texas, Tech. Rep. TR-97, Mar. 1979.
17. J. H. Morris and B. Wegbreit, “Subgoal induction,” Commun. Ass. Comput. Mach., vol. 20, pp. 209–222, Apr. 1977.
18. B. Wegbreit, “The synthesis of loop predicates,” Commun. Ass. Comput. Mach., vol. 17, pp. 102–112, Feb. 1974.
19. B. Wegbreit, “Complexity of synthesizing inductive assertions,” J. Ass. Comput. Mach., vol. 24, pp. 504–512, July 1977.