Loading...
Please wait, while we are loading the content...
Similar Documents
Tri-Modal Under-Approximation for Test Generation
| Content Provider | Hyper Articles en Ligne (HAL) |
|---|---|
| Author | Bride, Hadrien Julliand, Jacques Masson, Pierre-Alain |
| Copyright Year | 2015 |
| Abstract | This paper presents a method for under-approximating behavioural models with the guarantee thatthe abstract paths can be instantiated as executions of models. This allows a model-based testing approach to operate on an abstraction of infinite or very large behavioural model. We characterize the abstract transitions as may, must+ or must-. This allows us to benefit from Thomas Ball’s result that anyabstract sequence in the shape of must-*.may.must+* (a Ballchain) can be instantiated as a sequenceof connected concrete transitions. We adapt Ball’s work aiming at abstracting C programs to the case of event systems, where the instantiated Ball chains might not be reachable from a model’s initial state.We propose as a solution to this problem to symbolically explore the set of states reachable after a finitenumber of steps, to identify the Ball chains that start in anyof these states. By keeping track of thepaths that lead to these starting states, we are able to instantiate with certainty the sequences made ofthe reached Ball chains with their prefix. This method improves the usual methods that often look for instantiations even though they don’t exist for some sequences. Finally we show by means of preliminary experimental results that, despite the complexity of symbolic exploration, the method is able to reachmany Ball chains within a small number of exploration steps |
| Related Links | https://hal.science/hal-03020531/file/bjm15%3Aip-author.pdf |
| Conference Proceedings | Annual Symposium on Applied Computing |
| Language | English |
| Publisher | HAL CCSD |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Conference Proceedings |
| Subject | Computer Science |
