Test-Design through Abstraction - A Systematic Approach Based on the Refinement Calculus
| dc.creator | Aichernig,Bernhard | |
| dc.date | 2001 | |
| dc.date.accessioned | 2024-02-06T12:51:21Z | |
| dc.date.available | 2024-02-06T12:51:21Z | |
| dc.description | This article discusses the calculation of test-cases for interactive systems. A novel approach is presented that treats the problem of test-case synthesis as a formal abstraction problem. It is shown that test-cases can be viewed as formal contracts and that such test-cases are in fact abstractions of requirements specifications. The refinement calculus of Back and von Wright is used to formulate abstraction rules for calculating correct test-cases from a formal specification. The advantage of this abstraction approach is that simple input-output test-cases, as well as testing scenarios can be handled. Furthermore, different testing strategies like partition testing and mutation testing can be formulated in one theory. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-007-08-0710 | |
| dc.identifier | https://lib.jucs.org/article/27814/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/8003 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 7(8): 710-735 | |
| dc.subject | testing | |
| dc.subject | test-case generation | |
| dc.subject | formal methods | |
| dc.subject | refinement calculus | |
| dc.title | Test-Design through Abstraction - A Systematic Approach Based on the Refinement Calculus | |
| dc.type | Research Article |