Formalizes hybrid synchronous program semantics including differential equations and zero-crossings, extends refinement types for verification, and proves soundness.
Leibniz Transactions on Embedded Systems8(2), 04–1 (2022)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Towards Formal Verification of Hybrid Synchronous Programs with Refinement Types
Formalizes hybrid synchronous program semantics including differential equations and zero-crossings, extends refinement types for verification, and proves soundness.