Cited by 804Software Testing and Debugging TechniquesVLSI and Analog Circuit TestingFormal Methods in Verification

Constraint-based automatic test data generation

DeMilli, R.A., Offutt, A.J.·1991·IEEE Transactions on Software Engineering

Abstract

A novel technique for automatically generating test data is presented. The technique is based on mutation analysis and creates test data that approximate relative adequacy. It is a fault-based technique that uses algebraic constraints to describe test cases designed to find particular types of faults. A set of tools (collectively called Godzilla) that automatically generates constraints and solves them to create test cases for unit and module testing has been implemented. Godzilla has been integrated with the Mothra testing system and has been used as an effective way to generate test data that kill program mutants. The authors present an initial list of constraints and discuss some of the problems that have been solved to develop the complete implementation of the technique.>

Integrity signals

Registry

Crossref · 10.1109/32.92910

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Low-level languages that allow raw memory access and pointer arithmetic are known to cause problems with memory aliasing and arrays, because the memory location referenced by pointer arithmetic cannot always be determined.

    “For example, low-level languages that support raw memory access and pointer arithmetic are known to pose issues with memory aliasing and arrays as it is not always determinable what memory location is being referred to with pointer arithmetic [52].”

Cited by

Sorted by citations

Authors
DeMilli, R. A., & Offutt, A. J.
Affiliations
  • Purdue University West Lafayette (US)
  • Clemson University (US)
Venue
IEEE Transactions on Software Engineering
Published
1991-09
Volume
17
Issue
9
Pages
900-910
ISSN
  • 0098-5589 (ISSN-L)
  • 1939-3520
  • 2326-3881
OpenAlex
W2120552859
Cited by
804
References
0
Citations by year
2026: 3 · 2025: 8 · 2024: 12 · 2023: 7 · 2022: 12 · 2021: 17 · 2020: 28 · 2019: 21 · 2018: 27 · 2017: 22 · 2016: 35 · 2015: 29 · 2014: 45 · 2013: 42 · 2012: 48
FWCI
31.79
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Software Engineering (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Software › Software Testing and Debugging Techniques
  • Physical Sciences › Computer Science › Hardware and Architecture › VLSI and Analog Circuit Testing
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Formal Methods in Verification
Keywords
automatic test data generation, mutation testing, constraint solving, algebraic constraints, fault-based testing, unit testing, Godzilla, Mothra

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