libalf: The automata learning framework

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

Volumn 6174 LNCS, Issue , 2010, Pages 360-364

  Bollig, Benedikt ^a   Katoen, Joost Pieter ^b   Kern, Carsten ^b   Leucker, Martin ^c   Neider, Daniel ^b   Piegdon, David R ^b  

^a CNRS   (France)

^b RWTH AACHEN UNIVERSITY   (Germany)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COUNTER AUTOMATA; DOMAIN SPECIFIC; LEARNING FRAMEWORKS; LEARNING TECHNIQUES; MODULAR DESIGNS; OPEN-SOURCE LIBRARIES; PLUG-AND-PLAY; TARGET MODEL;

AUTOMATA THEORY; COMPUTER AIDED ANALYSIS; FORMAL LANGUAGES; MODELS; PIPELINE PROCESSING SYSTEMS; ROBOTS; TRANSLATION (LANGUAGES);

LEARNING ALGORITHMS;

EID: 77954981307     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14295-6_32     Document Type: Conference Paper

References (10)

1. Oliveira, A.L., Silva, J.P.M.: Efficient Algorithms for the Inference of Minimum Size DFAs. Machine Learning 44(1/2), 93-119 (2001)
2. Groce, A., Peled, D., Yannakakis, M.: Adaptive model checking. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 357-370. Springer, Heidelberg (2002)
3. Habermehl, P., Vojnar, T.: Regular Model Checking Using Inference of Regular Languages. ENTCS 138(3), 21-36 (2005) (Pubitemid 41808218)
4. Giannakopoulou, D., Pasareanu, C.S.: Interface Generation and Compositional Verification in Java Pathfinder. In: Chechik, M., Wirsing, M. (eds.) FASE 2009. LNCS, vol. 5503, pp. 94-108. Springer, Heidelberg (2009)
5. Raffelt, H., Steffen, B., Berg, T., Margaria, T.: LearnLib: a framework for extrapolating behavioral models. STTT 11(5), 393-407 (2009)
6. Shahbaz, M.: Reverse Engineering Enhanced State Models of Black Box Software Components to Support Integration Testing. PhD thesis, Laboratoire Informat. de Grenoble (2008)
7. Bollig, B., Habermehl, P., Kern, C., Leucker, M.: Angluin-Style Learning of NFA. In: IJCAI 2009, pp. 1004-1009. AAAI Press, Menlo Park (2009)
8. Neider, D., Löding, C.: Learning Visibly One-Counter Automata in Polynomial Time. Technical Report AIB-2010-02, RWTH Aachen (January 2010)
9. Wulf, M.D., Doyen, L., Henzinger, T.A., Raskin, J.F.: Antichains: A new algorithm for checking universality of finite automata. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 17-30. Springer, Heidelberg (2006)
10. Bollig, B., Katoen, J.P., Kern, C., Leucker, M.: Learning Communicating Automata from MSCs. IEEE TSE (to appear)