Inferring compact models of communication protocol entities

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

Volumn 6415 LNCS, Issue PART 1, 2010, Pages 658-672

  Bohlin, Therese ^a   Jonsson, Bengt ^a   Soleimanifard, Siavash ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION PROTOCOLS; COMPACT MODEL; DECISION TREE GENERATION; DYNAMIC BEHAVIORS; EXTERNAL BEHAVIOR; FINITE STATE MACHINES; INTERNAL STATE; MOBILE LOCATION; MODEL BASED APPROACH; PROTOCOL MODEL; REGULAR INFERENCE; STATE MACHINE; STATE VARIABLES; USER GUIDANCE; VERIFICATION AND VALIDATION;

AUTOMATA THEORY; COMMUNICATION; CONTOUR FOLLOWERS; DECISION TREES; FORMAL METHODS; SPECIFICATIONS;

BEHAVIORAL RESEARCH;

EID: 78650291305     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16558-0_53     Document Type: Conference Paper

References (30)

1. Ammons, G., Bodik, R., Larus, J.: Mining specifications. In: Proc. 29th ACM Symp. on Principles of Programming Languages, pp. 4-16 (2002)
2. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2), 87-106 (1987)
3. Armstrong, J.: Programming ERLANG: software for a concurrent world. In: The Pragmatic Programmers (2007)
4. Ball, T., Rajamani, S.: The SLAM project: Debugging system software via static analysis. In: Proc. 29th ACM Symp. on Principles of Programming Languages, pp. 1-3 (2002)
5. Berg, T., Jonsson, B., Raffelt, H.: Regular inference for state machines with parameters. In: Baresi, L., Heckel, R. (eds.) FASE 2006. LNCS, vol. 3922, pp. 107-121. Springer, Heidelberg (2006)
6. Berg, T., Jonsson, B., Raffelt, H.: Regular inference for state machines using domains with equality tests. In: Fiadeiro, J.L., Inverardi, P. (eds.) FASE 2008. LNCS, vol. 4961, pp. 317-331. Springer, Heidelberg (2008)
7. Blom, J., Jonsson, B.: Automated test generation for industrial erlang applications. In: Proc. 2003 ACM SIGPLAN workshop on Erlang, Uppsala, Sweden, pp. 8-14 (August 2003)
8. Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.): Model-Based Testing of Reactive Systems. LNCS, vol. 3472. Springer, Heidelberg (2005)
9. Chow, T.S.: Testing software design modeled by finite-state machines. IEEE Trans. on Software Engineering 4(3), 178-187 (1978)
10. Cobleigh, J., Giannakopoulou, D., Pasareanu, C.: Learning assumptions for compositional verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 331-346. Springer, Heidelberg (2003)
11. Fowler, M.: UML Distilled - A Bried Guide to the Standard Object Modeling Language, 3rd edn. Addison-Wesley, Reading (2008)
12. Gold, E.M.: Language identification in the limit. Information and Control 10(5), 447-474 (1967)
13. 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)
14. Groz, R., Li, K., Petrenko, A., Shahbaz, M.: Modular system verification by inference, testing and reachability analysis. In: Suzuki, K., Higashino, T., Ulrich, A., Hasegawa, T. (eds.) TestCom/FATES 2008. LNCS, vol. 5047, pp. 216-233. Springer, Heidelberg (2008)
15. Hagerer, A., Hungar, H., Niese, O., Steffen, B.: Model generation by moderated regular extrapolation. In: Kutsche, R.-D., Weber, H. (eds.) FASE 2002. LNCS, vol. 2306, pp. 80-95. Springer, Heidelberg (2002)
16. Henzinger, T., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: Proc. 29th ACM Symp. on Principles of Programming Languages, pp. 58-70 (2002)
17. Hungar, H., Niese, O., Steffen, B.: Domain-specific optimization in automata learning. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 315- 327. Springer, Heidelberg (2003)
18. Kearns, M., Vazirani, U.: An Introduction to Computational Learning Theory. MIT Press, Cambridge (1994)
19. Li, K., Groz, R., Shahbaz, M.: Integration testing of distributed components based on learning parameterized I/O models. In. In: Najm, E., Pradat-Peyre, J.-F., Donzeau-Gouge, V.V. (eds.) FORTE 2006. LNCS, vol. 4229, pp. 436-450. Springer, Heidelberg (2006)
20. Mariani, L., Pezzè, M.: Dynamic detection of COTS components incompatibility. IEEE Software 24(5), 76-85 (2007) (Pubitemid 47455998)
21. Mitchell, T.M.: Machine Learning. McGraw-Hill, New York (1997)
22. Niese, O.: An integrated approach to testing complex systems. PhD thesis, Dortmund University (2003)
23. Peled, D., Vardi, M.Y., Yannakakis, M.: Black box checking. In: FORTE/PSTV 1999, Beijing, China, pp. 225-240. Kluwer, Dordrecht (1999)
24. Petrenko, A., Boroday, S., Groz, R.: Confirming configurations in EFSM testing. IEEE Trans. on Software Engineering 30(1), 29-42 (2004)
25. Quinlan, J.: Induction of decision trees. Machine Learning 1(1), 81-106 (1986)
26. Raffelt, H., Steffen, B., Berg, T.: Learnlib: a library for automata learning and experimentation. In: FMICS 2005, New York, NY, USA, pp. 62-71 (2005)
27. Rivest, R., Schapire, R.: Inference of finite automata using homing sequences. Information and Computation 103, 299-347 (1993)
28. Shahbaz, M., Li, K., Groz, R.: Learning and integration of parameterized components through testing. In: Petrenko, A., Veanes, M., Tretmans, J., Grieskamp, W. (eds.) TestCom/FATES 2007. LNCS, vol. 4581, pp. 319-334. Springer, Heidelberg (2007)
29. Vasilevski, M.P.: Failure diagnosis of automata. Cybernetic 9(4), 653-665 (1973)
30. Witten, I.H., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann, San Francisco (1999)