New algorithm for weak monadic second-order logic on inductive structures

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

Volumn 6247 LNCS, Issue , 2010, Pages 366-380

  Ganzow, Tobias ^a   Kaiser, Łukasz ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLIQUE-WIDTH; COMPOSITION METHOD; MONADIC SECOND-ORDER LOGIC;

ALGORITHMS; BINARY TREES; COMPUTABILITY AND DECIDABILITY; COMPUTER SCIENCE; MODEL CHECKING; TECHNICAL PRESENTATIONS;

TREES (MATHEMATICS);

EID: 77956603376     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15205-4_29     Document Type: Conference Paper

References (14)

1. Büchi, J.R.: On a decision method in restricted second order arithmetic. In: International Congress on Logic, Methodology and Philosophy of Science, pp. 1-11. Stanford University Press, Standford (1962)
2. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society 141, 1-35 (1969)
3. Courcelle, B.: The monadic second order logic of graphs, II: Infinite graphs of bounded width. Mathematical System Theory 21, 187-222 (1989)
4. Basin, D.A., Klarlund, N.: Hardware verification using monadic second-order logic. In: Wolper, P. (ed.) CAV 1995. LNCS, vol.939, pp. 31-41. Springer, Heidelberg (1995)
5. Jensen, J.L., Jørgensen, M.E., Klarlund, N., Schwartzbach, M.I.: Automatic verification of pointer programs using monadic second-order logic. In: Proceedings of PLDI 1997, pp. 226-236 (1997)
6. Zee, K., Kuncak, V., Rinard, M.C.: An integrated proof language for imperative programs. In: PLDI, pp. 338-351 (2009)
7. Shelah, S.: The monadic second order theory of order. Annals of Mathematics 102, 379-419 (1975)
8. Thomas, W.: Ehrenfeucht games, the composition method, and the monadic theory of ordinal words. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol.1261, pp. 118-143. Springer, Heidelberg (1997)
9. L̈auchli, H.: A decision procedure for the weak second order theory of linear order. In: Arnold, H., Schmidt, K.S., Thiele, H.J. (eds.) Proceedings of the Logic Colloquium 1966, vol.50, pp. 189-197. Elsevier, Amsterdam (1968)
10. Blumensath, A., Colcombet, T., L̈oding, C.: Logical theories and compatible operations. In: Flum, J., Gr̈adel, E., Wilke, T. (eds.) Logic and automata: History and Perspectives, pp. 72-106. Amsterdam University Press, Amsterdam (2007)
11. Makowsky, J.A.: Algorithmic uses of the Feferman-Vaught theorem. Annals of Pure and Applied Logic 126(1-3), 159-213 (2004)
12. Bojanczyk, M.: Weak MSO with the unbounding quantifier. In: Proceedings of STACS 2009, Schloss Dagstuhl (IBFI). LIPIcs, vol.09001, pp. 159-170 (2009)
13. Bojanczyk, M.: A bounding quantifier. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.3210, pp. 41-55. Springer, Heidelberg (2004)
14. McMillan, K.L.: Applying sat methods in unbounded symbolic model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.2404, pp. 250-264. Springer, Heidelberg (2002)