Automated Boundary Testing from Z and B

Simple item page
dc.contributor.authorLegeard, Bruno
dc.contributor.authorPeureux, Fabien
dc.contributor.authorUtting, Mark
dc.coverage.spatialConference held at Copenhagen, Denmarken_NZ
dc.date.accessioned2008-12-03T23:09:37Z
dc.date.available2008-12-03T23:09:37Z
dc.date.issued2002
dc.description.abstractWe present a method for black-box boundary testing from B and Z formal specifications. The basis of the method is to test every operation of the system at every boundary state using all input boundary values of that operation. The test generation process is highly automated. It starts by calculating boundary goals from Pre/Post predicates derived from the formal model. Then each boundary goal is instantiated to a reachable boundary state, by searching for a sequence of operations that reaches the boundary goal from the initial state. This process makes intensive use of a set-oriented constraint technology, both for boundary computation and to traverse the state space. The method was designed on the basis of industrial applications in the domain of critical software (Smart card and transportation). Application results show the effectiveness and the scalability of the method. In this paper, we give an overview of the method and focus on the calculation of the boundary goals and states.en_US
dc.identifier.citationLegeard, B., Peureux, F. & Utting, M.(2002). Automated boundary testing from Z and B. In Proceeding of International Symposium of Formal Methods Europe Copenhagen, Denmark, July 22-24, 2002(pp. 221-236). Berlin: Springer.en_US
dc.identifier.doi10.1007/3-540-45614-7_2en_US
dc.identifier.urihttps://hdl.handle.net/10289/1523
dc.language.isoen
dc.publisherSpringeren_US
dc.relation.isPartOfFormal Methodsen_NZ
dc.relation.urihttp://www.springerlink.com/content/pqug5lfud3gnud43/en_US
dc.subjectcomputer scienceen_US
dc.subjectspecification-based testingen_US
dc.subjectboundary valuesen_US
dc.subjectset constraint solvingen_US
dc.subjectB methoden_US
dc.subjectZ notationen_US
dc.titleAutomated Boundary Testing from Z and Ben_US
dc.typeConference Contributionen_US
pubs.begin-page21en_NZ
pubs.elements-id13714
pubs.end-page40en_NZ
pubs.finish-date2002-07-24en_NZ
pubs.place-of-publicationLondon, UKen_NZ
pubs.start-date2002-07-22en_NZ
pubs.volumeProceedings International Symposium of Formal Methods Europeen_NZ
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.79 KB
Format:
Item-specific license agreed upon to submission
Description:
Name: license.txt
Size: 1.79 KB
Kind: License
Collections
Computing and Mathematical Sciences Papers