Automatic Verification of Parametric Specifications with Complex Topologies
Johannes Faber, Carsten Ihlemann (MPII), Swen Jacobs (EPFL), Viorica, Sofronie-Stokkermans (MPII)

TL;DR
This paper presents a modular approach to verifying complex parametric systems by leveraging specification, verification, and structural modularity, demonstrated through an automated safety verification of a train control system with intricate topology.
Contribution
It introduces a modular verification framework using CSP-OZ-DC for complex systems with rich data and topology, enhancing automation and scalability.
Findings
Successful automatic verification of safety properties in a complex train control system
Effective modularity in specification and verification improves scalability
Demonstrates applicability to systems with complex topologies
Abstract
The focus of this paper is on reducing the complexity in verification by exploiting modularity at various levels: in specification, in verification, and structurally. For specifications, we use the modular language CSP-OZ-DC, which allows us to decouple verification tasks concerning data from those concerning durations. At the verification level, we exploit modularity in theorem proving for rich data structures and use this for invariant checking. At the structural level, we analyze possibilities for modular verification of systems consisting of various components which interact.We illustrate these ideas by automatically verifying safety properties of a case study from the European Train Control System standard, which extends previous examples by comprising a complex track topology with lists of track segments and trains with different routes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
