Testing data types implementations from algebraic specifications
| dc.creator | Gaudel, Marie-Claude | |
| dc.creator | Gall, Pascale Le | |
| dc.date | 2008-04-07 | |
| dc.date.accessioned | 2026-07-07T12:18:09Z | |
| dc.date.available | 2026-07-07T12:18:09Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0804.0970 | |
| dc.identifier | http://arxiv.org/abs/0804.0970 | |
| dc.identifier | Formal Methods and Testing, Springer-Verlag (Ed.) (2008) 209-239 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/212310 | |
| dc.subject | Programming Languages | |
| dc.title | Testing data types implementations from algebraic specifications | |
| dc.type | text |