Saturation of Concurrent Collapsible Pushdown Systems

DOI10.4230/LIPICS.FSTTCS.2013.313zbMath1359.68222arXiv1310.2631OpenAlexW1560263126MaRDI QIDQ2963923

Matthew Hague

Publication date: 21 February 2017

Full work available at URL: https://arxiv.org/abs/1310.2631

zbMATH Keywords

verificationautomatamodel checkingconcurrencyhigher-order procedures

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)

Related Items (2)

Reachability of scope-bounded multistack pushdown systems ⋮ Leafy automata for higher-order concurrency

This page was built for publication: Saturation of Concurrent Collapsible Pushdown Systems