Learning regular sets from queries and counterexamples
Information and Computation
Learning from a consistently ignorant teacher
Journal of Computer and System Sciences
A new algorithm for the reduction of incompletely specified finite state machines
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
MAS — an interactive synthesizer to support behavioral modelling in UML
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
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)
Inference of Finite Automata Using Homing Sequences
Machine Learning: From Theory to Applications - Cooperative Research at Siemens and MIT
Integration Testing of Components Guided by Incremental State Machine Learning
TAIC-PART '06 Proceedings of the Testing: Academic & Industrial Conference on Practice And Research Techniques
Efficient test-based model generation for legacy reactive systems
HLDVT '04 Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International
Testing Security Properties of Protocol Implementations - a Machine Learning Based Approach
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Insights to Angluin's Learning
Electronic Notes in Theoretical Computer Science (ENTCS)
Monitoring architectural properties in dynamic component-based systems
CBSE'07 Proceedings of the 10th international conference on Component-based software engineering
On the correspondence between conformance testing and regular inference
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Inference and analysis of formal models of botnet command and control protocols
Proceedings of the 17th ACM conference on Computer and communications security
Angluin style finite state machine inference with non-optimal counterexamples
Proceedings of the First International Workshop on Model Inference In Testing
Reverse engineering ECUs of automotive components: a case study
Proceedings of the First International Workshop on Model Inference In Testing
The practical assessment of test sets with inductive inference techniques
TAIC PART'10 Proceedings of the 5th international academic and industrial conference on Testing - practice and research techniques
Automatic discovery of unspecified behaviors in automotive control software
TAIC PART'10 Proceedings of the 5th international academic and industrial conference on Testing - practice and research techniques
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
Incrementally discovering testable specifications from program executions
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
From ZULU to RERS: lessons learned in the ZULU challenge
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
On handling data in automata learning: considerations from the CONNECT perspective
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
Automata learning with automated alphabet abstraction refinement
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Iterative refinement of specification for component based embedded systems
Proceedings of the 2011 International Symposium on Software Testing and Analysis
MACE: model-inference-assisted concolic exploration for protocol and vulnerability discovery
SEC'11 Proceedings of the 20th USENIX conference on Security
Assessing test adequacy for black-box systems without specifications
ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Sigma*: symbolic learning of input-output specifications
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Empirical Software Engineering
| Hi-index | 0.00 |
Automata learning techniques are getting significant importance for their applications in a wide variety of software engineering problems, especially in the analysis and testing of complex systems. In recent studies, a previous learning approach [1] has been extended to synthesize Mealy machine models which are specifically tailored for I/O based systems. In this paper, we discuss the inference of Mealy machines and propose improvements that reduces the worst-time learning complexity of the existing algorithm. The gain over the complexity of the proposed algorithm has also been confirmed by experimentation on a large set of finite state machines.