Learning-Based Testing for Reactive Systems using Term Rewriting Technology
2011 (English)In: Proceedings of the 22nd IFIP International Conference on Testing Software and Systems, Paris, France, November 7-9, 2011 / [ed] B. Wolff and F. Zaidi, Berlin, Heidelberg: Springer , 2011, 97-114 p.Conference paper (Refereed)
We show how the paradigm of learning-based testing (LBT) can be applied to automate specification-based black-box testing of reactive systems using term rewriting technology. A general model for a reactive system can be given by an extended Mealy automata (EMA) over an abstract data type (ADT).A finite state EMA over an ADT can be efficiently learned in polynomial time using the CGE regular inference algorithm, which builds a compact representation as a complete term rewriting system. We show how this rewriting system can be used to model check the learned automaton against a temporal logic specification by means of narrowing. Combining CGE learning with a narrowing model checker we obtain a new and general architecture for learning-based testing of reactive systems. We compare the performance of this LBT architecture against random testing using a case study.
Place, publisher, year, edition, pages
Berlin, Heidelberg: Springer , 2011. 97-114 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 7019
Software testing, Model checking, Term rewriting, Symbolic computation, Machine learning
IdentifiersURN: urn:nbn:se:kth:diva-40871DOI: 10.1007/978-3-642-24580-0_8ISI: 000307927100008ScopusID: 2-s2.0-81255165659OAI: oai:DiVA.org:kth-40871DiVA: diva2:442577
23rd IFIP International Conference on Testing Software and Systems
The final publication is available at www.springerlink.com QC 201109302011-09-302011-09-212013-04-19Bibliographically approved