Faster pushdown reachability analysis with applications in network verification

DOI10.1007/978-3-030-88885-5_12zbMATH Open1497.68308OpenAlexW3206316501MaRDI QIDQ2147193FDOQ2147193

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

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

Mathematics Subject Classification ID

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

Cites Work

• Tools and Algorithms for the Construction and Analysis of Systems
• NetKAT
• NetKAT
• Title not available (Why is that?)
• Abstraction refinement with Craig interpolation and symbolic pushdown systems
• Reachability analysis of pushdown automata: Application to model-checking
• Title not available (Why is that?)
• Title not available (Why is that?)
• Regular canonical systems
• Network-wide configuration synthesis
• Computer Aided Verification

Uses Software

• jMoped
• NetKAT

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)