The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
The program dependence graph in a software development environment
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
McCabe, T. J. (1976) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1976.233837 · Cited by 6,059
Halstead, M. H. (1977) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,930
Halstead, M. H. (1977) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,339
Software Structure Metrics Based on Information Flow
Henry, S., & Kafura, D. (1981) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1981.231113 · Cited by 782
Programmers use slices when debugging
Weiser, M. (1982) · Communications of the ACM · doi:10.1145/358557.358577 · Cited by 761
Weiser, M. (1981) · doi:10.5555/800078.802557 · Cited by 695
First version of a data flow procedure language
Dennis, J. B. (1974) · Lecture Notes in Computer Science · doi:10.1007/3-540-06859-7_145 · Cited by 644
Conversion of control dependence to data dependence
Allen, J. R., Kennedy, K., Porterfield, C., & Warren, J. (1983) · Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '83 · doi:10.1145/567067.567085 · Cited by 609
Dennis (1980) · Computer · doi:10.1109/mc.1980.1653418 · Cited by 580
High-Speed Multiprocessors and Compilation Techniques
Padua, Kuck, & Lawrie (1980) · IEEE Transactions on Computers · doi:10.1109/tc.1980.1675676 · Cited by 270
Cited by
The program dependence graph and its use in optimization
Ferrante, J., Ottenstein, K. J., & Warren, J. D. (1987) · ACM Transactions on Programming Languages and Systems · doi:10.1145/24039.24041 · Cited by 2,755
Self-citationUsing Slicing to Identify Duplication in Source Code
Komondoor, R., & Horwitz, S. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-47764-0_3 · Cited by 527
Integrating noninterfering versions of programs
Horwitz, S., Prins, J., & Reps, T. (1989) · ACM Transactions on Programming Languages and Systems · doi:10.1145/65979.65980 · Cited by 417
Metadata
- Authors
- Ottenstein, K. J., & Ottenstein, L. M.
- Venue
- ACM SIGPLAN Notices
- Published
- 1984-04-25
- Volume
- 19
- Issue
- 5
- Pages
- 177-184
- ISSN
- 0362-1340 (ISSN-L)
- 1558-1160
- OpenAlex
- W2147088720
- Cited by
- 641
- References
- 28
- FWCI
- 7.81
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The program dependence graph in a software development environment. https://app.cochat.ai/papers/10.1145/390011.808263
- The paper
- Ottenstein, K. J., & Ottenstein, L. M. (1984). The program dependence graph in a software development environment. ACM SIGPLAN Notices. https://doi.org/10.1145/390011.808263
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
