2013 IEEE Seventh International Conference on Software Security and Reliability Companion 2013
DOI: 10.1109/sere-c.2013.33
|View full text |Cite
|
Sign up to set email alerts
|

Data Race Detection for Interrupt-Driven Programs via Bounded Model Checking

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
12
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 22 publications
(12 citation statements)
references
References 10 publications
0
12
0
Order By: Relevance
“…Furthermore, the user needs to come up with a proper bound of the context switches and specify the arrival time for interrupts. Wu et al [43] leveraged (bound) model checking tools to detect data-races in interrupt-driven programs. Kroening et al [18] also improved the CBMC bounded model checker to support the verification of interrupt-driven programs.…”
Section: Related Workmentioning
confidence: 99%
“…Furthermore, the user needs to come up with a proper bound of the context switches and specify the arrival time for interrupts. Wu et al [43] leveraged (bound) model checking tools to detect data-races in interrupt-driven programs. Kroening et al [18] also improved the CBMC bounded model checker to support the verification of interrupt-driven programs.…”
Section: Related Workmentioning
confidence: 99%
“…Previous research on formal verification of interrupt-driven programs uses a range of techniques, including program transformation [Kidd et al 2010;Regehr and Cooprider 2007;Wu et al 2013], explicit-state model checking [Schlich et al 2009], bounded model checking [Bucur and Kwiatkowska 2011;Li et al 2013] and predicate abstraction [Witkowski et al 2007]. None of these methods demonstrates effective verification of programs of moderate size with nested interrupts.…”
Section: Related Workmentioning
confidence: 99%
“…We briefly survey those methods most closely related to our techniques. Wu et al [2013] describe a translation from programs with nested interrupts into sequential code, which makes the assumption that interrupts may arrive after every instruction. This approach suffers from state explosion, which in our translation is addressed by an optimisation that greatly reduces the number of calls to ISRs.…”
Section: Related Workmentioning
confidence: 99%
“…This improves runtime performance with high precision and developer productivity. Most of the related solutions for detecting data races do target low end interrupt based, non-multithreaded embedded systems [19,20,6,23]. Therefore, these solutions can not be directly applied to the multithreaded software for ARMv7.…”
Section: Related Workmentioning
confidence: 99%