Extending automated compositional verification to the full class of omega-regular languages

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

Volumn 4963 LNCS, Issue , 2008, Pages 2-17

  Farzan, Azadeh ^a   Chen, Yu Fang ^b   Clarke, Edmund M ^a   Tsay, Yih Kuen ^b   Wang, Bow Yaw ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^c ACADEMIA SINICA   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPOSITIONAL VERIFICATION; EUROPEAN; HEIDELBERG (CO); INFINITE SEQUENCES; INTERNATIONAL CONFERENCES; LANGUAGES (TRADITIONAL); LIVENESS PROPERTIES; REGULAR LANGUAGE;

ALGORITHMS; BOOLEAN FUNCTIONS; CONTEXT FREE LANGUAGES; EDUCATION; FORMAL LANGUAGES; LEARNING SYSTEMS; LINGUISTICS; QUERY LANGUAGES; REAL TIME SYSTEMS; TRANSLATION (LANGUAGES);

LEARNING ALGORITHMS;

EID: 47249127285     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78800-3_2     Document Type: Conference Paper

References (21)

1. Alur, R., Madhusudan, P., Nam, W.: Symbolic compositional verification by learning assumptions. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 548-562. Springer, Heidelberg (2005)
2. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2), 87-106 (1987)
3. Arnold, A.: A syntactic congruence for rational omega-language. Theoretical Computer Science 39, 333-335 (1985)
4. Büchi, J.R.: On a decision method in restricted second-order arithmetic. In: Proceedings of the 1960 International Congress on Logic, Methodology and Philosophy of Science, pp. 1-11 (1962)
5. Calbrix, H., Nivat, M., Podelski, A.: Ultimately periodic words of rational ω-languages. In: Main, M.G., Melton, A.C., Mislove, M.W., Schmidt, D., Brookes, S.D. (eds.) MFPS 1993. LNCS, vol. 802, pp. 554-566. Springer, Heidelberg (1994)
6. Calbrix, H., Nivat, M., Podelski, A.: Sur les mots ultimement périodiques des langages rationnels de mots infinis. Comptes Rendus de l'Académie des Sciences 318, 493-497 (1994)
7. Chaki, S., Clarke, E., Sinha, N., Thati, P.: Automated assume-guarantee reasoning for simulation conformance. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 534-547. Springer, Heidelberg (2005)
8. Cobleigh, J.M., Giannakopoulou, D., Pǎsǎreanu, C.S.: Learning assumptions for compositional verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 331-346. Springer, Heidelberg (2003)
9. Farzan, A., Chen, Y., Clarke, E., Tsay, Y., Wang, B.: Extending automated compositional verification to the full class of omega-regular languages. Technical Report CMU-CS-2008-100, Carnegie Mellon University, Department of Computer Science (2008)
10. Gastin, P., Oddoux, D.: Fast LTL to Büchi automata translations. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 53-65. Springer, Heidelberg (2001)
11. Gupta, A., McMillan, K.L., Fu, Z.: Automated assumption generation for compositional verification. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 420-432. Springer, Heidelberg (2007)
12. Hopcroft, J.E.: A n logn algorithm for minimizing states in a finite automaton. Technical report, Stanford University (1971)
13. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
14. Maler, O., Pnueli, A.: On the learnability of infinitary regular sets. Information and Computation 118(2), 316-326 (1995)
15. Manna, Z., Pnueli, A.: A hierarchy of temporal properties. Technical Report STANCS-87-1186, Stanford University, Department of Computer Science (1987)
16. Michel, M.: Complementation is more difficult with automata on infinite words. In: CNET, Paris (1988)
17. Perrin, D., Pin, J.E.: Infinite Words: Automata, Semigroups, Logic and Games. Academic Press, London (2003)
18. Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. Information and Computation 103(2), 299-347 (1993)
19. Somenzi, F., Bloem, R.: Efficient Büchi automata from LTL formulae. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 248-263. Springer, Heidelberg (2000)
20. Tsay, Y., Chen, Y., Tsai, M., Wu, K., Chan, W.: GOAL: A Graphical Tool for Manipulating Büchi Automata and Temporal Formulae. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 466-471. Springer, Heidelberg (2007)
21. Van, D.L., Le Saëc, B., Litovsky, I.: Characterizations of rational omega-languages by means of right congruences. Theor. Comput. Sci. 143(1), 1-21 (1995)