Learning-Based Testing for Reactive Systems Using Term Rewriting Technology - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Learning-Based Testing for Reactive Systems Using Term Rewriting Technology

(1) , (2, 1)
1
2

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.
Fichier principal
Vignette du fichier
978-3-642-24580-0_8_Chapter.pdf (523.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01583917 , version 1 (08-09-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

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⟩
25 View
86 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More