Unboundedness and downward closures of higher-order pushdown automata
Publication:2828251
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
verificationautomatamodel checkingformal languagesconcurrencypushdown automataParikh imagesfunctional programshigher-order programsdownwards closures
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