A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Learning-Based Testing for Reactive Systems Using Term Rewriting Technology
[chapter]
2011
Lecture Notes in Computer Science
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
doi:10.1007/978-3-642-24580-0_8
fatcat:gipjvz55yzd2xb37ug4pwvjpmu