Evaluation and comparison of inferred regular grammars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5278 LNAI, Issue , 2008, Pages 252-265

  Walkinshaw, Neil ^a   Bogdanov, Kirill ^a   Johnson, Ken ^a  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

Evaluation; FSM testing; Model based testing; Precision and recall; State merging

Indexed keywords

COMPUTATIONAL GRAMMARS; INFERENCE ENGINES; INFORMATION SERVICES; PRECISION ENGINEERING; RANDOM PROCESSES; SOFTWARE ENGINEERING; TESTING;

EVALUATION; FSM TESTING; MODEL-BASED TESTING; PRECISION AND RECALL; STATE-MERGING;

SOFTWARE TESTING;

EID: 56649098936     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88009-7_20     Document Type: Conference Paper

References (24)

1. Angluin, D., Smith. C.H.: Inductive inference: Theory and methods. Computing Surveys 15(3), 237-269 (1983)
2. Berg, T., Grinchtein, O., Jonsson, B., Leucker, M., Raffelt, H., Steffen, B.: On the correspondence between conformance testing and regular inference. In: Cerioli, M. (ed.) FASE 2005. LNGS, vol. 3442, pp. 175-189. Springer, Heidelberg (2005)
3. Bogdanov, K., Holcombe, M., Ipate, F., Seed, L., Vanak, S.: Testing methods for X-Machines: A review. Formal Aspects of Computer Science 18, 3-30 (2006)
4. Bongard, J., Lipson, H.: Active coevolutionary learning of deterministic finite automata. Journal of Machine Learning Research 6, 1651-1678 (2005)
5. Bradley, A.: The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern Recognition 30(7), 1145-1159 (1997)
6. Chow, T.: Testing Software Design Modelled by Finite State Machines. IEEE Transactions on Software Engineering 4(3), 178-187 (1978)
7. Davis, J., Goadrich, M.: The relationship between precision-recall and ROC curves. In: ICML. ACM International Conference Proceeding Series, vol. 148, pp. 233-240. ACM, New York (2006)
8. Dupont, P.: Regular grammatical inference from positive and negative samples by genetic search: the GIG method. In: Carrasco, R.C., Oncina, J. (eds.) 1CG1 1994. LNCS, vol. 862, pp. 236-245. Springer, Heidelberg (1994)
9. Dupont, P., Lambeau, B., Danias, C., van Lamsweerde, A.: The QSM algorithm and its application to software behavior model induction. Applied Artificial Intelligence 22, 77-115 (2008)
10. Dupont, P., Miclet, L., Vidal, E.: What is the search space of the regular inference? In: Carrasco, R.C., Oncina, J. (eds.) 1CG1 1994. LNCS, vol. 862, pp. 25-37. Springer, Heidelberg (1994)
11. Fonseca, C., Fleming, P.: An overview of evolutionary algorithms in multiobjective optimization. Evolutionary Computation 3(1), 1-16 (1995)
12. Gill, A.: Introduction to the Theory of Finite State Machines. McGraw-Hill, New York (1962)
13. Gold, E.: Language identification in the limit. Information and Control 10, 447-474 (1967)
14. Groce, A., Peled, D., Yannakakis, M.: Adaptive model checking. Logic Journal of the IGPL 14(5), 729-744 (2006)
15. Lang, K.: Random DFA's can be approximately learned from sparse uniform examples. In: COLT, pp. 45-52 (1992)
16. Lang, K., Pearlmutter, B., Price, R.,: Results of the Abbadingo One DFA learning competition and a new evidence-driven state merging algorithm. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol. 1433, pp. 1-12. Springer,' Heidelberg (1998)
17. Lee, D., Yannakakis, M.: Principles and Methods of Testing Finite State Machines - A Survey. Proceedings of the IEEE 84, 1090-1126 (1996)
18. Lo, D., Khoo, S.: QUARK: Empirical assessment of automaton-based specification miners. In: WORE, pp. 51-60. IEEE Computer Society, Los Alamitos (2006)
19. Oncina, J., Garcia, P.: Inferring regular languages in polynomial update time. In: Perez de la Blanca, N., Sanfeliu, A., Vidal, E. (eds.) Pattern Recognition and Image Analysis. Series in Machine Perception and Artificial Intelligence, vol. 1, pp. 49-61. World Scientific, Singapore (1992)
20. Parekh, R., Honavar, V.: Grammar Inference, Automata Induction, and Language Acquisition, ch. 29. Marcel Dekker, USA (2000)
21. Tomita, M.: Dynamic construction of finite-state automata horn examples using hill-climbing. In: Proceedings of the Fourth Annual Cognitive Science Conference, Ann Arbor, Mi, pp. 105-108 (1982)
22. Trakhtenbrot, B., Barzdin, Y.: Finite Automata, Behavior and Synthesis. North Holland, Amsterdam (1973)
23. Tu, K., Honavar, V.: Unsupervised learning of probabilistic context-free grammar using iterative biclustering. Technical Report 00000572, Dept. Computer Science, Iowa State University (May 2008)
24. van Rijsbergen, C.J.: Information Retrieval. Butterworth-Heineman, Newton (1979)