Pushdown systems with stack manipulation

DOI10.1007/978-3-319-02444-8_29MaRDI QIDQ5166703zbMATH OpenOpenAlexFDO

Authors Yuya Uezato, Yasuhiko Minamide

Publication date 8 July 2014

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-02444-8_29

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)

Recommendations

• Analyzing pushdown systems with stack manipulation
• On Reachability Analysis of Pushdown Systems with Transductions: Application to Boolean Programs with Call-by-Reference
• scientific article; zbMATH DE number 1232241
• Well-structured pushdown systems
• Ordered tree-pushdown systems

Cited in

(6)

• Analyzing pushdown systems with stack manipulation
• Reachability relations of timed pushdown automata
• Well-structured pushdown systems
• Push-down automata with gap-order constraints
• Stack and locally finite transformations on structures with reversible transitions
• Reachability analysis of pushdown systems with an upper stack

This page was built for publication: Pushdown systems with stack manipulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166703)