On removing the pushdown stack in reachability constructions

DOI10.1007/3-540-45678-3_22MaRDI QIDQ4474093zbMATH OpenFDO

Authors Oscar H. Ibarra, Zhe Dang

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2223/22230244.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Eliminating the storage tape in reachability constructions.
• Binary reachability analysis of discrete pushdown timed automata
• Past pushdown timed automata
• Pushdown timed automata: A binary reachability characterization and safety verification.
• Past pushdown timed automata and safety verification.

Cited in

(9)

• Verification in loosely synchronous queue-connected discrete timed automata.
• Past pushdown timed automata and safety verification.
• Eliminating the storage tape in reachability constructions.
• On elimination of state constraints in the construction of reachable sets
• Binary reachability analysis of discrete pushdown timed automata
• Past pushdown timed automata
• Taming strategy logic: non-recurrent fragments
• On the freeze quantifier in Constraint LTL: Decidability and complexity
• Verification of qualitative \(\mathbb Z\) constraints

This page was built for publication: On removing the pushdown stack in reachability constructions

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