%0 Conference Proceedings
%T Learning-Based Testing for Reactive Systems Using Term Rewriting Technology
%+ KTH Royal Institute of Technology [Stockholm] (KTH )
%A Meinke, Karl
%A Niu, Fei
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 23th International Conference on Testing Software and Systems (ICTSS)
%C Paris, France
%Y Burkhart Wolff
%Y Fatiha Zaïdi
%I Springer
%3 Testing Software and Systems
%V LNCS-7019
%P 97-114
%8 2011-11-07
%D 2011
%R 10.1007/978-3-642-24580-0_8
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01583917/document
%2 https://inria.hal.science/hal-01583917/file/978-3-642-24580-0_8_Chapter.pdf
%L hal-01583917
%U https://inria.hal.science/hal-01583917
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-ICTSS
%~ IFIP-LNCS-7019