Testing the completeness of specifications

A system is described that tests for the completeness of axiomatic specifications of abstract data types. For testing, the system generates a set of test cases and an implementation of the data type from the specifications. The generated implementation is such that if the specifications are not comp...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on software engineering 1989-05, Vol.15 (5), p.526-531
Main Author: Jalote, P.
Format: Article
Language:English
Subjects:
Applied sciences
Boolean
Computer science
Computer science
control theory
systems
Costs
Exact sciences and technology
Formal specifications
Implementations
Language
Semantics
Software
Software engineering
Software testing
System testing
Testing
Variables
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A system is described that tests for the completeness of axiomatic specifications of abstract data types. For testing, the system generates a set of test cases and an implementation of the data type from the specifications. The generated implementation is such that if the specifications are not complete, the implementation is not complete, and the behavior of all of the sequences of valid operations on the data type is not defined. This implementation is tested with the generated test cases to detect the incompleteness of specifications. The system is implemented on a VAX system running Unix.< >
ISSN:0098-5589
1939-3520
DOI:10.1109/32.24701