Reachability Analysis of Pushdown Systems with an Upper Stack

DOI10.1007/978-3-319-53733-7_33zbMath1485.68073arXiv1811.02982OpenAlexW2588178040MaRDI QIDQ5739017

Marcio Diaz, Adrien Pommellet, Tayssir Touili

Publication date: 1 June 2017

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

finite automatareachability analysispushdown systemsstack pointer

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• On the regular structure of prefix rewriting
• Practical arbitrary lookahead LR parsing
• A generic approach to the static analysis of concurrent programs with procedures
• Pushdown Systems with Stack Manipulation
• 2-Visibly Pushdown Automata
• Stack automata and compiling
• Sets accepted by one-way stack automata are context sensitive
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: Reachability Analysis of Pushdown Systems with an Upper Stack