A program integration algorithm that accommodates semantics-preserving transformations

Proceedings of the 4th ACM SIGSOFT Symposium on Software Development Environments, SDE 1990

Volumn , Issue , 1990, Pages 133-143

  Yang, Wuu ^a   Howitz, Susan ^a   Reps, Thomas ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGRATION; SEMANTICS;

INTEGRATED PROGRAMS; INTEGRATION ALGORITHM; INTEGRATION TECHNIQUES; PROGRAM INTEGRATION;

SOFTWARE DESIGN;

EID: 85030675228     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/99277.99290     Document Type: Conference Paper

References (16)

1. Alpern, B., Wegman, M.N., and Zadeck, F.K., "Detecting equality of variables in programs, " pp. l-11 in Conference Record of the Fifteenth ACM Symposium on Principles of Programming Longuuges, (San Diego, CA, January 13-15, 1988). ACM, New York, NY (1988).
2. Berzins, V., "On merging software extensions, " Acta Informatica 2.3 pp. 607619 (1986).
3. Cytron, R., Ferrante, J., Rosen. B.K., Wegman, M.N., and Zadeck, K., "An efficient method of computing static single assignment form, " pp. 25-35 in Conference Record of the Sixteenth ACM Symposium on Principles of Programming Languages, (Austin, TX, Jan. 11-13, 1989), ACM, New York, NY (1989).
4. Feather, M., "Detecting interference when merging specification evolutions, " Unpublished report, Information Sciences Institute, Univ. of Southern California, Marina de1 Rey, CA (1989).
5. Ferrante, I. Gttenstein. K., and Warren, J. "The program dependence graph and its use in optimization, " ACM Transactions on Programming Languages and Systems 9(3) pp. 319-349 (July 1987).
6. Hopcroft. J.E., "An n log n algorithm for minimizing the states of a finite automaton, " The Theory of Machines and Computations. pp. 189-196 (1971).
7. Horwitz, S., Prins. J.. and Reps, T., On the srtitabifily of dependence graphs for represeniing programs, Department of Computer Sciences, University of Wisconsin-Madison (August 1988).
8. Horwitz. S., Prins. I.. and Reps, T., "Integrating non-interfering versions of programs, " ACM Trans. Program. Lang. Sysr. 11(3)pp. 34.5-387 (July 1989).
9. Kuck, D.J., Kuhn, R.H., Leasure, B., Padua, D.A., and Wolfe, M., "Dependence graphs and compiler optimixations, " pp. 207-218 in Conference Record of the Eighth ACM Symposium on Principles of Programming Languages, (Williamsburg, VA, January 26-28, 1981), ACM, New York, NY (1981).
10. Lakhotia, A. and Sterling, L., "Composing recursive logic programs with clausal join, " New Generation Compufing 6 pp. 21 l-225 (1988).
11. Ottenstein K.J. and Ottenstein, L.M., "The program dependence graph in a software development environment, " Proceedings of fhe ACM SIGSOFTISIGPLAN Software Engineering Symposium on Practical Software Development Environments, (Pittsburgh, PA, Apr. 23-25, 1984), ACM SIGPLANNotices 19(5) pp. 177-184 (May 1984).
12. Rich, C., "Inspection methods in programming: clichds and plans, " A.I. Memo No. 1005, Artificial Intelligence Laboratory, M.I.T., Cambridge, MA (December 1987).
13. Rosen, B., Wegman, M.N., and Zadeck, F.K., "Global value numbers and redundant computations, " pp. 12-27 in Conference Record offhe Fifteenth ACM Symposium on Principles of Programming Languages, (San Diego, CA, January 13-15, 1988). ACM, New York, NY (1988).
14. Weiser, M., "'Program slicing, " IEEE Transactions on Software Engineering SE-lO(4) pp. 352-357 (July 1984).
15. Yang, W., Horwitz, S., and Reps, T., "Detecting program components with equivalent behaviors, " TR-840, Computer Sciences Department, University of Wisconsin, Madison, WI (April 1989).
16. Yang, W. "A new algorithm for semantics-based program integration, " Ph.D. dissertation, Computer Sciences Department, University of Wisconsin, Madison, WI (August 1990).