Logic for computer science: foundations of automatic theorem proving
Logic for computer science: foundations of automatic theorem proving
Software testing based on formal specifications: a theory and a tool
Software Engineering Journal
Proof systems for structured specifications with observability operators
Theoretical Computer Science - Special issue: algebraic development techniques
Dynamic Testing from Bounded Data Type Specifications
EDCC-2 Proceedings of the Second European Dependable Computing Conference on Dependable Computing
Formal Specifications and Test: Correctness and Oracle
Selected papers from the 11th Workshop on Specification of Abstract Data Types Joint with the 8th COMPASS Workshop on Recent Trends in Data Type Specification
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
LOFT: A Tool for Assisting Selection of Test Data Sets from Algebraic Specifications
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Testing Against Formal Specifications: A Theoretical View
TAPSOFT '91 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Developmemnt (CCPSD)
Unit Testing for C88 ASL Architectural Specifications
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Testing from algebraic specifications: test data set selection by unfolding axioms
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
Integration Testing from Structured First-Order Specifications via Deduction Modulo
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Specification-based testing for COCASL'S modal specifications
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Proof-Guided Test Selection from First-Order Specifications with Equality
Journal of Automated Reasoning
Hi-index | 0.00 |
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulae. Test cases are modeled as ground formulae and any specification has an exhaustive test data set whose successful submission means correctness, provided that the software under verification can be modeled as a first-order structure over the same signature. As it has already been done for positive conditional equational specifications, we derive test cases from selection criteria based on axiom coverage. Our selection criteria allows us to select test cases by iteratively unfolding an initial target test purpose, given as a formula. The initial reference test set is iteratively split into successive subsets. Each subset of test cases is defined by constraints which are increasingly introduced by the unfolding procedure to ensure an appropriate matching between the current test purpose under unfolding and specification axioms. Our unfolding procedure is sound (no test is added) and complete (no test is lost) with respect to the starting test purpose. It is exemplified on a simple example.