Handbook of logic in computer science (vol. 1)
FORTE XII / PSTV XIX '99 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XII) and Protocol Specification, Testing and Verification (PSTV XIX)
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
Automated black-box testing of functional correctness using function approximation
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
Variant Narrowing and Equational Unification
Electronic Notes in Theoretical Computer Science (ENTCS)
Symbolic model checking of infinite-state systems using narrowing
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Dynamic testing via automata learning
HVC'07 Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
CGE: a sequential learning algorithm for mealy automata
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Increasing functional coverage by inductive testing: a case study
ICTSS'10 Proceedings of the 22nd IFIP WG 6.1 international conference on Testing software and systems
A learning-based approach to unit testing of numerical software
ICTSS'10 Proceedings of the 22nd IFIP WG 6.1 international conference on Testing software and systems
Incremental learning-based testing for reactive systems
TAP'11 Proceedings of the 5th international conference on Tests and proofs
Network security via reverse engineering of TCP code: vulnerability analysis and proposed solutions
IEEE Network: The Magazine of Global Internetworking
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
An incremental learning algorithm for extended mealy automata
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
| Hi-index | 0.01 |
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 learningbased testing of reactive systems. We compare the performance of this LBT architecture against random testing using a case study.