Symbolic Evaluation and the Analysis of Programs

IEEE Transactions on Software Engineering

Volumn SE-5, Issue 4, 1979, Pages 402-417

  Cheatham, Thomas E ^a   Holloway, Glenn H ^a   Townley, Judy A ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Automatic program analysis; expression simplification; first order recurrence relations; program optimization; program verification; symbolic evaluation

Indexed keywords

PROGRAM ANALYSIS;

COMPUTER PROGRAMMING;

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

References (34)

1. R. S. Boyer, B. Elspas, and K. N. Levitt, “SELECT-A formal system for testing and debugging programs by symbolic execution,” in Proc. Int. Conf. on Reliable Software, Los Angeles, CA, Apr. 21–23, 1975, pp. 234–245.
2. T. E. Cheatham, Jr., and J. A. Townley, “Symbolic evaluation of programs-A look at loop analysis,” in Proc. ACM Symp. Symbolic and Algebraic Computation, 1976, pp. 90–96.
3. T. E. Cheatham, Jr., and D. B. Washington, “Program loop analysis by solving first order recurrence relations,” Cent. Res. Comput. Tech., Harvard Univ., Cambridge, MA, Tech. Rep. 13–78, May 1978.
4. T. E. Cheatham, Jr., “Semantic models for programming languages,” Cent. Res. Comput. Tech., Harvard Univ., Cambridge, MA, Tech. Memo, July 1978.
5. L. A. Clarke, “A system to generate test data and symbolically execute programs,” IEEE Trans. Software Eng., vol. SE-2, pp. 215–222, Sept. 1976.
6. W. R. Conrad, “Rewrite user's guide,” Cent. Res. Computing Technology, Harvard Univ., Cambridge, MA, Tech. Memo, Aug. 1976.
7. ― “COST user's guide,” Cent. Res. Comput. Tech., Harvard Univ., Cambridge, MA, Tech. Memo, Nov. 1976.
8. ―, “PROBE user's guide,” Cent. Res. Comput. Tech., Harvard Univ., Cambridge, MA, Tech. Memo, June 1976.
9. L. P. Deutsch, “An interactive program verifier,” Ph.D. dissertation, Univ. California, Berkeley, May 1973.
10. B. Elspas, “The semiautomatic generation of inductive assertions for proving program correctness,” Stanford Res. Inst., Menlo Park, CA, Res. Rep., July 1974.
11. L. D. Fosdick and L. J. Osterweil, “Data flow analysis in software reliability,” Comput. Surveys, vol. 8, pp. 305–330, Sept. 1976.
12. S. M. German, “Automating proofs of the absence of common runtime errors,” in Conf. Rec. 5th Annu. ACM Symp. Principles of Programming Languages, Tuscon, AZ, Jan. 23–25, 1978, pp. 105–118.
13. S. L. Hantler and J. C. King, “An introduction to proving the correctness of programs,” Comput. Surveys, vol. 8, pp. 331–353, Sept. 1976.
14. G. H. Holloway, “User’s guide to the expression analyzer and query facility,” Cent. Res. Comput. Tech., Harvard Univ., Cambridge, MA, Tech. Memo, May 1976.
15. W. E. Howden, “Symbolic testing and the DISSECT symbolic evaluation system,” IEEE Trans. Software Eng., vol. SE-3, pp. 266–278, July 1977.
16. S. Igarashi, R. L. London, and D. C. Luckham, “Automatic program verification 1: A logical basis and its implementation,” Acta Informatica, vol. 4, pp. 145–182, 1975.
17. M. Karr, “Summation in finite terms,” Massachusetts Computer Associates, Wakefield, MA, Tech. Rep., Feb. 1976.
18. S. Katz and Z. Manna, “Logical analysis of programs,” Commun. Assoc. Comput. Mach., vol. 19, pp. 188–206, Apr. 1976.
19. J. C. King, “A program verifier,” Ph.D. dissertation, Dep. Comput. Sci., Carnegie-Mellon Univ., Pittsburgh, PA, June 1969.
20. ―, “Symbolic execution and program testing,” Commun. Assoc. Comput. Mach., vol. 19, pp. 385–394, July 1976.
21. B. W. Lampson, J. J. Horning, R. L. London, J. G. Mitchell, and G. J. Popek, “Report on the programming language Euclid,” Sigplan Notices, vol. 12, Feb. 1977.
22. D. Loveman, “Program improvement by source-to-source transformation,” J. Assoc. Comput. Mach., vol. 24, pp. 121–145, Jan. 1977.
23. “ECL programmer's manual,” Cent. Res. Comput. Tech., Harvard Univ., Cambridge, MA, Tech. Rep. 23–74, Dec. 1974.
24. C. G. Nelson and D. C. Oppen, “A simplifier based on efficient decision algorithms,” in Conf. Rec. 5th Annu. ACM Symp. Principles of Programming Languages, Tuscon, AZ, Jan. 23–25, 1978, pp. 141–150.
25. J. A. Robinson, “A machine oriented logic based on the resolution principle,” J. Assoc. Comput. Mach., vol. 12, Jan. 1965, pp. 23–41.
26. J. F. Rulifson, J. A. Derkson, and R. J. Waldinger, “QA4: A procedure calculus for intuitive reasoning,” Artificial Intelligence Cent., Stanford Res. Inst., Menlo Park, CA, Tech. Note 73, Nov. 1972.
27. G. R. Ruth, “Analysis of algorithm implementations,” MIT Project MAC, Cambridge, MA, Tech. Rep. TR-130, May 1974.
28. R. L. Sites, “Proving that computer programs terminate cleanly,” Ph.D. dissertation, Dep. Comput. Sci., Stanford Univ., Stanford, CA, May 1974.
29. T. Standish, D. Harriman, D. Kibler, and J. Neighbors, “The Irvine program transformation catalogue,” Dep. Inform. and Comput. Sci., Univ. California, Irvine, Jan. 1976.
30. N. Suzuki and K. Ishihata, “Implementation of an array bound checker,” in Conf. Rec. 4th Ann. ACM Symp. Principles of Programming Languages, Los Angeles, CA, Jan. 17–19, 1977, pp. 132–143.
31. J. A. Townley, “A symbolic interpreter for ELl,” Cent. Res. Comput. Tech., Harvard Univ., Cambridge, MA, Tech. Memo, Nov. 1976.
32. ―, “The analysis of pointers in programs,” Cent. Res. Comput. Tech., Harvard Univ., Cambridge, MA, Tech. Memo, Oct. 1978.
33. ―, “An incremental approach to resolution-based theorem proving,” Cent. Res. Comput. Tech., Harvard Univ., Cambridge, MA, Tech. Rep. 15–78, Aug. 1978.
34. ―, “Program analysis techniques for software reliability,” presented at the ACM Workshop on Reliable Software, Bonn Univ., Germany, Sept. 1978.