The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Software testing based on formal specifications: a theory and a tool
Abstract
This paper addresses the problem of constructing test data sets from formal specifications. Starting from a notion of an ideal exhaustive test data set, which is derived from the notion of satisfaction of the formal specification, we show how to select by refinements a practicable test set, i.e. computable, while not rejecting correct programs (unbiased) and accepting only correct programs (valid), when assuming certain hypotheses. The hypotheses play an important role; they formalise common test practices and they express the gap between the success of the test and correctness; the size of the test set depends on the strength of the hypotheses. The paper shows an application of this theory for algebraic specifications and presents the actual procedures used to mechanically product such test sets, using Horn clause logic. These procedures are embedded in an interactive system, which, given some general hypothesis schemes and an algebraic specification, produces a test set and the corresponding hypotheses.
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
On testing non-testable programs
Weyuker, E. J. (1982) · The Computer Journal · doi:10.1093/comjnl/25.4.465 · Cited by 606
Data Abstraction, Implementation, Specification, and Testing
Gannon, J., McMullin, P., & Hamlet, R. (1981) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357139.357140 · Cited by 221
Negation and Control in Prolog
Naish, L. (1986) · Springer eBooks · doi:10.1007/bfb0021681 · Cited by 170
SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting.
Fribourg, L. (1985) · SLP · Cited by 167
Cited by
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
The oracle problem in software testing: A survey
Barr, E. T., Harman, M., McMinn, P., Shahbaz, M., & Yoo, S. (2015) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2014.2372785 · Cited by 1,104
Software Testing Research: Achievements, Challenges, Dreams
Bertolino, A. (2007) · Future of Software Engineering (FOSE '07) · doi:10.1109/fose.2007.25 · Cited by 840
Using formal specifications to support testing
Hierons, R. M., Bogdanov, K., Bowen, J. P., Cleaveland, R., Derrick, J., Dick, J., Gheorghe, M., Harman, M., Kapoor, K., Krause, P., et al. (2009) · ACM Computing Surveys · doi:10.1145/1459352.1459354 · Cited by 356
The ASTOOT approach to testing object-oriented programs
Doong, R.-K., & Frankl, P. G. (1994) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/192218.192221 · Cited by 321
Metadata
- Authors
- Bernot, G., Claude Gaudel, M., & Marre, B.
- Venue
- Software Engineering Journal
- Published
- 1991
- Volume
- 6
- Issue
- 6
- Pages
- 387
- ISSN
- 0268-6961 (ISSN-L)
- OpenAlex
- W2125831829
- Cited by
- 323
- References
- 4
- FWCI
- 25.09
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Software testing based on formal specifications: a theory and a tool. https://app.cochat.ai/papers/10.1049/sej.1991.0040
- The paper
- Bernot, G., Claude Gaudel, M., & Marre, B. (1991). Software testing based on formal specifications: a theory and a tool. Software Engineering Journal. https://doi.org/10.1049/sej.1991.0040
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.