Using language inference to verify omega-regular properties

Lecture Notes in Computer Science

Volumn 3440, Issue , 2005, Pages 45-60

  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

ALGORITHMS; FINITE AUTOMATA; FORMAL LANGUAGES; ITERATIVE METHODS; LEARNING SYSTEMS; MATHEMATICAL MODELS; SET THEORY;

INFINITE STATE SYSTEMS; LANGUAGE INFERENCE; MODEL CHECKING; VERIFICATION;

INFERENCE ENGINES;

EID: 24644453930     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31980-1_4     Document Type: Conference Paper

References (18)

1. P. A. Abdulla, B. Jonsson, M. Nilson, J. d'Orso, and M. Saksena. Regular model checking for LTL(MSO). In Proc. of CAV'04, USA, LNCS 3114, 2004.
2. D. Angluin. Learning regular sets from queries and counterexamples. Inform. Comput., 75(2):87-106, Nov. 1987.
3. A. Bouajjani, P. Habermehl, and T. Vojnar. Abstract regular model checking. In CAV'04, LNCS 3114, 2004.
4. 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.
5. A. Bouajjani, A. Legay, and P. Wolper. Handling liveness properties in (ω-)regular model-checking. In Proc. of Infinity'04, London, UK, 2004.
6. E.A. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional mucalculus. In Proceedings of the First Annual Symposium on Logic in Computer Science, pages 267-278, Washington, D.C., 1986. IEEE Computer Society Press.
7. E. A. Emerson. Temporal and modal logic. In J. V. Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 995-1072. Elsevier, Amsterdam, 1990.
8. L. Fribourg and H. Olsén. Reachability sets of parametrized rings as regular languages. In Proc. 2nd Int. Workshop on Verification of Infinite State Systems (INFINITY'97), Bologna, Italy, July 1997, volume 9. Elsevier Science, 1997.
9. P. Habermehl and T. Vojnar. Regular model checking using inference of regular languages. In Proc. of Infinity'04, London, UK, 2004.
10. B. Jonsson and M. Nilsson. Transitive closures of regular relations for verifying infinite-state systems. In 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'00), volume 1785 of LNCS, pages 220-234. Springer, 2000.
11. LEVER. Learning to verify tool. http://osl.cs.uiuc.edu/~vardhan/lever. html, 2004.
12. 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.
13. A. Pnueli and E. Shahar. Liveness and acceleration in parameterized verification. In CAV'00, 2000.
14. W. Thomas. Automata on infinite objects. In J. V. Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 133-191. Elsevier, Amsterdam, 1990.
15. T. Touili. Regular model checking using widening techniques. In ENTCS, volume 50. Elsevier, 2001.
16. A. Vardhan, K. Sen, M. Viswanathan, and G. Agha. Actively learning to verify safety for fifo automata. In LNCS 3328, Proc. of FSTTCS'04, Chennai, India, pages 494-505, 2004.
17. A. Vardhan, K. Sen, M. Viswanathan, and G. Agha. Learning to verify safety properties. In LNCS 3308, Proc. of ICFEM'04, Seattle, USA, pages 274-288, 2004.
18. A. Vardhan, K. Sen, M. Viswanathan, and G. Agha. Using language inference to verify omega-regular properties (full version), http://osl.cs.uiuc.edu/docs/ omega/omegaLearn2.pdf, 2004.