Actively learning to verify safety for FIFO automata

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

Volumn 3328, Issue , 2004, Pages 494-505

  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

AUTOMATA THEORY; ENCODING (SYMBOLS); ITERATIVE METHODS; LEARNING SYSTEMS; SIGNAL ENCODING; SOFTWARE ENGINEERING;

ENCODING SCHEMES; ENCODINGS; EQUIVALENCE QUERIES; FIFO CHANNELS; FINITE STATES MACHINE; L-ALGORITHM; LEARN+; MACHINE LEARNING TECHNIQUES; MEMBERSHIP QUERY; SAFETY PROPERTY; CASE-STUDIES; ITS APPLICATIONS; RUNNING TIME;

LEARNING ALGORITHMS;

EID: 35048829430     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30538-5_41     Document Type: Article

References (14)

1. P. A. Abdulla, B. Jonsson, M. Nilsson, and J. d'Orso. Algorithmic improvements in regular model checking. In Computer-Aided Verification (CAV'03), volume 2725 of LNCS, pages 236-248. Springer, 2003.
2. D. Angluin. Learning regular sets from queries and counterexamples. Inform. Comput., 75(2):87-106, Nov. 1987.
3. J. Berstel. Transductions and Context-Free-Languages. B.C. Teubner, Stuttgart, 1979.
4. B. Boigelot. Symbolic Methods for Exploring Infinite State Spaces. PhD thesis, Collection des Publications de la Faculté des Sciences Appliquées de l'Université de Liège, 1999.
5. A. Bouajjani and P. Habermehl. Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations. Theoretical Computer Science, 221(1-2):211-250, June 1999.
6. A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili. Regular model checking. In E. A. Emerson and A. P. Sistla, editors, Proceedings of the 12th International Conference on Computer-Aided Verification (CAV'00), volume 1855 of LNCS, pages 403-418. Springer, 2000.
7. A. Finkel, S. Purushothaman Iyer, and G. Sutre. Well-abstracted transition systems: Application to FIFO automata. Information and Computation, 181(1):1-31, 2003.
8. P. Habermehl and T. Vojnar. Regular model checking using inference of regular languages. In Proc. of Infinity'04, London, UK (to appear), 2004.
9. ∼{}vardhan/lever.html, 2004.
10. M. Nilsson. http://www.regularmodelchecking.com, 2004.
11. J. Oncina and P. Garcia. Inferring regular languages in polynomial update time. In Pattern Recognition and Image Analysis, volume 1 of Series in Machine Perception and Artificial Intelligence, pages 49-61. World Scientific, Singapore, 1992.
12. T. Touili. Regular model checking using widening techniques. In ENTCS, volume 50. Elsevier, 2001.
13. A. Vardhan, K. Sen, M. Viswanathan, and G. Agha. Actively learning to verify safety for FIFO automata (full version), http://osl.cs.uiuc.edu/docs/lever-active/activeFifo.pdf, 2004.
14. A. Vardhan, K. Sen, M. Viswanathan, and G. Agha. Learning to verify safety properties. In Proc. of ICFEM'04, Seattle, USA (to appear), 2004.