Faster pushdown reachability analysis with applications in network verification

DOI10.1007/978-3-030-88885-5_12zbMath1497.68308OpenAlexW3206316501MaRDI QIDQ2147193

Stefan Schmid, Juan Vanerio, Morten Konggaard Schou, Jiří Srba, 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)

Uses Software

• jMoped
• NetKAT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• NetKAT
• Network-wide configuration synthesis
• Regular canonical systems
• NetKAT
• Tools and Algorithms for the Construction and Analysis of Systems
• Computer Aided Verification
• Reachability analysis of pushdown automata: Application to model-checking

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