Learning to verify safety properties

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

Volumn 3308, Issue , 2004, Pages 274-289

  Vardhan, Abhay ^a   Sen, Koushik ^a   Viswanathan, Mahesh ^a   Agha, Gul ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; ITERATIVE METHODS; LEARNING SYSTEMS; LOGIC CIRCUITS; SAFETY ENGINEERING;

CASE-STUDIES; FIFO CHANNELS; INFINITE STATE SYSTEMS; LANGUAGE LEARNING; MACHINE LEARNING TECHNIQUES; SAFETY PROPERTY; SAMPLE SETS;

LEARNING ALGORITHMS;

EID: 35048896042     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30482-1_26     Document Type: Article

References (27)

1. A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili, "Regular model checking," in Proceedings of the 12th International Conference on Computer-Aided Verification (CAV'00), E. A. Emerson and A. P. Sistla, Eds. 2000, vol. 1855 of LNCS, pp. 403-418, Springer.
2. J. Oncina and P. Garcia, "Inferring regular languages in polynomial update time," in Pattern Recognition and Image Analysis, vol. 1 of Series in Machine Perception and Artificial Intelligence, pp. 49-61. World Scientific, Singapore, 1992.
3. P. Dupont, "Incremental regular inference.," in Proceedings of the 3rd International Colloquium on Grammatical Inference (ICGI-96): Learning Syntax from Sentences, Berlin, September 1996, vol. 1147 of LNAI, pp. 222-237, Springer.
4. Abhay Vardhan, Koushik Sen, Mahesh Viswanathan, and Gul Agha, "Learning to verify safety properties," Tech. Rep. UIUCDCS-R-2004-2445, http://osl.cs.uiuc.edu/docs/sub2004vardhan/cfsmLearn.pdf, University of Illinois, 2004.
5. John E. Hopcroft, Rajeev Motwani, Rotwani, and Jeffrey D. Ullman, Introduction to Automata Theory, Languages and Computability, Addison-Wesley Longman Publishing Co. Inc., 2000.
6. J. Berstel, Transductions and Context-Free-Languages, B.G. Teubner, Stuttgart, 1979.
7. D. Angluin, "Learning regular sets from queries and counterexamples," Inform. Comput., vol. 75, no. 2, pp. 87-106, Nov. 1987.
8. E. M. Gold, "Language identification in the limit," Inform. Control, vol. 10, pp. 447-474, 1967.
9. A. Finkel, S. Purushothaman Iyer, and G. Sutre, "Well-abstracted transition systems: Application to FIFO automata," Information and Computation, vol. 181, no. 1, pp. 1-31, 2003.
10. LEVER,"Learning to verify tool,"http://osl.cs.uiuc.edu/∼vardhan/lever.html, 2004.
11. Anders Møller, "http://www.brics.dk/∼amoeller/automaton/," 2004.
12. A. S. Tanenbaum, Computer Networks, 2nd Ed., Prentice-Hall, Englewood Cliffs, NJ, 1989.
13. Marcus Nilsson, "http://www.regulalrmodelchecking.com," 2004.
14. P. A. Abdulla, B. Jonsson, M. Nilsson, and J. d'Orso, "Algorithmic improvements in regular model checking," in Computer-Aided Verification (CAV'03). 2003, vol. 2725 of LNCS, pp. 236-248, Springer.
15. B. Boigelot, Symbolic Methods for Exploring Infinite State Spaces, Ph.D. thesis, Collection des Publications de la Faculté des Sciences Appliquées de l'Université de Liége, 1999.
16. A. Bouajjani and P. Habermehl, "Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations," Theoretical Computer Science, vol. 221, no. 1-2, pp. 211-250, June 1999.
17. T. Touili, "Regular model checking using widening techniques," in ENTCS. 2001, vol. 50, Elsevier.
18. T. Bultan, Automated symbolic analysis of reactive systems, Ph.D. thesis, Dept. of Computer Science, University of Maryland, College Park, Md., 1998.
19. C. Bartzis and T. Bultan, "Widening arithmetic automata," in Computer Aided Verification'04 (to appear), 2004.
20. D. Peled, M. Y. Vardi, and M. Yannakakis, "Black box checking," in FORTE/PSTV, Beijing, China, 1999.
21. A. Groce, D. Peled, and M. Yannakakis, "Adaptive model checking," in Tools and Algorithms for the Construction and Analysis of Systems (TACAS'02), 2002, vol. 2280 of LNCS, pp. 357-371.
22. J. M. Cobleigh, D. Giannakopoulou, and C. S. Pasareanu, "Learning assumptions for compositional verification," in Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2003, pp. 331-346.
23. B. Boigelot and P. Godefroid, "Automatic synthesis of specifications from the dynamic observation of reactive programs," in Tools and Algorithms for the Construction and Analysis of Systems, E. Brinksma, Ed., Enschede, The Netherlands, 1997, pp. 321-334, Springer Verlag, LNCS 1217.
24. Glenn Ammons, Rastislav Bodík, and James R. Larus, "Mining specifications," ACM SIGPLAN Notices, vol. 37, no. 1, pp. 4-16, Jan. 2002.
25. S. Edelkamp, A. Lafuente, and S. Leue, "Protocol verification with heuristic search," in AAAI Symposium on Model-based Validation of Intelligence, 2001.
26. M. D. Ernst, J. Cockrell, W. G. Griswold, and D. Notkin, "Dynamically discovering likely program invariants to support program evolution," in International Conference on Software Engineering (ICSE'99), 1999, pp. 213-224.
27. J. Davies et al. (Eds.): ICFEM 2004, LNCS 3308, pp. 290-305, 2004.