The program dependence graph in a software development environment

ACM SIGPLAN Notices

Volumn 19, Issue 5, 1984, Pages 177-184

  Ottenstein, Karl J ^a   Ottenstein, Linda M ^a  

^a Michigan Technological University   (United Kingdom)

Author keywords

Code optimization; Control flow; Data flow; Debugging; Internal program representation; Interpreter; Program slice; Software complexity metrics

Indexed keywords

EID: 84976707537     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/390011.808263     Document Type: Article

References (33)

1. Alberga, C. M.; Brown, A. L.; Leeman, G. B., Jr.; Mikelsons, M. and Wegman, M. H. A program development tool. IBM J. of Res. & Dev. 28. 1 (Jan. 1984).
2. Allen, John Randal. Dependence analysis for subscripted variables and its application to program transformations. Ph.D. Thesis. Rice University, Houston (April 1983) 181 pages.
3. Allen, J.R.; Kennedy, Ken; Porterfield, Carrie; and Warren, Joe. Conversion of control dependence to data dependence. Conf. Rec. 10th Ann. ACM Svmp. on Princ. of Prog. Lane. Austin, Texas (Jan. 1983) 177-189.
4. Baker, Albert L. and Zweben, Stuart H. The use of software science in evaluating modularity concepts. IEEE TSE SE-5. 2 (March 1979) 110-120.
5. Basili, Victor R. and Phillips, Tsai-Yun. Evaluating and comparing software metrics in the software engineering laboratory. Proc. 1981 ACM Workshop/Svmp. on Meas. and Eval. of Software Quality published in ACM (Spring 1981)5-106.
6. Curtis, Bill; Sheppard, S. B.; and Milliman, P. Third time charm: stronger prediction of programmer performance by software complexity Eng. (1979) 356-360.
7. Curtis, Bill. Measurement and experimentation in software engineering. Proc. of the IEEE 68, 9. (Sept. 1980) 1144-1157.
8. Dennis, Jack B. First version of a data flow procedure language, revised Comp. Struc. Group Memo 93 (MAC Tech. Memo 61), Lab. for CS, MIT (May 1975) 21 pages.
9. Dennis, Jack B. Data flow supercomputers. IEEE Computer 13.11 (Kov. 1980) 48-56.
10. Dunsmore, H. E. and Gannon, J. D. Data referencing: an empirical investigation. IEEE Computer 12. 12 (Dec. 1979) 50-59.
11. Ehrlich, Kate and Soloway, Elliot. An empirical investigation of the tacit plan knowledge in programming. Research Report 236. Dept, of Computer Science, Yale Univ. (April 1982).
12. Ferrante, Jeanne and Ottenstein, Karl J. A program form based on data dependency in (jL’. 24-26, 1983) 217-236.
13. Ferrante, Jeanne; Ottenstein, Karl J.; and Warren, Joe D. The program dependence graph and its use in optimization. IBM Research Report RC-10208 (August 1983) 10 pages.
14. revision to appear in the Proc. Sixth France (April 1984), Springer-Verlag. Detailed paper in preparation.
15. Feuer, Alan R. and Fowlkes, Edward B. Some results from an empirical study of computer Soft. Ene. Munich, W. Germany, Sept. 17-19, 1979, pp. 351-355. Elsevier North Holland, New York (1977).
16. Hennessy, J. L. optimized code. 323-344.Symbolic
17. Henry, Sallie and Kafura, Dennis. Software structure metrics based on information flow. IEEE TSE SE-7. 5 (Sept. 1981) 510-518.
18. Howden, William E. Contemporary software development environments. CACM 25. 5 (May 1982) 318-329.
19. McCabe, T. J. A complexity measure. IEEE TSE SE-2 (1976) 308-320.
20. Mikelsons, M. Prettyprinting in an interactive on Text Manipulation. Portland, OR (June 1981) 108-116, published as ACM SIGPLAN Notices.
21. Ottenstein, Karl J. and Ottenstein, Linda M. High-level debugging assistance via optimizing compiler technology (extended abstract), Proc. ACM SIGSOFI/SIGPLAN Soft. Ene. Svmp. on High-Level Debugging (see [29] for full entry) 152-154.
22. Ottenstein, Karl J. An intermediate form based on a cyclic data-dependency graph. CS-TR 81-1. Math and Computer Sciences, Mich. Tech. Univ. (October 1981) 91 pages, under revision.
23. Ottenstein, Karl J. Data-flow graphs as an intermediate program form. Ph.D. Thesis. Computer Sciences, Purdue Univ. (August 1978) 283 pages.
24. Padua, David A.; Kuck, David J. and Lawrie, Duncan H. High-speed multiprocessors and compilation techniques. IEEE Trans. Comp. TC-29. i (Sept. 1980) 763-776.
25. Ryder, Barbara G. Incremental data flow analysis. Conf. Rec. Tenth ACM Svmp. on Princ. of Prog. Lang. Austin, Texas (Jan).
26. Schneidewind, H. F. and Hoffman, H. M. An experiment in software error data collection and analysis. IEEE TSE SE-5. 3 (May 1979) 276-286.
27. Skedzielewski, Stephen and Glauert, J.R.W. IFl: An intermediate form for applicative languages, draft 7, November 21, 1983, Lawrence Livermore National Laboratory.
28. Soloway, Elliot; Ehrlich, Kate; Bonar, Jeffrey; and Greenspan, Judith. What do novices know about programming? Research Report 218. Dept, of Computer Science, Yale Univ. (Jan. 1982).
29. Tischler, Ron; Schaufler, Robin; Payne, Charlotte. Static analysis of programs as an aid to debugging. Proc. ACM SIGSOFT/SIGPLAN Pacific Grove, CA, March 20-23, 1983 published as ACM Software Engineering. Notes 8. 4 (August 1983) 155-158.
30. Treleaven, Philip C.; Hopkins, Richard P. and Rautenbach, Paul W. Combining data flow and control flow computing. The Computer Journal 25, 2 (1982) 208-217.
31. Warren, Joe D. A hierarchical basis for reordering transformations. Conf. Rec. 11th ACM Svmp. Princ. Prog. Lang. Salt Lake City, Utah (January 1984).
32. Waters, Richard C. The programmer's apprentice: knowledge based program editing. IEEE Trans. Soft. Ene. SE-8. 1 (Jan. 1982) 1-12.
33. Waters, Richard C. Automatic analysis of the logical structure of programs. MIT AI-Lab TR-492, available as NTIS AD-A084 818 (December 1978) 207 pages. Summarizing graphs by regular Conf. Rec. Tenth ACM Svmp. on ang. Austin, Texas (Jan. 24-26, 1983) 203-216.