The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Locating faults through automated predicate switching
Abstract
Typically debugging begins when during a program execution a point is reached at which an obviously incorrect value is observed. A general and powerful approach to automated debugging can be based upon identifying modifications to the program state that will bring the execution to a successful conclusion. However, searching for arbitrary changes to the program state is difficult due to the extremely large search space. In this paper we demonstrate that by forcibly switching a predicate's outcome at runtime and altering the control flow, the program state can not only be inexpensively modified, but in addition it is often possible to bring the program execution to a successful completion (i.e., program produces the desired output). By examining the switched predicate, also called the critical predicate, the cause of the bug can then be identified. Since the outcome of a branch can only be either true or false, the number of modified states resulting by predicate switching is far less than those possible through arbitrary state changes. Thus, it is possible to automatically search through modified states to find one that leads to the correct output. We have developed an implementation based upon dynamic instrumentation to perform this search through program re-execution -- the program is executed from the beginning and a predicate's outcome is switched to produce the desired change in control flow. To evaluate our approach, we tried our technique on several reported bugs for a number of UNIX utility programs. Our technique was found to be practical (i.e., acceptable in time taken) and effective (i.e., we were able to automatically identify critical predicates). Moreover we show that bidirectional dynamic slices of critical predicates capture the faulty code.
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
Weiser, M. (1984) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1984.5010248 · Cited by 3,204
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
Tracking down software bugs using automatic anomaly detection
Hangal, S., & Lam, M. S. (2002) · Proceedings/Proceedings - International Conference on Software Engineering · doi:10.1145/581339.581377 · Cited by 602
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
Bug isolation via remote program sampling
Liblit, B., Aiken, A., Zheng, A. X., & Jordan, M. I. (2003) · ACM SIGPLAN Notices · doi:10.1145/780822.781148 · Cited by 504
Yesterday, my program worked. Today, it does not. Why?
Zeller, A. (1999) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/318774.318946 · Cited by 360
Bug isolation via remote program sampling
Liblit, B., Aiken, A., Zheng, A. X., & Jordan, M. I. (2003) · Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation · doi:10.1145/781131.781148 · Cited by 241
An empirical investigation of the relationship between spectra differences and regression faults
Harrold, M. J., Rothermel, G., Sayre, K., Wu, R., & Yi, L. (2000) · Software Testing, Verification and Reliability · doi:10.1002/1099-1689(200009)10:3<171::aid-stvr209>3.0.co;2-j · Cited by 205
Locating faulty code using failure-inducing chops
Gupta, N., He, H., Zhang, X., & Gupta, R. (2005) · Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering · doi:10.1145/1101908.1101948 · Cited by 186
Self-citationPrecise dynamic slicing algorithms
Zhang, X., Gupta, R., & Zhang, Y. (2003) · doi:10.5555/776816.776855 · Cited by 186
Self-citationExperimental evaluation of using dynamic slices for fault location
Zhang, X., He, H., Gupta, N., & Gupta, R. (2005) · International Symposium on Automated Analysis-Driven Debugging (AADEBUG) · doi:10.1145/1085130.1085135 · Cited by 152
Self-citationAutomated Fault Localization Using Potential InvariantsPreprint
Pytlik, B., Renieris, M., Krishnamurthi, S., & Reiss, S. P. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0310040 · Cited by 120
Efficient forward computation of dynamic slices using reduced ordered binary decision diagrams
Zhang, X., Gupta, R., & Zhang, Y. (2004) · doi:10.5555/998675.999454 · Cited by 66
Self-citationAutomated Debugging Using Path-Based Weakest Preconditions
He, H., & Gupta, N. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24721-0_20 · Cited by 51
Self-citation
Cited by
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
“Predicate switching [405] [352] present a similar technique that analyzes the execution path of a failed test and alters the outcome of branches in that path to produce a successful execution.”
BackgroundNopol: Automatic Repair of Conditional Statement Bugs in Java Programs
Xuan, J., Martinez, M., DeMarco, F., Clement, M., Marcote, S. L., Durieux, T., Le Berre, D., & Monperrus, M. (2017) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2016.2560811 · Cited by 430
TBar: revisiting template-based automated program repair
Liu, K., Koyuncu, A., Kim, D., & Bissyandé, T. F. (2019) · Proceedings of the 28th ACM SIGSOFT International Symposium on Software Testing and Analysis · doi:10.1145/3293882.3330577 · Cited by 321
Automatic Software Repair: A Bibliography
Monperrus, M. (2019) · ACM Computing Surveys · doi:10.1145/3105906 · Cited by 321
Precise Condition Synthesis for Program Repair
Xiong, Y., Wang, J., Yan, R., Zhang, J., Han, S., Huang, G., & Zhang, L. (2017) · 2017 IEEE/ACM 39th International Conference on Software Engineering (ICSE) · doi:10.1109/icse.2017.45 · Cited by 299
Metadata
- Authors
- Zhang, X., Gupta, N., & Gupta, R.
- Venue
- Proceedings of the 28th international conference on Software engineering
- Publisher
- ACM
- Published
- 2006-05-28
- Pages
- 272-281
- ISSN
- 0270-5257 (ISSN-L)
- OpenAlex
- W2156357889
- Cited by
- 277
- References
- 17
- FWCI
- 8.09
- Type
- conference paper
- Language
- en
- Open access
- closed
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.