Learning meets verification

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

Volumn 4709 LNCS, Issue , 2007, Pages 127-151

  Leucker, Martin ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LEARNING SYSTEMS; VERIFICATION;

ANGLUIN'S ALGORITHMS; LEARNING AUTOMATA;

AUTOMATA THEORY;

EID: 38549083100     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74792-5_6     Document Type: Conference Paper

References (60)

1. Abdulla, P.A., Jonsson, B., Nilsson, M., d'Orso, J.: Algorithmic improvements in regular model checking. In: Hunt, Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 236-248. Springer, Heidelberg (2003)
2. Abdulla, P.A., Jonsson, B., Nilsson, M., Saksena, M.: A survey of regular model checking. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 35-48. Springer, Heidelberg (2004)
3. Alur, R., Cerný, P., Madhusudan, P., Nam, W.: Synthesis of interface specifications for java classes. In: Palsberg, J., Abadi, M. (eds.) POPL, pp. 98-109. ACM Press, New York (2005)
4. Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183-235 (1994)
5. Alur, R., Madhusudan, P., Nam, W.: Symbolic compositional verification by learning assumptions. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 548-562. Springer, Heidelberg (2005)
6. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2), 87-106 (1987)
7. Apt, K.R., Kozen, D.: Limits for automatic verification of finite-state concurrent systems. Inf. Process. Lett. 22(6), 307-309 (1986)
8. Balcázar, J.L., Díaz, J., Gavaldá, R.: Algorithms for learning finite automata from queries: A unified view. In: Advances in Algorithms, Languages, and Complexity, pp. 53-72. Kluwer, Dordrecht (1997)
9. Baresi, L., Heckel, R. (eds.): FASE 2006 and ETAPS 2006. LNCS, vol. 3922, pp. 27-28. Springer, Heidelberg (2006)
10. 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. LNCS, vol. 3442, pp. 175-189. Springer, Heidelberg (2005)
11. Berg, T., Jonsson, B., Leucker, M., Saksena, M.: Insights to Angluin's learning. In: Proceedings of the International Workshop on Software Verification and Validation (SVV 2003). Electronic Notes in Theoretical Computer Science, vol. 118, pp. 3-18 (December 2003)
12. Berg, T., Jonsson, B., Raffelt, H.: Regular inference for state machines with parameters. In: Baresi and Heckel [9], pp. 107-121
13. Berg, T., Raffelt, H.: Model checking. In: Broy et al. [16]
14. Biermann, A.W., Feldman, J.A.: On the synthesis of finite-state machines from samples of their behaviour. IEEE Transactions on Computers 21, 592-597 (1972)
15. Bollig, B., Katoen, J.-P., Kern, C., Leucker, M.: Replaying play in and play out: Synthesis of design models from scenarios by learning. In: Grumberg, O., Huth, M. (eds.) ETAPS 2007 and TACAS 2007. LNCS, vol. 4424, Springer, Heidelberg (2007)
16. Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.): Model-Based Testing of Reactive Systems. LNCS, vol. 3472. Springer, Heidelberg (2005)
17. Bryant, R.E.: Symbolic manipulation of boolean functions using a graphical representation. In: Proceedings of the 22nd ACM/IEEE Design Automation Conference, pp. 688-694. IEEE Computer Society Press, Los Alamitos, CA (1985)
18. Chaki, S., Clarke, E.M., Sinha, N., Thati, P.: Automated assume-guarrantee reasoning for simulation conformance. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 534-547. Springer, Heidelberg (2005)
19. Chow, T.S.: Testing software design modeled by finite-state machines. IEEE Trans. on Software Engineering 4(3), 178-187 (1978) (Special collection based on COMPSAC)
20. Cimatti, A., Clarke, E., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV Version 2: An OpenSource Tool for Symbolic Model Checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, Springer, Heidelberg (2002)
21. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge, Massachusetts (1999)
22. Clarke, E.M., Talupur, M., Touili, T., Veith, H.: Verification by network decomposition. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 276-291. Springer, Heidelberg (2004)
23. Clarke, E.M., Talupur, M., Veith, H.: Environment abstraction for parameterized verification. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 126-141. Springer, Heidelberg (2005)
24. Cobleigh, J.M., Giannakopoulou, D., Pasareanu, C.S.: Learning assumptions for compositional verification. In: Garavel, H., Hatcliff, J. (eds.) ETAPS 2003 and TACAS 2003. LNCS, vol. 2619, pp. 331-346. Springer, Heidelberg (2003)
25. Dimovski, A., Lazic, R.: Assume-guarantee software verification based on game semantics. In: Liu, Z., He, J. (eds.) ICFEM 2006. LNCS, vol. 4260, pp. 529-548. Springer, Heidelberg (2006)
26. Drewes, F., Högberg, J.: Learning a regular tree language from a teacher. In: Esik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 279-291. Springer, Heidelberg (2003)
27. D'Souza, D.: A logical characterisation of event clock automata. International Journal of Foundations of Computer Science (IJFCS) 14(4), 625-639 (2003)
28. Emerson, E., Kahlon, V.: Reducing model checking of the many to the few. In: McAllester, D. (ed.) CADE 2000. LNCS, vol. 1831, pp. 236-254. Springer, Heidelberg (2000)
29. th ACM Symp. on Principles of Programming Languages (1995)
30. Gold, E.M.: Language identification in the limit. Information and Control 10, 447-474 (1967)
31. Gold, E.M.: Complexity of automaton identification from given data. Information and Control 37(3), 302-320 (1978)
32. Grinchtein, O., Jonsson, B., Leucker, M.: Inference of timed transition systems. In: 6th International Workshop on Verification of Infinite-State Systems. Electronic Notes in Theoretical Computer Science, vol. 138/4, Elsevier Science Publishers, Amsterdam (2004)
33. Grinchtein, O., Jonsson, B., Leucker, M.: Learning of event-recording automata. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol. 3253, Springer, Heidelberg (2004)
34. Grinchtein, O., Jonsson, B., Pettersson, P.: Inference of event-recording automata using timed decision trees. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 435-449. Springer, Heidelberg (2006)
35. Grinchtein, O., Leucker, M., Piterman, N.: Inferring network invariants automatically. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, Springer, Heidelberg (2006)
36. Groce, A., Peled, D., Yannakakis, M.: Adaptive model checking. In: Katoen, J.-P., Stevens, P. (eds.) ETAPS 2002 and TACAS 2002. LNCS, vol. 2280, p. 357. Springer, Heidelberg (2002)
37. Habermehl, P., Vojnar, T.: Regular model checking using inference of regular languages. Electr. Notes Theor. Comput. Sci. 138(3), 21-36 (2005)
38. th Int. Conf. on Computer Aided Verification (2003)
39. Jonsson, B., Nilsson, M.: Transitive closures of regular relations for verifying infinite-state systems. In: Schwartzbach, M.I., Graf, S. (eds.) ETAPS 2000 and TACAS 2000. LNCS, vol. 1785, Springer, Heidelberg (2000)
40. Kesten, Y., Piterman, N., Pnueli, A.: Bridging the gap between fair simulation and trace inclusion. Information and Computation 200(1), 35-61 (2005)
41. Kesten, Y., Pnueli, A.: Control and data abstraction: The cornerstones of practical formal verification. Software Tools for Technology Transfer 2(4), 328-342 (2000)
42. Kesten, Y., Pnueli, A., Shahar, E., Zuck, L.: Network invariants in action. In: Brim, L., Jančar, P., Křetínský, M., Kueera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, Springer, Heidelberg (2002)
43. Kurshan, R.P., McMillan, K.L.: A structural induction theorem for processes. Information and Computation 117(1), 1-11 (1995)
44. Lang, K.J.: Random dfa's can be approximately learned from sparse uniform examples. In: COLT, pp. 45-52 (1992)
45. Maler, O., Pnueli, A.: On the learnability of infinitary regular sets, Esprit Basic Reasearch Action No 3096 (1991)
46. Namjoshi, K.S., Trefler, R.J.: On the competeness of compositional reasoning. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 139-153. Springer, Heidelberg (2000)
47. Oliveira, A.L., Silva, J.P.M.: Efficient algorithms for the inference of minimum size dfas. Machine Learning 44(1/2), 93-119 (2001)
48. Oncina, J., Garcia, P.: Inferring regular languages in polynomial update time. In: de la Blanca, N.P., 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)
49. Peled, D., Vardi, M.Y., Yannakakis, M.: Black box checking. In: Wu, J., Chanson, S.T., Gao, Q. (eds.) Formal Methods for Protocol Engineering and Distributed Systems, FORTE/PSTV, pp. 225-240. Kluwer, Beijing, China (1999)
50. Pena, J.M., Oliveira, A.L.: A new algorithm for the reduction of incompletely specified finite state machines, In: ICCAD, pp. 482-489 (1998)
51. Pnueli, A., Shahar, E.: Liveness and acceleration in parameterized verification. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 328-343. Springer, Heidelberg (2000)
52. Raffelt, H., Steffen, B.: Learnlib: A library for automata learning and experimentation. In: Baresi and Heckel [9], pp. 377-380
53. Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 4, vol. B, pp. 133-191. Elsevier Science Publishers B. V, Amsterdam (1990)
54. Trakhtenbrot, B., Barzdin, J.: Finite automata: behaviour and synthesis. North-Holland, Amsterdam (1973)
55. Vardhan, A., Sen, K., Viswanathan, M., Agha, G.: Actively learning to verify safety for fifo automata. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 494-505. Springer, Heidelberg (2004)
56. Vardhan, A., Sen, K., Viswanathan, M., Agha, G.: Learning to verify safety properties. In: Davies, J., Schulte, W., Barnett, M. (eds.) ICFEM 2004. LNCS, vol. 3308, pp. 274-289. Springer, Heidelberg (2004)
57. Vardhan, A., Sen, K., Viswanathan, M., Agha, G.: Using language inference to verify omega-regular properties. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 45-60. Springer, Heidelberg (2005)
58. Vardhan, A., Viswanathan, M.: Learning to verify branching time properties. In: Redmiles, D.F., Ellman, T., Zisman, A. (eds.) ASE, pp. 325-328. ACM, New York (2005)
59. Vasilevski, M.P.: Failure diagnosis of automata. Cybernetic 9(4), 653-665 (1973)
60. Wolper, P., Lovinfosse, V.: Verifying properties of large sets of processes with network invariants. In: Sifakis, J. (ed.) Automatic Verification Methods for Finite State Systems. LNCS, vol. 407, pp. 68-80. Springer, Heidelberg (1990)