AN ALTERNATIVE CONSTRUCTION IN SYMBOLIC REACHABILITY ANALYSIS OF SECOND ORDER PUSHDOWN SYSTEMS

DOI10.1142/S012905410800608XMaRDI QIDQ3526547zbMATH OpenFDO

Authors Anil K. Seth

Publication date 25 September 2008

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

verificationsymbolic model-checkinghigher-order pushdown automata

Mathematics Subject Classification ID

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

Recommendations

• Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
• Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
• Reachability analysis of pushdown automata: Application to model-checking
• Mathematical Foundations of Computer Science 2005
• Reachability in pushdown register automata

Cited in

(4)

• Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
• Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
• Model checking procedural programs
• Mathematical Foundations of Computer Science 2005

This page was built for publication: AN ALTERNATIVE CONSTRUCTION IN SYMBOLIC REACHABILITY ANALYSIS OF SECOND ORDER PUSHDOWN SYSTEMS

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