Program Integration for Languages with Procedure Calls

ACM Transactions on Software Engineering and Methodology (TOSEM)

Volumn 4, Issue 1, 1995, Pages 3-35

  Binkley, David ^a   Horwitz, Susan ^b   Reps, Thomas ^b  

^a LOYOLA UNIVERSITY MARYLAND   (United States)

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

Control dependence; data dependence; data flow analysis; flow insensitive summary information; program dependence graph; program slicing; semantics based program integration

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; CONTROL SYSTEMS; DATA PROCESSING; DATA STRUCTURES; ENCODING (SYMBOLS); GRAPH THEORY; PROGRAM PROCESSORS; SOFTWARE ENGINEERING;

CONTROL DEPENDENCE; DATA DEPENDENCE; DATA FLOW ANALYSIS; FLOW INSENSITIVE SUMMARY INFORMATION; PROCEDURE CALLS; PROGRAM DEPENDENCE GRAPH; PROGRAM INTEGRATION; PROGRAM SLICING;

COMPUTER SOFTWARE;

EID: 0029233080     PISSN: 1049331X     EISSN: 15577392     Source Type: Journal    
DOI: 10.1145/201055.201056     Document Type: Article

References (23)

1. BALL, T., HORWITZ, S., AND REPS, T. 1990. Correctness of an algorithm for reconstituting a program from a dependence graph. TR-947, Computer Sciences Dept., Univ. of Wisconsin, Madison, Wisc.
2. BINKLEY, D. 1991. Multi-procedure program integration. Ph.D. dissertation and Tech. Rep. TR-1038, Computer Sciences Dept., Univ. of Wisconsin, Madison, Wisc.
3. BINKLEY, D., HORWITZ, S., AND REPS, T. 1995. The theory of multi-procedure integration. Tech. Rep., Computer Sciences Dept., Univ of Wisconsin, Madison, Wisc. In preparation.
4. COOPER, K. D. AND KENNEDY, K. 1988. Interprocedural side-effect analysis in linear time. In Proceedings of the ACM SIGPLAN 88 Conference on Programming Language Design and Implementation (Atlanta, Ga., June 22-24). ACM SIGPLAN Not. 23, 7 (July), 57-66.
5. DONZEAU-GOUGE, V., HUET, G., KAHN, G, AND LANG, B. 1984. Programming environments based on structured editors: The MENTOR experience. In Interactive Programming Environments, D. Barstow, E. Sandewall, and H. Shrobe, Eds. McGraw-Hill, New York, 128-140.
6. FERRANTE, J., OTTENSTEIN, K., AND WARREN, J. 1987. The program dependence graph and its use in optimization. ACM Trans. Program. Lang. Syst. 9, 3 (July), 319-349.
7. HORWITZ, S., PRINS, J., AND REPS, T. 1989. Integrating non-interfering versions of programs. ACM Trans. Program. Lang. Syst. 11, 3 (July), 345-387.
8. HORWITZ, S., REPS, T., AND BINKLEY, D. 1990. Interprocedural slicing using dependence graphs. ACM Trans. Program. Lang. Syst. 12, 1 (Jan.), 26-60
9. KUCK, D. J., KUHN, R. H., LEASURE, B., PADUA, D. A., AND WOLFE, M. 1981. Dependence graphs and compiler optimizations. In Conference Record of the 8th ACM Symposium on Principles of Programming Languages (Williamsburg, Va., Jan. 26-28). ACM, New York, 207-218.
10. LANDI, W. AND RYDER, B. 1991. Pointer-induced aliasing: A problem classification. In Conference Record of the 18th ACM Symposium on Principles of Programming Languages (Orlando, Fla., Jan. 21-23). ACM, New York, 93-103.
11. NOTKIN, D., ELLISON, R. J., STAUDT, B. J., KAISER, G. E., KANT, E., HABERMAN, A. N., AMBRIOLA, V., AND MONTANGERO, C. 1985. Special issue on the GANDALF project. J. Syst. Softw. 5, 2 (May).
12. OTTENSTEIN, K. J. AND OTTENSTEIN, L. M. 1984. The program dependence graph in a software development environment. In Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments (Pittsburgh, Pa., Apr. 23-25). ACM SIGPLAN Not. 19, 5 (May), 177-184.
13. REPS, T. 1989. Demonstration of a prototype tool for program integration. TR-819, Computer Sciences Dept., Univ. of Wisconsin, Madison, Wisc.
14. REPS, T. 1993. The Wisconsin program-integration system reference manual: Release 2.0. Unpublished Report, Computer Sciences Dept., Univ. of Wisconsin, Madison, Wisc.
15. REPS, T. AND BRICKER, T. 1989. Illustrating interference in interfering versions of programs. In Proceedings of the 2nd International Workshop on Software Configuration Management (Princeton, N.J., Oct. 24-27). ACM SIGSOFT Softw. Eng. Not. 17, 7 (Nov.), 46-55.
16. REPS, T. AND TEITELBAUM, T. 1988. The Synthesizer Generator: A System for Constructing Language-Based Editors. Springer-Verlag, New York.
17. REPS, T. AND YANG, W. 1988. The semantics of program slicing. TR-777, Computer Sciences Dept., Univ. of Wisconsin, Madison, Wisc.
18. REPS, T., SAGIV., M., AND HORWITZ, S. 1994. Interprocedural dataflow analysis via graph reachability. Tech. Rep. TR 94-14, Datalogisk Institut, Univ. of Coopenhagen, Denmark.
19. RICE, H. G. 1953. Classes of recursively enumerable sets and their decision problems. Trans. AMS 89, 25-59.
20. As cited in Hopcroft and Ullman, Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass. 1979.
21. SHARIR, M. AND PNUELI, A. 1981. Two approaches to interprocedural data flow analysis. In Program Flow Analysis: Theory and Applications, S. S. Muchnick and N. D. Jones, Eds. Prentice-Hall, Englewood Cliffs, N.J.
22. WEISER, M. 1984. Program slicing. IEEE Trans. Softw. Eng. SE-10, 4 (July), 352-357.
23. YANG, W. 1990. A new algorithm for semantics-based program integration. Ph.D. dissertation and Tech. Rep. TR-962, Computer Sciences Dept., Univ. of Wisconsin, Madison, Wisc.