The Complexity of Model Checking Multi-stack Systems

DOI10.1109/LICS.2013.22zbMath1366.68164OpenAlexW1974068220MaRDI QIDQ5271053

Roy Mennicke, Benedikt Bollig, Dietrich Kuske

Publication date: 3 July 2017

Published in: 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/lics.2013.22

zbMATH Keywords

satisfiability problemmodel checkingtemporal logicsnested words

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Realizability of concurrent recursive programs, The complexity of model checking multi-stack systems, Reachability of scope-bounded multistack pushdown systems