Architectural Tradeoffs for a Meaning-Preserving Program Restructuring Tool

IEEE Transactions on Software Engineering

Volumn 21, Issue 4, 1995, Pages 275-287

  Griswold, William G ^a   Notkin, David ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

evolution; layered systems; modularization; program representation; program restructuring; Software architecture; software design

Indexed keywords

EVOLUTION; LAYERED SYSTEMS; MODULARIZATION; PROGRAM REPRESENTATION; PROGRAM RESTRUCTURING; SOFTWARE ARCHITECTURE; SOFTWARE DESIGN;

COMPUTER SOFTWARE; DATA STRUCTURES; ENGINEERS; MAINTENANCE; PERFORMANCE; PROGRAM COMPILERS;

COMPUTER AIDED SOFTWARE ENGINEERING;

EID: 0029288894     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.385967     Document Type: Article

References (36)

1. E. W. Dijkstra, “The structure of the “THE”-multiprogramming system,” Commun. ACM, vol. 11, no. 5, pp. 341-346, May 1968.
2. D. Garlan and M. Shaw, “An introduction to software architecture,” in Advances in Software Engineering and Knowledge Engineering, V. Ambriola and G. Tortora, Eds. Singapore: World Scientific, 1993, vol. 1, pp. 1-39.
3. D. L. Parnas, “Designing software for ease of extension and contraction,” IEEE Trans. Software Eng., vol. 5, pp. 128-138, Mar. 1979.
4. A. N. Habermann, L. Hon, and L. Cooprider, “Modularization and hierarchy in a family of operating systems,” Commun. ACM, vol. 19, no. 5, pp. 266-272, May 1976.
5. J. Stankovic, “Good system structure features: Their complexity and execution time cost,” IEEE Trans. Software Eng, vol. SE-8, pp. 306-318, July 1982.
6. W. G. Griswold, “Program Restructuring as an Aid to Software Maintenance,” Ph.D. dissertation, Univ. Washington, Dep. Comput. Sci. & Eng., Tech. Rep. 91-08-04, Aug. 1991.
7. W. G. Griswold and D. Notkin, “Automated assistance for program restructuring,” ACM Trans. Software Eng. and Method., vol. 2, no. 3, pp. 228-269, July 1993.
8. J. Ferrante, K. J. Ottenstein, and J. D. Warren, “The program dependence graph and its use in optimization,” ACM Trans. Programming Languages and Syst., vol. 9, no. 3, pp. 319-349, July 1987.
9. K. Sullivan and D. Notkin, “Reconciling environment integration and component independence,” ACM Trans. Software Eng. and Method., vol. 1, no. 3, pp. 229-268, July 1992.
10. K. J. Sullivan, “Mediators: Easing the design and evolution of integrated systems,” Ph.D. dissertation, Univ. Washington, Dep. Comput. Sci. & Eng., Aug. 1994.
11. W. G. Griswold and D. C. Atkinson, “Managing the design tradeoffs for a program understanding and transformation tool,” J. Syst. Software, July 1995.
12. L. A. Belady and M. M. Lehman, “A model of large program development,” IBM Syst. J., vol. 15, no. 3, pp. 225-252, 1976; reprinted in M. M. Lehman, L. A. Belady, Eds., Program Evolution: Processes of Software Change. London: Academic, APIC Studies in Data Processing no. 27, 1985, ch. 8.
13. Ralph E. Johnson and William F. Opdyke, “Refactoring and aggregation,” in Object Technologies for Advanced Software. First JSSST Int. Symp., Nov. 1993, vol. 742 of Lecture Notes in Computer Science, pp. 264-278.
14. J. R. Larus, Restructuring Symbolic Programs for Concurrent Execution on Multiprocessors, Ph.D. dissertation, UC Berkeley Comput. Sci., May 1989, Also Tech. Rep. UCB/CSD 89/502.
15. J. R. Larus and P. N. Hilfinger, “Detecting conflicts between structure accesses,” in Proc. SIGPLAN '88 Conf. Programming Languages Design and Implementation, June 1988, pp. 21-34; SIGPLAN Notices, vol. 23, no. 7.
16. B. Stroustrup, The C++ Programming Language. Reading, MA: Addison-Wesley, 1991, 2nd ed.
17. D. L. Parnas, “On a buzzword: Hierarchical structure,” in Proc. IFIP Congr. Amsterdam, The Netherlands: North-Holland, Mar. 1974.
18. D. D. Clark, “The structuring of systems using upcalls,” in Proc. 10th Symp. Oper. Syst. Principles, 1985, pp. 171-180.
19. H. L. Ossher, “A mechanism for specifying the structure of large, layered programs,” in Res. Directions in Object-Oriented Programming, B. Shriver and P. Wegner, Eds. Boston, MA: M.I.T. Press, 1987, pp. 219-252.
20. V. Rajlich and J. Sliva, “A case study of software reuse in the vertical domain,” in Proc. 4th Syst. Reengineering Technol. Workshop, Monterey, CA, Feb. 1994.
21. K. B. Gallagher and J. R. Lyle, “Using program slicing in software maintenance,” IEEE Trans. Software Eng., vol. 17, pp. 751-761, Aug. 1991.
22. S. Horwitz, J. Prins, and T. Reps, “Integrating noninterfering versions of programs,” ACM Trans. Programming Languages and Syst., pp. 345-387. July 1989.
23. M. Weiser, “Program slicing,” IEEE Trans. Software Eng., vol. SE-10, pp. 352-357, July 1984.
24. S. Horwitz, T. Reps, and D. Binkley, “Interprocedural slicing using dependence graphs,” ACM Trans. Programming Languages and Syst., vol. 12, no. 1, pp. 26-60, Jan. 1990.
25. T. Reps and T. Teitelbaum, “Language processing in program editors,” IEEE Comput., pp. 29-40, Nov. 1987.
26. M. Burke, “An interval-based approach to exhaustive and incremental interprocedural data-flow analysis,” ACM Trans. Programming Languages and Syst., vol. 12, no. 3, pp. 341-395, July 1990.
27. W. G. Griswold, “Direct update of dataflow representations for a meaning-preserving program restructuring tool,” in ACM SIGSOFT '93 Symp. Foundations of Software Eng., Dec. 1993, pp. 42-55.
28. T. J. Marlowe and B. G. Ryder, “Hybrid incremental alias algorithms,” in Hawaii Int. Conf. Syst. Software, Jan. 1991, pp. 428-437.
29. W. Landi, B. G. Ryder, and S. Zhang, “Interprocedural modification side effect analysis with pointer aliasing,” in Proc. SIGPLAN '93 Conf. Programming Languages Design and Implementation, June 1993, pp. 56-67; SIGPLAN Notices, vol. 28, no. 6.
30. A. V. Aho, R. Sethi, and J. D. Ullman, Compilers, Principles, Techniques, and Tools. Reading, MA: Addison-Wesley, 1986.
31. D. J. Kuck, R. H. Kuhn, B. Leasure, D. A. Padua, and M. Wolfe, “Dependence graphs and compiler optimizations,” in Proc. 8th Symp. Principles of Programming Languages, Jan. 1981, pp. 207-218.
32. R. W. Bowdidge and W. G. Griswold, “Automated support for encapsulating abstract data types,” in ACM SIGSOFT '94 Symposium on the Foundations of Software Engineering, Dec. 1994, pp. 97-110.
33. D. Notkin, D. Garlan, W. G. Griswold, and K. Sullivan, “Adding implicit invocation to languages: Three approaches,” in Object Technologies for Advanced Software. First JSSST Int. Symp., Nov. 1993, vol. 742 of Lecture Notes in Computer Science, pp. 489-510.
34. D. R. Chase, M. Wegman, and F. K. Zadeck, “Analysis of pointers and structures,” in Proc. SIGPLAN '90 Conf. Programming Languages Design and Implementation, June 1990, pp. 296-310; SIGPLAN Notices, vol. 25, no. 6.
35. T. J. Marlowe and B. G. Ryder, “An efficient hybrid algorithm for incremental data flow analysis,” in Proc. 17th Symp. Principles of Programming Languages, Jan. 1990, pp. 184-196.
36. E. Lippe and V. van Oosterom, “Operation-based merging,” in Proc. SIGSOFT '92 Fifth Symp. Software Develop. Environ., Dec. 1992, pp. 78-87.