Computer Science – Logic in Computer Science
Scientific paper
2010-04-08
Computer Science
Logic in Computer Science
Tests and Proofs 2010, Malaga : Spain (2010)
Scientific paper
In a model-based testing approach as well as for the verification of properties, B models provide an interesting solution. However, for industrial applications, the size of their state space often makes them hard to handle. To reduce the amount of states, an abstraction function can be used, often combining state variable elimination and domain abstractions of the remaining variables. This paper complements previous results, based on domain abstraction for test generation, by adding a preliminary syntactic abstraction phase, based on variable elimination. We define a syntactic transformation that suppresses some variables from a B event model, in addition to a method that chooses relevant variables according to a test purpose. We propose two methods to compute an abstraction A of an initial model M. The first one computes A as a simulation of M, and the second one computes A as a bisimulation of M. The abstraction process produces a finite state system. We apply this abstraction computation to a Model Based Testing process.
Bué Pierre-Christophe
Julliand Jacques
Masson Pierre-Alain
Stouls Nicolas
No associations
LandOfFree
Syntactic Abstraction of B Models to Generate Tests 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 Syntactic Abstraction of B Models to Generate Tests, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Syntactic Abstraction of B Models to Generate Tests will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-713100