Model Checking Languages of Data Words

DOI10.1007/978-3-642-28729-9_26zbMath1352.68145OpenAlexW206883444MaRDI QIDQ2892785

Aiswarya Cyriac, Benedikt Bollig, Paul Gastin, K. Narayan Kumar

Publication date: 22 June 2012

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28729-9_26

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25)

Related Items

Reactive synthesis from visibly register pushdown automata, Logics for unordered trees with data constraints, An automata-theoretic approach to the verification of distributed algorithms, Logics of Repeating Values on Data Trees and Branching Counter Systems, Verifying quantitative temporal properties of procedural programs, Regular and context-free nominal traces, Data Multi-Pushdown Automata