arrow
Return

Machine-Checked Compositional Specification and Proofs for Embedded Systems

delete2026-01-01
delete0
PRE
AI
K
Karl Palmskog *
M
Mattias Nyberg
D
Dilian Gurov
DOI:10.1007/978-3-031-98208-8_5delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The effort of formal verification of large heterogeneous systems needs to scale linearly with the number of interacting components, to be feasible in industrial practice. This is made possible by compositional specification methods and proof systems. In this paper, we demonstrate how trustworthy verified decomposition can be performed for an industry-relevant embedded system: a fuel level display. We first formalize the underlying theory in the HOL4 theorem prover, and augment this theory to allow specifications using Metric Interval Temporal Logic (MITL). We then state a top-level specification for our system using MITL and decompose it down to the system components. Our HOL4 formalization provides a corrected and extended restatement of a general specification language and proof system from previous work and showcases its usefulness for verified decomposition of systems.
Keywords:
Compositional proof
formal verification
embedded systems
HOL4

Journal

T
THEORETICAL ASPECTS OF SOFTWARE ENGINEERING, TASE 2025
IF:
0
Papers:
17
Citations:
0

Organization

S
scania
Scholars:
186
Papers: 195
Citations: 0
R
royal institute of technology
Scholars:
1.1K
Papers: 549
Citations: 0