Towards the verification of a generic interlocking logic: Dafny meets parameterized model checking
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914697630973952 |
|---|---|
| author | Cimatti, Alessandro Griggio, Alberto Redondi, Gianluca |
| author_facet | Cimatti, Alessandro Griggio, Alberto Redondi, Gianluca |
| contents | Interlocking logics are at the core of critical systems controlling the traffic within stations. In this paper, we consider a generic interlocking logic, which can be instantiated to control a wide class of stations. We tackle the problem of parameterized verification, i.e. prove that the logic satisfies the required properties for all the relevant stations. We present a simplified case study, where the interlocking logic is directly encoded in Dafny. Then, we show how to automate the proof of an important safety requirement, by integrating simple, template-based invariants and more complex invariants obtained from a model checker for parameterized systems. Based on these positive preliminary results, we outline how we intend to integrate the approach by extending the IDE for the design of the interlocking logic. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_00087 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Towards the verification of a generic interlocking logic: Dafny meets parameterized model checking Cimatti, Alessandro Griggio, Alberto Redondi, Gianluca Logic in Computer Science Interlocking logics are at the core of critical systems controlling the traffic within stations. In this paper, we consider a generic interlocking logic, which can be instantiated to control a wide class of stations. We tackle the problem of parameterized verification, i.e. prove that the logic satisfies the required properties for all the relevant stations. We present a simplified case study, where the interlocking logic is directly encoded in Dafny. Then, we show how to automate the proof of an important safety requirement, by integrating simple, template-based invariants and more complex invariants obtained from a model checker for parameterized systems. Based on these positive preliminary results, we outline how we intend to integrate the approach by extending the IDE for the design of the interlocking logic. |
| title | Towards the verification of a generic interlocking logic: Dafny meets parameterized model checking |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2403.00087 |