Improving Pushdown System Model Checking

DOI10.1007/11817963_32zbMATH Open1188.68195OpenAlexW1591136029MaRDI QIDQ5756743FDOQ5756743

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

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

Mathematics Subject Classification ID

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

Cited In (10)

• Efficient CTL model-checking for pushdown systems
• Compositional verification of sequential programs with procedures
• Program Analysis Using Weighted Pushdown Systems
• Summarization for termination: No return!
• Title not available (Why is that?)
• Faster pushdown reachability analysis with applications in network verification
• Solving Multiple Dataflow Queries Using WPDSs
• Context-sensitive analysis without calling-context
• Title not available (Why is that?)
• Pushdown module checking with imperfect information

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)