Investigating Time Properties of Interrupt-Driven Programs

Huang, Yanhong; Zhao, Yongxin; Shi, Jian; Zhu, Huibiao; Qin, Shengchao

doi:10.1007/978-3-642-33296-8_11

Cited by 6 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However no soundness argument is given, and other kinds of blocks (suspend/resume, flag-based synchronization) are not handled. The works in [5,6,13] analyze timing properties, interrupt-latency, and stack sizes for interrupt-driven programs, using model-checking, algebraic, and algorithmic approaches. Schwarz et al [25,26] give analyses for race-detection and invariants based on linear-equalities for their aforementioned class of priority-based interrupt-driven programs.…”

Section: Related Workmentioning

confidence: 99%

Data Races and Static Analysis for Interrupt-Driven Kernels

Chopra

Pai

D’Souza

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We consider a class of interrupt-driven programs that model the kernel API libraries of some popular real-time embedded operating systems and the synchronization mechanisms they use. We define a natural notion of data races and a happens-before ordering for such programs.The key insight is the notion of disjoint blocks to define the synchronizeswith relation. This notion also suggests an efficient and effective lockset based analysis for race detection. It also enables us to define efficient "sync-CFG" based static analyses for such programs, which exploit data race freedom. We use this theory to carry out static analysis on the FreeRTOS kernel library to detect races and to infer simple relational invariants on key kernel variables and data-structures.

show abstract