Model Checking Languages of Data Words

Benedikt Bollig (1, 2) , Aiswarya Cyriac (1, 2) , Paul Gastin (1, 2) , K. Narayan Kumar (3)

1 LSV - Laboratoire Spécification et Vérification [Cachan]
2 MEXICO - Modeling and Exploitation of Interaction and Concurrency
3 Chennai Mathematical Institute [Inde]

We consider the model-checking problem for data multi-pushdown automata (DMPA). DMPA generate data words, i.e, strings enriched with values from an infinite domain. The latter can be used to represent an unbounded number of process identifiers so that DMPA are suitable to model concurrent programs with dynamic process creation. To specify properties of data words, we use monadic second-order (MSO) logic, which comes with a predicate to test two word positions for data equality. While satisfiability for MSO logic is undecidable (even for weaker fragments such as first-order logic), our main result states that one can decide if all words generated by a DMPA satisfy a given formula from the full MSO logic.

Domaines: Théorie et langage formel [cs.FL]

Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar. Model Checking Languages of Data Words. FoSSaCS 2012, Mar 2012, Tallinn, Estonia. ⟨hal-00658333⟩