Towards Formal Verification of Hybrid Synchronous Programs with Refinement Types
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914533527781376 |
|---|---|
| author | Dane, Serra Z. Chen, Jiawei Pouzet, Marc Jeannin, Jean-Baptiste |
| author_facet | Dane, Serra Z. Chen, Jiawei Pouzet, Marc Jeannin, Jean-Baptiste |
| contents | Cyber-physical systems (CPS) such as autonomous cars, aircraft, and robots are often also safety-critical; thus it is imperative that they operate as intended with a high degree of certainty. Formal verification has been employed to verify the software controlling these systems, but due to their complexity, is usually performed on an abstract model rather than the executable code. Synchronous programming languages extended with differential equations promise both rigorous modeling and sufficient expressiveness to implement executable controller code, and recent developments have introduced formal verification of strictly discrete-time programs. Extending these verification techniques to hybrid systems enables precise modeling of the environment for a wider variety of programs to be both verified and executed. We formalize the operational semantics of initial value problems and zero-crossing detection expressed in a synchronous programming language, extend its type system for verification thereof, and prove its soundness. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_04377 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Towards Formal Verification of Hybrid Synchronous Programs with Refinement Types Dane, Serra Z. Chen, Jiawei Pouzet, Marc Jeannin, Jean-Baptiste Programming Languages Cyber-physical systems (CPS) such as autonomous cars, aircraft, and robots are often also safety-critical; thus it is imperative that they operate as intended with a high degree of certainty. Formal verification has been employed to verify the software controlling these systems, but due to their complexity, is usually performed on an abstract model rather than the executable code. Synchronous programming languages extended with differential equations promise both rigorous modeling and sufficient expressiveness to implement executable controller code, and recent developments have introduced formal verification of strictly discrete-time programs. Extending these verification techniques to hybrid systems enables precise modeling of the environment for a wider variety of programs to be both verified and executed. We formalize the operational semantics of initial value problems and zero-crossing detection expressed in a synchronous programming language, extend its type system for verification thereof, and prove its soundness. |
| title | Towards Formal Verification of Hybrid Synchronous Programs with Refinement Types |
| topic | Programming Languages |
| url | https://arxiv.org/abs/2605.04377 |