Push-Down Automata with Gap-Order Constraints

DOI10.1007/978-3-642-40213-5_13zbMath1434.68222OpenAlexW1554523334MaRDI QIDQ2948245

Andreas Podelski, Mohamed Faouzi Atig, Giorgio Delzanno, Parosh Aziz Abdulla

Publication date: 30 September 2015

Published in: Fundamentals of Software Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40213-5_13

zbMATH Keywords

context-free grammarscontrol state reachabilitypushdown automata with data

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (4)

Interprocedural Reachability for Flat Integer Programs ⋮ Unnamed Item ⋮ Verifying quantitative temporal properties of procedural programs ⋮ Data Multi-Pushdown Automata

This page was built for publication: Push-Down Automata with Gap-Order Constraints