Learning to verify branching time properties

20th IEEE/ACM International Conference on Automated Software Engineering, ASE 2005

Volumn , Issue , 2005, Pages 325-328

  Vardhan, Abhay ^a   Viswanathan, Mahesh ^a  

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

Author keywords

Computational learning theory; CTL; Infinite state systems

Indexed keywords

BRANCHING TIME; COMPUTATION TREE LOGIC; COMPUTATIONAL LEARNING THEORY; CTL MODEL-CHECKING; FAIRNESS CONSTRAINTS; FIXPOINTS; INFINITE STATE SYSTEMS; LANGUAGE INFERENCE; NEW MODEL; STATE SPACE SYSTEMS; SUBFORMULAS;

COMPUTATION THEORY; COMPUTATIONAL MECHANICS; COMPUTER SOFTWARE; MATHEMATICAL MODELS; TREES (MATHEMATICS);

MODEL CHECKING;

EID: 77952334896     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1101908.1101961     Document Type: Conference Paper

References (15)

1. R. Alur, P. Madhusudan, and W. Nam. Symbolic compositional verification by learning assumptions. In Computer Aided Verification, 2005.
2. D. Angluin. Learning regular sets from queries and counterexamples. Inform. Comput., 75 (2):87-106, 1987.
3. S. Bardin, A. Finkel, and J. Leroux. FASTer acceleration of counter automata in practice. In TACAS, 2004.
4. C. Bartzis and T. Bultan. Widening arithmetic automata. In Computer Aided Verification, 2004.
5. T. Bultan and T. Yavuz-Kahveci. Action language verifier. In Proc. of Automated Software Engineering, pages 382-386, 2001.
6. E. M. Clarke, O. Grumberg, and D. A. Peled. Model checking. The MIT Press, 2000.
7. FAST. Fast acceleration of symbolic transition systems. http://www.lsv. ens-cachan.fr/fast/, 2004.
8. P. Habermehl and T. Vojnar. Regular model checking using inference of regular languages. In Proc. of Infinity'04, London, UK, 2004.
9. M. J. Kearns and U. V. Vazirani. An Introduction to Computational Learning Theory. The MIT Press, 1994.
10. LEVER. Learning to verify tool. http://osl.cs.uiuc.edu/~vardhan/lever. html, 2004.
11. R. L. Rivest and R. E. Schapire. Inference of finite automata using homing sequences. Inform. Comput., 103 (2):299-347, Apr. 1993.
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. In LNCS 3328, Proc. of FSTTCS'04, pages 494-505, 2004.
14. A. Vardhan, K. Sen, M. Viswanathan, and G. Agha. Using language inference to verify omega-regular properties. In TACAS, 2005.
15. A. Vardhan and M. Viswanathan. Learning to verify branching time properties. TR UIUCDCS-R-2005-2630, http://osl.cs.uiuc.edu/docs/ctlLearn/ ctlLearnTRpdf, Computer Science, University of Illinois, 2005.