The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Two notions of correctness and their relation to testing
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
Theory of Recursive Functions and Effective Computability.
Feferman, S., & Rogers, H. (1969) · The American Mathematical Monthly · doi:10.2307/2316720 · Cited by 2,788
Theory of Recursive Functions and Effective Computability
Cooper, D. C. (1969) · The Computer Journal · doi:10.1093/comjnl/12.1.28 · Cited by 2,539
Hints on Test Data Selection: Help for the Practicing Programmer
DeMillo, R. A., Lipton, R. J., & Sayward, F. G. (1978) · Computer · doi:10.1109/c-m.1978.218136 · Cited by 2,081
Theory of Recursive Functions and Effective Computability
Rogers, J. H. (1987) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,998
Formal Languages and Their Relation to Automata
Hopcroft, J. E., & Ullman, J. D. (1969) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,355
Formal Languages and their Relation to Automata
Morris, J. B. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19706 · Cited by 998
A System to Generate Test Data and Symbolically Execute Programs
Clarke, L. A. (1976) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1976.233817 · Cited by 764
Toward a mathematical theory of inductive inference
Blum, L., & Blum, M. (1975) · Information and Control · doi:10.1016/s0019-9958(75)90261-2 · Cited by 670
Testing Programs with the Aid of a Compiler
Hamlet, R. G. (1977) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1977.231145 · Cited by 552
Toward a theory of test data selection
Goodenough, J. B., & Gerhart, S. L. (1975) · ACM SIGPLAN Notices · doi:10.1145/390016.808473 · Cited by 514
Reliability of the Path Analysis Testing Strategy
Howden, W. E. (1976) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1976.233816 · Cited by 400
A Domain Strategy for Computer Program Testing
White, L. J., & Cohen, E. I. (1980) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1980.234486 · Cited by 378
Toward a theory of test data selection
Goodenough, J. B., & Gerhart, S. L. (1975) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1975.6312836 · Cited by 320
On the complexity of minimum inference of regular sets
Angluin, D. (1978) · Information and Control · doi:10.1016/s0019-9958(78)90683-6 · Cited by 251
Self-citationMutation analysis of program test data
Budd, T. A. (1980) · Cited by 236
Self-citationConstructing Programs from Example Computations
Biermann, A. W., & Krishnaswamy, R. (1976) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1976.233812 · Cited by 158
An Introduction to Proving the Correctness of Programs
Hantler, S. L., & King, J. C. (1976) · ACM Computing Surveys · doi:10.1145/356674.356677 · Cited by 157
Research Directions in Software Technology
Hopgood, F. R. A. (1980) · The Computer Journal · doi:10.1093/comjnl/23.3.222 · Cited by 135
Heuristics for Determining Equivalence of Program Mutations.
Baldwin, D., & Sayward, F. G. (1979) · Defense Technical Information Center (DTIC) · doi:10.21236/ada071795 · Cited by 114
On Effective Procedures for Speeding Up Algorithms
Blum, M. (1971) · Journal of the ACM · doi:10.1145/321637.321648 · Cited by 65
Cited by
An Analysis and Survey of the Development of Mutation Testing
Jia, Y., & Harman, M. (2011) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2010.62 · Cited by 1,745
Software unit test coverage and adequacy
Zhu, H., Hall, P. A. V., & May, J. H. R. (1997) · ACM Computing Surveys · doi:10.1145/267580.267590 · Cited by 1,247
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
Constraint-based automatic test data generation
DeMilli, R. A., & Offutt, A. J. (1991) · IEEE Transactions on Software Engineering · doi:10.1109/32.92910 · Cited by 804
Using Mutation Analysis for Assessing and Comparing Testing Coverage Criteria
Andrews, J. H., Briand, L. C., Labiche, Y., & Namin, A. S. (2006) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2006.83 · Cited by 481
Metadata
- Authors
- Budd, T. A., & Angluin, D.
- Venue
- Acta Informatica
- Published
- 1982
- Volume
- 18
- Issue
- 1
- Pages
- 31-45
- ISSN
- 0001-5903 (ISSN-L)
- 1432-0525
- OpenAlex
- W2033140592
- Cited by
- 260
- References
- 20
- FWCI
- 7.18
- Type
- journal article
- 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.