A Framework for Specification-Based Testing
IEEE Transactions on Software Engineering
Reduced Length Checking Sequences
IEEE Transactions on Computers
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Automating the Generation and Sequencing of Test Cases from Model-Based Specifications
FME '93 Proceedings of the First International Symposium of Formal Methods Europe on Industrial-Strength Formal Methods
How Did Software Get So Reliable Without Proof?
FME '96 Proceedings of the Third International Symposium of Formal Methods Europe on Industrial Benefit and Advances in Formal Methods
Test Case Design Based on Z and the Classification-Tree Method
ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
Identification of Categories and Choices in Activity Diagrams
QSIC '05 Proceedings of the Fifth International Conference on Quality Software
CHOC'LATE: a framework for specification-based testing
Communications of the ACM
A safe regression testing approach for safety critical systems
Advances in Engineering Software
Choices, choices: comparing between CHOC'LATE and the classification-tree methodology
Ada-Europe'12 Proceedings of the 17th Ada-Europe international conference on Reliable Software Technologies
Hi-index | 0.02 |
The Classification Tree Method provides a flexible basis for systematic testing. Traditionally the generation of a classification tree has been entirely manual. This paper introduces a new approach that extracts predicates from the Z specification of an operation and builds a Classification Tree from these predicates. It thus shows how the generation of a Classification Tree may be semi-automated on the basis of a Z specification. The paper also defines the notion of the test context of a predicate that determines when the value of this predicate is relevant. The test context is used to reduce the number of tests produced from the Classification Tree.