DocumentCode
2302599
Title
Towards Search-Based Testing for Event-B Models
Author
Stefanescu, Alin ; Ipate, Florentin ; Lefticaru, Raluca ; Tudose, Cristina
Author_Institution
Dept. of Comput. Sci., Univ. of Pitesti, Pitesti, Romania
fYear
2011
fDate
21-25 March 2011
Firstpage
194
Lastpage
197
Abstract
This position paper discusses the challenges and opportunities of applying search-based techniques to a formal environment of abstract state machines defined using a language called Event-B. Event-B is based on a formal abstract machine notation that has a mature tool support and gets continuous feedback from industry. Although search-based techniques recently developed for extended finite state machines may be adapted to this context, new challenges such as implicit states, non-determinism, non-numerical data types and hierarchical models are still to be solved for test data generation for Event-B models.
Keywords
finite state machines; program testing; programming languages; Event-B language; abstract state machines; formal abstract machine notation; search-based technique; search-based testing; test data generation; Adaptation models; Computational modeling; Context modeling; Data models; Software; Testing; Unified modeling language; Abstract state machines; Event-B; model-based testing; search-based software testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Software Testing, Verification and Validation Workshops (ICSTW), 2011 IEEE Fourth International Conference on
Conference_Location
Berlin
Print_ISBN
978-1-4577-0019-4
Electronic_ISBN
978-0-7695-4345-1
Type
conf
DOI
10.1109/ICSTW.2011.41
Filename
5954409
Link To Document