article

Free access

The program dependence graph in a software development environment

Authors:

Karl J. Ottenstein,

Linda M. OttensteinAuthors Info & Claims

ACM SIGSOFT Software Engineering Notes, Volume 9, Issue 3

Pages 177 - 184

https://doi.org/10.1145/390010.808263

Published: 25 April 1984 Publication History

Abstract

The internal program representation chosen for a software development environment plays a critical role in the nature of that environment. A form should facilitate implementation and contribute to the responsiveness of the environment to the user. The program dependence graph (PDG) may be a suitable internal form. It allows programs to be sliced in linear time for debugging and for use by language-directed editors. The slices obtained are more accurate than those obtained with existing methods because I/O is accounted for correctly and irrelevant statements on multi-statement lines are not displayed. The PDG may be interpreted in a data driven fashion or may have highly optimized (including vectorized) code produced from it. It is amenable to incremental data flow analysis, improving response time to the user in an interactive environment and facilitating debugging through data flow anomaly detection. It may also offer a good basis for software complexity metrics, adding to the completeness of an environment based on it.

References

[1]

Alberga, C. N.; Brown, A. L.; Leeman, G. B., Jr.; Mikelsons, M. and Wegman, M. N. A program development tool. IBM J. of Res. & Dev. 28, 1 (Jan. 1984).

Digital Library

[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.

Digital Library

[3]

Allen, J.R.; Kennedy, Ken; Porterfield, Carrie; and Warren, Joe. Conversion of control dependence to data dependence. Conf. Rec. 10th Ann. ACM Symp. on Princ. of Prog. Lang. Austin, Texas (Jan. 1983) 177-189.

Digital Library

[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.

Digital Library

[5]

Basili, Victor R. and Phillips, Tsai-Yun. Evaluating and comparing software metrics in the software engineering laboratory. Proc. 1981 ACM Workshop/Symp. on Meas. and Eval. of Software Quality published in ACM SIGMETRICS Performance Evaluation Review 10 1 (Spring 1981) 95-106.

Digital Library

[6]

Curtis, Bill; Sheppard, S. B.; and Milliman, P. Third time charm: stronger prediction of programmer performance by software complexity metrics. Proc. 4th IEEE Int. Conf. Soft. Eng. (1979) 356-360.

Digital Library

[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 (Nov. 1980) 48-56.

Digital Library

[10]

Dunsmore, H. E. and Gannon, J. D. Data referencing: an empirical investigation. IEEE Computer 12, 12 (Dec. 1979) 50-59.

Digital Library

[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 predicate regions, Conf. Rec. Tenth ACM Symp. on Princ. of Prog. Lang., Austin, Texas (Jan. 24-26, 1983) 217-236.

Digital Library

[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, revision to appear in the Proc. Sixth International Symp. on Programming, Toulouse, France (April 1984), Springer-Verlag. Detailed paper in preparation.

Digital Library

[14]

Feuer, Alan R. and Fowlkes, Edward B. Some results from an empirical study of computer software. Proc. of the 4th Int. Conf. on soft. Eng., Munich, W. Germany, Sept. 17-19, 1979, pp. 351-355.

Digital Library

[15]

Halstead, M. H. Elements of Software Science, Elsevier North Holland, New York (1977).

Digital Library

[16]

Hennessy, J. L. Symbolic debugging of optimized code. ACM TOPLAS 5, 3 (July 1982) 323-344.

Digital Library

[17]

Henry, Sallie and Kafura, Dennis. Software structure metrics based on information flow. IEEE TSE SE-7, 5 (Sept. 1981) 510-518.

Digital Library

[18]

Howden, William E. Contemporary software development environments. CACM 25, 5 (May 1982) 318-329.

Digital Library

[19]

McCabe, T. J. A complexity measure. IEEE TSE SE-2 (1976) 308-320.

Digital Library

[20]

Mikelsons, M. Prettyprinting in an interactive environment. Proc. ACM SIGPLAN/SIGOA Symp. on Text Manipulation, Portland, OR (June 1981) 108-116, published as ACM SIGPLAN Notices.

Digital Library

[21]

Ottenstein, Karl J. and Ottenstein, Linda M. High-level debugging assistance via optimizing compiler technology (extended abstract), Proc. ACM SIGSOFT/SIGPLAN Soft. Eng. Symp. on High-Level Debugging (see {29} for full entry) 152-154.

Digital Library

[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.

Digital Library

[24]

Padua, David A.; Kuck, David J. and Lawrie, Duncan H. High-speed multiprocessors and compilation techniques. IEEE Trans. Comp. TC-29, 9 (Sept. 1980) 763-776.

Digital Library

[25]

Ryder, Barbara G. Incremental data flow analysis. Conf. Rec. Tenth ACM Symp. on Princ. of Prog. Lang., Austin, Texas (Jan. 24-26, 1983) 167-176.

Digital Library

[26]

Schneidewind, N. F. and Hoffman, H. M. An experiment in software error data collection and analysis. IEEE TSE SE-5, 3 (May 1979) 276-286.

Digital Library

[27]

Skedzielewski, Stephen and Glauert, J.R.W. IF1: 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 Soft. Eng. Symp. on High-Level Debugging, Pacific Grove, CA, March 20-23, 1983 published as ACM Software Engineering Notes 8, 4 (August 1983) and as ACM SIGPLAN Notices 18, 8 (August 1983) 155-158.

Digital Library

[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 Symp. Princ. Prog. Lang., Salt Lake City, Utah (January 1984).

Digital Library

[32]

Waters, Richard C. The programmer's apprentice: knowledge based program editing. IEEE Trans. Soft. Eng. 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.

Digital Library

[34]

Wegman, Mark. Summarizing graphs by regular expressions. Conf. Rec. Tenth ACM Symp. on Princ. of Prog. Lang., Austin, Texas (Jan. 24-26, 1983) 203-216.

Digital Library

[35]

Weiser, Mark. Program slicing, Proc. 5th Int. Conf. on Soft. Eng., San Diego, Calif., IEEE Computer Soc. Press (March 9-12, 1981) 439-449.

Digital Library

[36]

Weiser, Mark. Programmers use slices when debugging. CACM 25, 27 (July 1982) 446-452.

Digital Library

[37]

Zellweger, Polle T. An interactive high-level debugger for control-flow optimized programs, Proc. ACM SIGSOFT/SIGPLAN Soft. Eng. Symp. On High-Level Debugging (see {29} for full entry) 159-171.

Digital Library

Cited By

Galindo CPérez SSilva J(2025)The expression dependence graphJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2024.101016142(101016)Online publication date: Jan-2025
https://doi.org/10.1016/j.jlamp.2024.101016
Galindo CKrinke JPérez SSilva J(2024)Field-sensitive program slicingJournal of Systems and Software10.1016/j.jss.2023.111939210:COnline publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1016/j.jss.2023.111939
Zheheng LJianming CWuqiang SChaosheng YLulu W(2023)ECIA: Elaborate Change Impact Analysis Based on Sub-Statement Level Dependency Graph2023 IEEE 23rd International Conference on Software Quality, Reliability, and Security Companion (QRS-C)10.1109/QRS-C60940.2023.00032(471-480)Online publication date: 22-Oct-2023
https://doi.org/10.1109/QRS-C60940.2023.00032
Show More Cited By

Index Terms

The program dependence graph in a software development environment
1. Social and professional topics
  1. Professional topics
    1. Management of computing and information systems
      1. Software management
2. Software and its engineering
  1. Software creation and management
    1. Software verification and validation
      1. Empirical software validation
      2. Software defect analysis
        Software testing and debugging
  2. Software organization and properties
    1. Software functional properties
      1. Formal methods

Recommendations

The program dependence graph in a software development environment

The internal program representation chosen for a software development environment plays a critical role in the nature of that environment. A form should facilitate implementation and contribute to the responsiveness of the environment to the user. The ...
The program dependence graph in a software development environment
SDE 1: Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments

The internal program representation chosen for a software development environment plays a critical role in the nature of that environment. A form should facilitate implementation and contribute to the responsiveness of the environment to the user. The ...
The program dependence graph and its use in optimization

In this paper we present an intermediate program representation, called the program dependence graph (PDG), that makes explicit both the data and control dependences for each operation in a program. Data dependences have been used to represent only the ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGSOFT Software Engineering Notes

ACM SIGSOFT Software Engineering Notes Volume 9, Issue 3

May 1984

196 pages

ISSN:0163-5948

DOI:10.1145/390010

Editor:
Peter Henderson

Issue’s Table of Contents

SDE 1: Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
April 1984
196 pages
ISBN:0897911318
DOI:10.1145/800020
Chairmen:
William Riddle,
Peter B. Henderson

Copyright © 1984 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 April 1984

Published in SIGSOFT Volume 9, Issue 3

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

574
Total Citations
View Citations
4,634
Total Downloads

Downloads (Last 12 months)451
Downloads (Last 6 weeks)50

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Galindo CPérez SSilva J(2025)The expression dependence graphJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2024.101016142(101016)Online publication date: Jan-2025
https://doi.org/10.1016/j.jlamp.2024.101016
Galindo CKrinke JPérez SSilva J(2024)Field-sensitive program slicingJournal of Systems and Software10.1016/j.jss.2023.111939210:COnline publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1016/j.jss.2023.111939
Zheheng LJianming CWuqiang SChaosheng YLulu W(2023)ECIA: Elaborate Change Impact Analysis Based on Sub-Statement Level Dependency Graph2023 IEEE 23rd International Conference on Software Quality, Reliability, and Security Companion (QRS-C)10.1109/QRS-C60940.2023.00032(471-480)Online publication date: 22-Oct-2023
https://doi.org/10.1109/QRS-C60940.2023.00032
Ufuktepe ETuglular T(2023)Application of the Law of Minimum and Dissimilarity Analysis to Regression Test Case PrioritizationIEEE Access10.1109/ACCESS.2023.328321211(57137-57157)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3283212
Léchenet JKosmatov NLe Gall P(2023)Efficient computation of arbitrary control dependenciesTheoretical Computer Science10.1016/j.tcs.2023.114029969(114029)Online publication date: Aug-2023
https://doi.org/10.1016/j.tcs.2023.114029
Stiévenart QBinkley DDe Roover C(2023)An empirical evaluation of quasi-static executable slicesJournal of Systems and Software10.1016/j.jss.2023.111666200(111666)Online publication date: Jul-2023
https://doi.org/10.1016/j.jss.2023.111666
Galindo CPérez SSilva J(2023)Program slicing of Java programsJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2022.100826130(100826)Online publication date: Jan-2023
https://doi.org/10.1016/j.jlamp.2022.100826
Zhou YShen JZhang XYang WHan TChen T(2022)Automatic source code summarization with graph attention networksJournal of Systems and Software10.1016/j.jss.2022.111257188(111257)Online publication date: Jul-2022
https://doi.org/10.1016/j.jss.2022.111257
Masud A(2022)Efficient computation of minimal weak and strong control closureJournal of Systems and Software10.1016/j.jss.2021.111140184:COnline publication date: 3-Jan-2022
https://dl.acm.org/doi/10.1016/j.jss.2021.111140
Galindo CKrinke JPérez SSilva J(2022)Field-Sensitive Program SlicingSoftware Engineering and Formal Methods10.1007/978-3-031-17108-6_5(74-90)Online publication date: 26-Sep-2022
https://dl.acm.org/doi/10.1007/978-3-031-17108-6_5
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Issue’s Table of Contents