Automated Abstraction Refinement for Information Flow Security in Embedded Systems
Paper proposes heuristic automatic abstraction refinement for information flow analysis in concurrent embedded systems, implemented for SystemC.
The arXiv paper addresses imprecision and cost in information flow analysis (IFA) for concurrent, time-dependent embedded systems by automating abstraction refinement. Heuristics select abstraction levels based on state dependencies and detected potential leakage, replacing prior manual definitions. The approach combines symbolic execution with abstract interpretation to capture data, control, timing, and event dependencies between processes. It is implemented for SystemC and demonstrated on several shared bus architectures, balancing analysis time against precision.
- Automatic abstraction refinement replaces manual level selection in information flow analysis
- Heuristics use state dependencies and detected leakage to pick abstraction levels
- Symbolic execution captures data, control, timing, and event dependencies
- Implemented for SystemC and evaluated on shared bus architectures
- Tags
- information-flow-analysisabstraction-refinementsymbolic-executionabstract-interpretationembedded-systemssystemcformal-verification
- Organizations
- SystemC
From the original article
1 min read at arxiv.orgInformation flow analysis (IFA) is a powerful technique for verifying confidentiality and integrity and is therefore highly desirable for security-sensitive embedded systems. However, as these systems are inherently concurrent and time-dependent, existing IFA for embedded systems tend to be either imprecise or expensive.
By Jonas Becker-Kupczok · arxiv.org
A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.