Computer Science – Programming Languages
Scientific paper
2008-04-07
Formal Methods and Testing, Springer-Verlag (Ed.) (2008) 209-239
Computer Science
Programming Languages
Scientific paper
Algebraic specifications of data types provide a natural basis for testing data types implementations. In this framework, the conformance relation is based on the satisfaction of axioms. This makes it possible to formally state the fundamental concepts of testing: exhaustive test set, testability hypotheses, oracle. Various criteria for selecting finite test sets have been proposed. They depend on the form of the axioms, and on the possibilities of observation of the implementation under test. This last point is related to the well-known oracle problem. As the main interest of algebraic specifications is data type abstraction, testing a concrete implementation raises the issue of the gap between the abstract description and the concrete representation. The observational semantics of algebraic specifications bring solutions on the basis of the so-called observable contexts. After a description of testing methods based on algebraic specifications, the chapter gives a brief presentation of some tools and case studies, and presents some applications to other formal methods involving datatypes.
Gall Pascale Le
Gaudel Marie-Claude
No associations
LandOfFree
Testing data types implementations from algebraic specifications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Testing data types implementations from algebraic specifications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Testing data types implementations from algebraic specifications will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-729852