Model checking languages of data words

DOI10.1007/978-3-642-28729-9_26MaRDI QIDQ2892785zbMATH OpenOpenAlexFDO

Authors Benedikt Bollig, Aiswarya Cyriac, 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) Decidability of theories and sets of sentences (03B25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Model checking dynamic pushdown networks
• The Complexity of Model Checking Multi-stack Systems
• Model checking dynamic pushdown networks
• Data multi-pushdown automata
• The complexity of model checking multi-stack systems

Cited in

(9)

• Logics for unordered trees with data constraints
• Regular and context-free nominal traces
• Verifying quantitative temporal properties of procedural programs
• Reactive synthesis from visibly register pushdown automata
• scientific article; zbMATH DE number 4178463 (Why is no real title available?)
• Logics of repeating values on data trees and branching counter systems
• Passive learning of regular data languages in polynomial time and data
• Data multi-pushdown automata
• An automata-theoretic approach to the verification of distributed algorithms

This page was built for publication: Model checking languages of data words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892785)