On oracles for interpreting test results against algebraic specifications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1548, Issue , 1998, Pages 502-518

  Machado, Patrícia D L ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Algebraic specification; Correctness; Formal verification; Oracle; Specification based testing

Indexed keywords

FORMAL LOGIC; FORMAL VERIFICATION; SOFTWARE ENGINEERING; SOFTWARE TESTING; SPECIFICATIONS;

ALGEBRAIC SPECIFICATIONS; CORRECTNESS; FIRST ORDER LOGIC; NON-OBSERVABLE; ORACLE; ORACLE PROBLEM; SPECIFICATION BASED TESTING; TEST SETS;

ALGEBRA;

EID: 84958957078     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49253-4_35     Document Type: Conference Paper

References (13)

1. G. Bernot. Testing against formal specifications: a theoretical view. In S. Abram- sky and T.S.E. Maibaum, editors, Proceedings of Theory and Practice of Software Development - TAPSOFT'91, volume 494 of Lecture Notes in Computer Science. Springer, 1991.
2. M. Bidoit and R. Hennicker. Behavioural theories and the proof of behavioural properties. Theoretical Computer Science, 165(1):3-55, 1996.
3. J. Dick and A. Faivre. Automating the generation and sequencing of test cases from model-based specifications. In Formal Methods Europe- FME'93, volume 670 of Lecture Notes in Computer Science, pages 268-284. Springer, 1993.
4. E. W. Dijkstra. Why correctness must be a mathematical concern. In R. S. Boyer and J. S. Moore, editors, The Correctness Problem in Computer Science. Academic Press, 1981.
5. P. Le Gall and A. Arnould. Formal specification and test: Correctness and oracle. In Recent Trends in Data Type Specification, volume 1130 of Lecture Notes in Computer Science. Springer, 1996.
6. M. Gaudel. Testing can be formal, too. In Peter D. Mosses, Mogens Nielsen, and Michael I. Schwartzbach, editors, Proceedings of Theory and Practice of Software Development - TAPSOFT'95, volume 915 of Lecture Notes in Computer Science. Springer, 1995.
7. J. B. Goodenough and S. L. Gerhart. Towards a theory of test data selection. IEEE Transactions on Software Engineering, SE-1(2):156-173, June 1975.
8. C. A. R. Hoare. How did software get so reliable without proof ? In Formal Methods Europe - FME'96, volume 1051 of Lecture Notes in Computer Science, pages 1-17. Springer, 1996.
9. S. Kahrs, D. T. Sannella, and A. Tarlecki. The definition of Extended ML: a gentle introduction. Theoretical Computer Science, 173:445-484, 1997.
10. Z. Manna and R. Waldinger. Deductive synthesis of the unification algorithm. Science of Computer Programming, 1:5-48, 1981.
11. D. J. Richardson, S. L. Aha, and T. O. O'Malley. Specification-based test oracles for reactive systems. In Proceedings of the Fourteenth International Conference on Software Engineering, pages 105-118, Melbourne, Australia, May 1992.
12. D. Sannella and A. Tarlecki. Essential concepts of algebraic specification and program development. Formal Aspects of Computing, 9:229-269, 1997.
13. M. Wirsing. Algebraic specification. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 13, pages 675-788. Elsevier Science Publishers, 1990.