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

Authors:
Tobias Ganzow;Łukasz Kaiser
Affiliations:
Mathematische Grundlagen der Informatik, RWTH Aachen University, Germany;Mathematische Grundlagen der Informatik, RWTH Aachen University, Germany
Venue:
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Year:
2010

Citing 5
Cited 0

Automatic verification of pointer programs using monadic second-order logic

Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words

Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Applying SAT Methods in Unbounded Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Hardware Verification using Monadic Second-Order Logic

Proceedings of the 7th International Conference on Computer Aided Verification
An integrated proof language for imperative programs

Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new algorithm formodel-checkingweakmonadic second-order logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipulates formulas and checks them on the structure of interest, thus avoiding both the use of automata and the need to interpret the structure in the binary tree. In addition to the algorithm, we give a new proof of decidability of weak MSO on inductive structures which follows Shelah's composition method. Generalizing this proof technique, we obtain decidability of weak MSO extended with the unbounding quantifier on the binary tree, which was open before.