The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Dynamic program slicing
Open accessAbstract
Program slices are useful in debugging, testing, maintenance, and understanding of programs. The conventional notion of a program slice, the static slice, is the set of all statements that might affect the value of a given variable occurrence. In this paper, we investigate the concept of the dynamic slice consisting of all statements that actually affect the value of a variable occurrence for a given program input. The sensitivity of dynamic slicing to particular program inputs makes it more useful in program debugging and testing than static slicing. Several approaches for computing dynamic slices are examined. The notion of a Dynamic Dependence Graph and its use in computing dynamic slices is discussed. The Dynamic Dependence Graph may be unbounded in length; therefore, we introduce the economical concept of a Reduced Dynamic Dependence Graph, which is proportional in size to the number of dynamic slices arising during the program execution.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,448
Weiser, M. (1984) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1984.5010248 · Cited by 3,204
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
Programmers use slices when debugging
Weiser, M. (1982) · Communications of the ACM · doi:10.1145/358557.358577 · Cited by 761
Korel, B., & Laski, J. (1988) · Information Processing Letters · doi:10.1016/0020-0190(88)90054-3 · Cited by 759
Dependence graphs and compiler optimizations
Kuck, D. J., Kuhn, R. H., Padua, D. A., Leasure, B., & Wolfe, M. (1981) · Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '81 · doi:10.1145/567532.567555 · Cited by 651
The program dependence graph in a software development environment
Ottenstein, K. J., & Ottenstein, L. M. (1984) · ACM SIGPLAN Notices · doi:10.1145/390011.808263 · Cited by 641
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
Interprocedural slicing using dependence graphs
Horwitz, S., Reps, T., & Binkley, D. (2004) · ACM SIGPLAN Notices · doi:10.1145/989393.989419 · Cited by 372
A mechanism for efficient debugging of parallel programs
Miller, B. P., & Choi, J.-D. (1988) · ACM SIGPLAN Notices · doi:10.1145/960116.54004 · Cited by 138
Cited by
Newsome, J., & Song, D. X. (2018) · Figshare · doi:10.1184/r1/6468716 · Cited by 1,270
A Survey on Software Fault Localization
Wong, W. E., Gao, R., Li, Y., Abreu, R., & Wotawa, F. (2016) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2016.2521368 · Cited by 1,110
“To exclude such extra statements from a dice (as well as a slice), we need to use dynamic slicing [20], [202] instead of static slicing, as the former can identify the statements that do affect a particular value observed at a particular location, rather than possibly affecting such a value as with…”
BackgroundSimplifying and isolating failure-inducing input
Zeller, A., & Hildebrandt, R. (2002) · IEEE Transactions on Software Engineering · doi:10.1109/32.988498 · Cited by 1,079
Predicting source code changes by mining change history
Ying, A. T. T., Murphy, G. C., Ng, R., & Chu-Carroll, M. C. (2004) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2004.52 · Cited by 571
Locating causes of program failures
Cleve, H., & Zeller, A. (2005) · Proceedings of the 27th international conference on Software engineering - ICSE '05 · doi:10.1145/1062455.1062522 · Cited by 550
Metadata
- Authors
- Agrawal, H., & Horgan, J. R.
- Venue
- Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation - PLDI '90
- Publisher
- ACM Press
- Published
- 1990
- Pages
- 246-256
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W1984248430
- Cited by
- 867
- References
- 10
- FWCI
- 15.07
- Type
- conference paper
- 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
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.