Model-Based Testing Using Symbolic Animation and Machine Learning

We present in this paper a technique based on symbolic animation of models that aims at producing model-based tests. In order to guide the animation of the model, we rely on the use of a deterministic finite automaton (DFA) of the model that is built using a well-known machine learning algorithm, that considers a complex model as a black-box component, whose behavior is inferred. Since the DFA obtained in this way may be an over-approximation and, thus, admit traces that were not admitted on the original model, this abstraction is refined using counter-examples made of unfeasible traces. The computation of counter-examples is performed using a systematic coverage of the DFA states and transitions, producing test sequences that are replayed on the model, providing either test cases for offline testing, or counter-examples that aim at refining the abstraction.

[1]  Jan Tretmans,et al.  Conformance Testing with Labelled Transition Systems: Implementation Relations and Test Generation , 1996, Comput. Networks ISDN Syst..

[2]  Cliff B. Jones,et al.  Systematic software development using VDM (2. ed.) , 1990, Prentice Hall International Series in Computer Science.

[3]  Paul Benoit,et al.  Météor: A Successful Application of B in a Large Project , 1999, World Congress on Formal Methods.

[4]  Harold W. Thimbleby,et al.  The directed Chinese Postman Problem , 2003, Softw. Pract. Exp..

[5]  Ronald L. Rivest,et al.  Inference of finite automata using homing sequences , 1989, STOC '89.

[6]  J. R. Abrial,et al.  The B-Book: Mathematics , 1996 .

[7]  David Lugato,et al.  Automatic Test Generation with AGATHA , 2003, TACAS.

[8]  Umesh V. Vazirani,et al.  An Introduction to Computational Learning Theory , 1994 .

[9]  Kim G. Larsen,et al.  Automatic Abstraction Refinement for Timed Automata , 2007, FORMATS.

[10]  Bruno Legeard,et al.  LEIRIOS Test Generator: Automated Test Generation from B Models , 2007, B.

[11]  Olga Kouchnarenko,et al.  Finer Is Better: Abstraction Refinement for Rewriting Approximations , 2008, RTA.

[12]  Fabrice Bouquet,et al.  CLPS–B – A constraint solver to animate a B specification , 2004, International Journal on Software Tools for Technology Transfer.

[13]  Edmund M. Clarke,et al.  Counterexample-guided abstraction refinement , 2003, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings..

[14]  Frank Waters,et al.  The B Book , 1971 .

[15]  Boris Beizer,et al.  Black Box Testing: Techniques for Functional Testing of Software and Systems , 1996, IEEE Software.

[16]  Roland Groz,et al.  Inferring Mealy Machines , 2009, FM.

[17]  M. P. Vasilevskii Failure diagnosis of automata , 1973 .

[18]  J. R. Abrial,et al.  The B-Book: Programming , 1996 .

[19]  Tsun S. Chow,et al.  Testing Software Design Modeled by Finite-State Machines , 1978, IEEE Transactions on Software Engineering.

[20]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[21]  Michael J. Butler,et al.  ProTest: An Automatic Test Environment for B Specifications , 2004, MBT.

[22]  Denis Sabatier,et al.  The Use of the B Formal Method for the Design and the Validation of the Transaction Mechanism for Smart Card Applications , 2000, Formal Methods Syst. Des..

[23]  Natalia Sidorova,et al.  Data abstraction and constraint solving for conformance testing , 2005, 12th Asia-Pacific Software Engineering Conference (APSEC'05).

[24]  Cliff B. Jones,et al.  Systematic software development using VDM , 1986, Prentice Hall International Series in Computer Science.