The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Programmers use slices when debugging
Open accessAbstract
Computer programmers break apart large programs into smaller coherent pieces. Each of these pieces: functions, subroutines, modules, or abstract datatypes, is usually a contiguous piece of program text. The experiment reported here shows that programmers also routinely break programs into one kind of coherent piece which is not coniguous. When debugging unfamiliar programs programmers use program pieces called slices which are sets of statements related by their flow of data. The statements in a slice are not necessarily textually contiguous, but may be scattered through a program.
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
Nonparametric Statistics for the Behavioral Sciences
Guitton, H., & Siegel, S. (1958) · Revue économique · doi:10.2307/3498751 · Cited by 35,245
Chase, W. G., & Simon, H. A. (1973) · Cognitive Psychology · doi:10.1016/0010-0285(73)90004-2 · Cited by 4,479 · cited 1×
“This difference has been studied in chess [2, 4], physics [3, 10], and computer programming [12, 16].”
NONPARAMETRIC STATISTICS FOR THE BEHAVIORAL SCIENCES
Sidney, S. (1957) · The Journal of Nervous and Mental Disease · doi:10.1097/00005053-195707000-00032 · Cited by 2,230
Expert and Novice Performance in Solving Physics Problems
Larkin, J., McDermott, J., Simon, D. P., & Simon, H. A. (1980) · Science · doi:10.1126/science.208.4450.1335 · Cited by 2,109
On the genesis of abstract ideas.
Posner, M. I., & Keele, S. W. (1968) · Journal of Experimental Psychology · doi:10.1037/h0025953 · Cited by 1,981
(1978) · De Gruyter eBooks · doi:10.1515/9783110800647 · Cited by 1,847
Brook, C. V., & de Groot, A. D. (1966) · The American Journal of Psychology · doi:10.2307/1421155 · Cited by 1,284
Software Psychology: Human Factors in Computer and Information Systems
Shneiderman, B. (1980) · CERN Document Server (European Organization for Nuclear Research) · Cited by 779
Flow Analysis of Computer Programs
Hecht, M. S. (1977) · Cited by 724
Weiser, M. (1981) · doi:10.5555/800078.802557 · Cited by 695
Self-citation
Cited by
Weiser, M. (1984) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1984.5010248 · Cited by 3,204
Self-citationThe 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
Usability Analysis of Visual Programming Environments: A ‘Cognitive Dimensions’ Framework
Green, T. R. G., & Petre, M. (1996) · Journal of Visual Languages & Computing · doi:10.1006/jvlc.1996.0009 · Cited by 1,251
Simplifying and isolating failure-inducing input
Zeller, A., & Hildebrandt, R. (2002) · IEEE Transactions on Software Engineering · doi:10.1109/32.988498 · Cited by 1,079
Agrawal, H., & Horgan, J. R. (1990) · Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation - PLDI '90 · doi:10.1145/93542.93576 · Cited by 867
Korel, B., & Laski, J. (1988) · Information Processing Letters · doi:10.1016/0020-0190(88)90054-3 · Cited by 759
Ko, A. J., Myers, B. A., Coblenz, M. J., & Aung, H. H. (2006) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2006.116 · Cited by 685
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
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
Isolating cause-effect chains from computer programs
Zeller, A. (2002) · Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering · doi:10.1145/587051.587053 · Cited by 530
Stimulus structures and mental representations in expert comprehension of computer programs
Pennington, N. (1987) · Cognitive Psychology · doi:10.1016/0010-0285(87)90007-7 · Cited by 526
The DStar Method for Effective Software Fault Localization
Wong, W. E., Debroy, V., Gao, R., & Li, Y. (2014) · IEEE Transactions on Reliability · doi:10.1109/tr.2013.2285319 · Cited by 479
SVF: interprocedural static value-flow analysis in LLVM
Sui, Y., & Xue, J. (2016) · Proceedings of the 25th International Conference on Compiler Construction · doi:10.1145/2892208.2892235 · Cited by 431
Software reconnaissance: Mapping program features to code
Wilde, N., & Scully, M. C. (1995) · Journal of Software Maintenance: Research and Practice · doi:10.1002/smr.4360070105 · Cited by 373
A brief survey of program slicing
Xu, B., Qian, J., Zhang, X., Wu, Z., & Chen, L. (2005) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1050849.1050865 · Cited by 313
Debugging with dynamic slicing and backtracking
Agrawal, H., Demillo, R. A., & Spafford, E. H. (1993) · Software: Practice and Experience · doi:10.1002/spe.4380230603 · Cited by 311
Fault localization using execution slices and dataflow tests
Agrawal, H., Horgan, J. R., London, S., & Wong, W. E. (2002) · Proceedings of Sixth International Symposium on Software Reliability Engineering. ISSRE'95 · doi:10.1109/issre.1995.497652 · Cited by 288
HDD: hierarchical delta debugging
Misherghi, G., & Su, Z. (2006) · Proceedings of the 28th international conference on Software engineering · doi:10.1145/1134285.1134307 · Cited by 274
Developers ask reachability questions
LaToza, T. D., & Myers, B. A. (2010) · Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1 · doi:10.1145/1806799.1806829 · Cited by 145
Metadata
- Authors
- Weiser, M.
- Venue
- Communications of the ACM
- Published
- 1982-07
- Volume
- 25
- Issue
- 7
- Pages
- 446-452
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2141109493
- Cited by
- 761
- References
- 23
- FWCI
- 26.59
- 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
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.