Random DFA's can be approximately learned from sparse uniform examples
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Inductive Inference: Theory and Methods
ACM Computing Surveys (CSUR)
Information Retrieval
ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
Regular Grammatical Inference from Positive and Negative Samples by Genetic Search: the GIG Method
ICGI '94 Proceedings of the Second International Colloquium on Grammatical Inference and Applications
What Is the Search Space of the Regular Inference?
ICGI '94 Proceedings of the Second International Colloquium on Grammatical Inference and Applications
Testing methods for X-machines: a review
Formal Aspects of Computing
The relationship between Precision-Recall and ROC curves
ICML '06 Proceedings of the 23rd international conference on Machine learning
QUARK: Empirical Assessment of Automaton-based Specification Miners
WCRE '06 Proceedings of the 13th Working Conference on Reverse Engineering
Active Coevolutionary Learning of Deterministic Finite Automata
The Journal of Machine Learning Research
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
An overview of evolutionary algorithms in multiobjective optimization
Evolutionary Computation
THE QSM ALGORITHM AND ITS APPLICATION TO SOFTWARE BEHAVIOR MODEL INDUCTION
Applied Artificial Intelligence
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
Iterative Refinement of Reverse-Engineered Models by Model-Based Testing
FM '09 Proceedings of the 2nd World Congress on Formal Methods
A framework for the competitive evaluation of model inference techniques
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
Automated Comparison of State-Based Software Models in Terms of Their Language and Structure
ACM Transactions on Software Engineering and Methodology (TOSEM)
Empirical Software Engineering
| Hi-index | 0.00 |
The accuracy of an inferred grammar is commonly computed by measuring the percentage of sequences that are correctly classified from a random sample of sequences produced by the target grammar. This approach is problematic because (a) it is unlikely that a random sample of sequences will adequately test the grammar and (b) the use of a single probability value provides little insight into the extent to which a grammar is (in-)accurate. This paper addresses these two problems by proposing the use of established model-based testing techniques from the field of software engineering to systematically generate test sets, along with the use of the Precision and Recall measure from the field of information retrieval to concisely represent the accuracy of the inferred machine.