Faster pushdown reachability analysis with applications in network verification

DOI10.1007/978-3-030-88885-5_12MaRDI QIDQ2147193zbMATH OpenOpenAlexFDO

Authors Stefan Schmid, Morten Konggaard Schou, Jiří Srba, Juan Vanerio, Ingo van Duijn, Peter Gjøl Jensen

Publication date 22 June 2022

Full work available at URL https://doi.org/10.1007/978-3-030-88885-5_12

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Reachability analysis of pushdown automata: Application to model-checking
• Improving Pushdown System Model Checking
• On the Reachability Analysis of Acyclic Networks of Pushdown Systems
• Reachability analysis of communicating pushdown systems
• Reachability analysis of communicating pushdown systems

Cites work

• scientific article; zbMATH DE number 1670775 (Why is no real title available?)
• scientific article; zbMATH DE number 1232241 (Why is no real title available?)
• scientific article; zbMATH DE number 1796143 (Why is no real title available?)
• Abstraction refinement with Craig interpolation and symbolic pushdown systems
• Computer Aided Verification
• NetKAT
• Netkat, semantic foundations for networks
• Network-wide configuration synthesis
• Reachability analysis of pushdown automata: Application to model-checking
• Regular canonical systems
• Tools and Algorithms for the Construction and Analysis of Systems

Describes a project that uses

Uses Software

• NetKAT
• jMoped

This page was built for publication: Faster pushdown reachability analysis with applications in network verification

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