Learning-Based Testing for Reactive Systems Using Term Rewriting Technology

Abstract : 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.
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/hal-01583917
Contributor : Hal Ifip <>
Submitted on : Friday, September 8, 2017 - 10:05:27 AM
Last modification on : Friday, September 8, 2017 - 10:08:39 AM

File

978-3-642-24580-0_8_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Karl Meinke, Fei Niu. Learning-Based Testing for Reactive Systems Using Term Rewriting Technology. 23th International Conference on Testing Software and Systems (ICTSS), Nov 2011, Paris, France. pp.97-114, ⟨10.1007/978-3-642-24580-0_8⟩. ⟨hal-01583917⟩

Share

Metrics

Record views

44

Files downloads

109