Inferring network invariants automatically

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

Volumn 4130 LNAI, Issue , 2006, Pages 483-497

  Grinchtein, Olga ^a   Leucker, Martin ^b   Piterman, Nir ^c  

^a UPPSALA UNIVERSITY   (Sweden)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^c EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FINITE AUTOMATA; HEURISTIC METHODS; LEARNING ALGORITHMS; LEARNING SYSTEMS; PROBLEM SOLVING;

NETWORK INVARIANTS; PARAMETERIZED SYSTEMS; SAT SOLVERS; UNIFORM VERIFICATION;

COMPUTER NETWORKS;

EID: 33749541721     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814771_40     Document Type: Conference Paper

References (29)

1. [AK86] Krzysztof R. Apt and Dexter Kozen. Limits for automatic verification of finite-state concurrent systems. IPL, 22(6):307-309, 1986.
2. [AMN05] R. Alur, P. Madhusudan, and W. Nam. Symbolic compositional verification by learning assumptions. In 17th CAV, LNCS 3576, pages 548-562. 2005.
3. [Ang87] Dana Angluin. Learning regaular sets from queries and counterexamples. IC, 75:87-106, 1987.
4. [BF72] A. W. Biermann and J. A. Feldman. On the synthesis of finite-state machines from samples of their behaviour. IEEE TOC, 21:592-597, 1972.
5. [BJLS03] Therese Berg, Bengt Jonsson, Martin Leucker, and Mayank Saksena. Insights to Angluin's learning. TR 2003-039, Uppsala University, 2003.
6. th CAV, LNCS 3576, pages 534-547. 2005.
7. th Concur, LNCS 3170, pages 276-291. 2004.
8. th VMCAI, LNCS 3855, 126-141. 2006.
9. th CADE, LNCS 1831, pages 236-254, 2000.
10. [EN95] E.A. Emerson and K.S. Namjoshi. Reasoning about rings. In POPL, 1995.
11. [Gol78] E. M. Gold. Complexity of automaton identification from given data. IC, 37(3):302-320, 1978.
12. [HV05] Peter Habermehl and Tomás Vojnar. Regular model checking using inference of regular languages. ENTCS, 138(3):21-36, 2005.
13. th TACAS, LNCS 1785, 2000.
14. [KM95] R. P. Kurshan and K. L. McMillan. A structural induction theorem for processes. IC, 117(1):1-11, 1995.
15. [KP00] Y. Kesten and A. Pnueli. Control and data abstraction: The cornerstones of practical formal verification. STTT, 2(4):328-342, 2000.
16. [KPP05] Y. Kesten, N. Piterman, and A. Pnueli. Bridging the gap between fair simulation and trace inclusion. IC, 200(1):35-61, 2005.
17. 'h Concur, LNCS 2421, 2002.
18. [Lan92] Kevin J. Lang. Random dfa's can be approximately learned from sparse uniform examples. In COLT, pages 45-52, 1992.
19. th POPL, 1997.
20. +01] Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an efficient sat solver. In DAC, 530-535. ACM, 2001.
21. [OG92] J. Oncina and P. Garcia. Inferring regular languages in polynomial update time. In Pattern Recognition and Image Analysis, Series in Machine Perception and Al 1, pages 49-61. World Scientific, 1992.
22. [OS01] Arlindo L. Oliveira and João P. Marques Silva. Efficient algorithms for the inference of minimum size dfas. Machine Learning, 44(1/2):93-119, 2001.
23. [PO98] Jorge M. Pena and Arlindo L. Oliveira, A new algorithm for the reduction of incompletely specified finite state machines. In ICCAD, 482-489, 1998.
24. [PS96] A. Pnueli and E. Shahar. A platform for combining deductive with algorithmic verification. In 8th CAV, pages 184-195, 1996.
25. th CAV, LNCS 1855, pages 328-343. Springer Verlag, 2000.
26. [VSVA04a] A. Vardhan, K. Sen, M. Viswanathan, and G. Agha. Actively learning to verify safety for fifo automata. In FSTTCS, LNCS 3328, 494-505. 2004.
27. [VSVA04b] A. Vardhan, K. Sen, M. Viswanathan, and G. Agha. Learning to verify safety properties. In ICFEM, LNCS 3308, 274-289, 2004.
28. [VSVA05] A. Vardhan, K. Sen, M. Viswanathan, and G. Agha. Using language inference to verify omega-regular properties. In TACAS, LNCS 3440, 2005.
29. [WL89] P. Wolper and V. Lovinfosse, Verifying properties of large sets of processes with network invariants. In Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems, LNCS 407, 1989.