Improving Pushdown System Model Checking

DOI10.1007/11817963_32MaRDI QIDQ5756743zbMATH OpenOpenAlexFDO

Authors Akash Lal, Thomas Reps

Publication date 5 September 2007

Published in Computer Aided Verification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11817963_32

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 1670780
• Pushdown module checking
• Efficient CTL model-checking for pushdown systems
• Efficient CTL model-checking for pushdown systems
• Reachability analysis of pushdown automata: Application to model-checking

Cited in

(10)

• Program Analysis Using Weighted Pushdown Systems
• scientific article; zbMATH DE number 1670780 (Why is no real title available?)
• scientific article; zbMATH DE number 7317259 (Why is no real title available?)
• Efficient CTL model-checking for pushdown systems
• Compositional verification of sequential programs with procedures
• Solving Multiple Dataflow Queries Using WPDSs
• Summarization for termination: No return!
• Context-sensitive analysis without calling-context
• Pushdown module checking with imperfect information
• Faster pushdown reachability analysis with applications in network verification

This page was built for publication: Improving Pushdown System Model Checking

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