Handbook of theoretical computer science (vol. B)
Specification-based test oracles for reactive systems
ICSE '92 Proceedings of the 14th international conference on Software engineering
Behavioural theories and the proof of behavioural properties
ALP Proceedings of the fourth international conference on Algebraic and logic programming
The definition of extended ML: a gentle introduction
Theoretical Computer Science - Special issue: algebraic development techniques
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
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)
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
Testing from Structured Algebraic Specifications
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Testing from Formal Specifications, a Generic Approach
Ada Europe '01 Proceedings of the 6th Ade-Europe International Conference Leuven on Reliable Software Technologies
Unit Testing for C88 ASL Architectural Specifications
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Proof-Guided Test Selection from First-Order Specifications with Equality
Journal of Automated Reasoning
Testing techniques in software engineering
Testing techniques in software engineering
Formal methods and testing: hypotheses, and correctness approximations
FM'05 Proceedings of the 2005 international conference on Formal Methods
Test-Case generation for maude functional modules
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
| Hi-index | 0.00 |
This paper presents a solution to the so-called oracle problem for oracles derived from flat algebraic specifications expressed in first-order logic. The oracle problem in this context reduces to the general problem of comparing two values of a non-observable sort and also to the limitations imposed by quantifiers. The solution is based on constructing an oracle where equality between values of a nonobservable sort is computed by one of two "approximate" equalities, according to the context in which the equation occurs. The interpretation given by the oracle does not make any assumptions on test sets and depends on how these equalities approximate the behavioural equality, which is based on behavioural theories, and also on the use of quantifiers.