Unboundedness and downward closures of higher-order pushdown automata

DOI10.1145/2837614.2837627zbMath1347.68205arXiv1507.03304OpenAlexW2249237842MaRDI QIDQ2828251

No author found.

Publication date: 24 October 2016

Published in: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

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

zbMATH Keywords

verificationautomatamodel checkingformal languagesconcurrencypushdown automataParikh imagesfunctional programshigher-order programsdownwards closures

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Functional programming and lambda calculus (68N18) 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

General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond, Recursion Schemes and the WMSO+U Logic, Cost Automata, Safe Schemes, and Downward Closures, Unboundedness problems for machines with reversal-bounded counters, Existential Definability over the Subword Ordering, Weighted automata with storage, Unnamed Item, General decidability results for asynchronous shared-memory programs: higher-order and beyond, Unnamed Item, On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems