Regular inference for state machines with parameters

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

Volumn 3922 LNCS, Issue , 2006, Pages 107-121

  Berg, Therese ^a   Jonsson, Bengt ^a   Raffelt, Harald ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTER SOFTWARE; MATHEMATICAL MODELS; NETWORK PROTOCOLS;

EQUIVALENCE CLASS; PARTITIONING; STATE MACHINE MODELS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 33745793169     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11693017_10     Document Type: Conference Paper

References (23)

1. Broy, M., Jonsson, B., Katoen, J.P., Leucker, M., Pretschner, A., eds.: Model-Based Testing of Reactive Systems. Volume 3472 of LNCS. Springer Verlag (2004)
2. th ACM Symp. on Principles of Programming Languages. (2002) 1-3
3. Corbett, J., Dwyer, M., Hatcliff, J., Laubach, S., Pasareanu, C., Robby, Zheng, H.: Bandera: Extracting finite-state models from java source code. In: Proc. 22nd Int. Conf. on Software Engineering. (2000)
4. th ACM Symp. on Principles of Programming Languages. (2002) 58-70
5. th Int. SPIN Workshop, Volume 1885 of LNCS., Springer Verlag (2000) 131-147
6. Hagerer, A., Hungar, H., Niese, O., Stellen, B.: Model generation by moderated regular extrapolation. In: Proc. FASE '02. Volume 2306 of LNCS., Springer Verlag (2002) 80-95
7. th Int. Conf. on Computer Aided Verification. (2003)
8. Groce, A., Peled, D., Yannakakis, M.: Adaptive model checking. In: Proc. TACAS '02. Volume 2280 of LNCS., Springer Verlag (2002) 357-370
9. Peled, D., Vardi, M.Y., Yannakakis, M.: Black box checking. In: FORTE/PSTV, Kluwer (1999) 225-240
10. th ACM Symp. on Principles of Programming Languages. (2002) 4-16
11. Cobleigh, J., Giannakopoulou, D., Pasareanu, C.: Learning assumptions for compositional verification. In: Proc. TACAS '03. Volume 2619 of LNCS., Springer Verlag (2003) 331-346
12. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75 (1987) 87-106
13. Balcázar, J., Daz, J., Gavaldá, R.: Algorithms for learning finite automata from queries: A unified view. In: Advances in Algorithms, Languages, and Complexity. Kluwer (1997) 53-72
14. Oupont, P.: Incremental regular inference. In: ICGI. Volume 1147 of LNCS., Springer (1996) 222-237
15. Gold, E.M.: Language identification in the limit. Information and Control 10 (1967) 447-474
16. Kearns, M., Vazirani, U.: An Introduction to Computational Learning Theory. MIT Press (1994)
17. Rivest, R., Schapire, R.: Inference of finite automata using homing sequences. Information and Computation 103 (1993) 299-347
18. Trakhtenbrot, B., Barzdin, J.: Finite automata: behaviour and synthesis. North-Holland (1973)
19. Raffelt, H., Steffen, B., Berg, T.: Learnlib: a library for automata learning and experimentation. In: FMICS '05, ACM Press (2005) 62-71
20. Gold, E.M.: Complexity of automaton identification from given data. Information and Control 37 (1978) 302-320
21. Blom, J., Jonsson, B.: Automated test generation for industrial erlang applications. In: Proc. 2003 ACM SIGPLAN workshop on Erlang, Uppsala, Sweden (2003) 8-14
22. Garavel, H., Lang, F., Mateescu, R.: An overview of cadp 2001 (2002) Newsletter.
23. Steffen, B., Margaria, T., Raffelt, H., Niese, O.: Efficient test-based model generation of legacy systems. In: HLDVT'04, IEEE Computer Society Press (2004) 95-100