Interrupt Verification via Thread Verification

Regehr, John; Cooprider, Nathan

doi:10.1016/j.entcs.2007.04.002

Cited by 45 publications

(25 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, in our POEG, we assume that two thread segments and , respectively, from two different threads and are always concurrent unless they are ordered by a task ordering edge or one of them is disabled by the other one. The nesC language [21] contains a static data race detector that however is still unsound since it cannot follow pointers [12,21,22]. Thus, the data races presented in Figure 1 cannot be reported by the native nesC data race detector.…”

Section: Definition 1 (Poeg)mentioning

confidence: 99%

See 1 more Smart Citation

Verification of Data Races in Concurrent Interrupt Handlers

Tchamgoue

Kim

Jun

2013

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Data races are common in interrupt-driven programs and have already led to well-known real-world problems. Unfortunately, existing dynamic tools for reporting data races in interrupt-driven programs are not only unsound, but they also fail to verify the existence of data races in such programs. This paper presents an efficient and scalable on-the-fly technique that precisely detects, without false positives, apparent data races in interrupt-driven programs. The technique combines a tailored lightweight labeling scheme to maintain logical concurrency between the main program and every instance of its interrupt handlers with a precise detection protocol that analyzes conflicting shared memory accesses by storing at most two accesses for each shared variable. We implemented a prototype of this technique, called iRace, on top of the Avrora simulation framework. An empirical evaluation of iRace revealed the presence of data races in some existing TinyOS components and applications with a worst-case slowdown of only about 6 times on average and an increased average memory consumption of only about 20% in comparison with the original program execution. The evaluation also proved that the labeling scheme alone generates an average runtime overhead of only about 0.4x while consuming only about 12% more memory than the original program execution.

show abstract

Section: Definition 1 (Poeg)mentioning

confidence: 99%

“…However, on-the-fly techniques still suffer from the high runtime overhead they incur. Dynamic analysis methods can be a good complement to static analysis methods [21,22] since they guarantee to isolate real data races in a particular execution instance of a program given an input from the potential data races reported by static analysis.…”

Section: Introductionmentioning

confidence: 99%

Verification of Data Races in Concurrent Interrupt Handlers

Tchamgoue

Kim

Jun

2013

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…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%

“…The second source-to-source transformation we use for comparison generates multithreaded code and was suggested by Regehr and Cooprider [2007]. This method verifies program properties for specific, user-defined interrupt arrival scenarios, rather than modelling all possible patterns of interrupt arrival.…”

Section: Modelling Interrupts With Threadsmentioning

confidence: 99%

“…By contrast, Kidd et al [2010] employ the notion of a "hyperperiod", during which every interrupt happens exactly once. Regehr and Cooprider [2007] suggest a source-to-source transformation from interrupt-driven code to multi-threaded code that assigns a fixed priority to a thread when it is created. Threads are scheduled at runtime according to predefined priorities.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Effective Verification for Low-Level Software with Competing Interrupts

Liang

Melham

Kroening

et al. 2017

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

Interrupt-driven software is difficult to test and debug, especially when interrupts can be nested and subject to priorities. Interrupts can arrive at arbitrary times, leading to an exponential blow-up in the number of cases to consider. We present a new formal approach to verifying interrupt-driven software based on symbolic execution. The approach leverages recent advances in the encoding of the execution traces of interacting, concurrent threads. We assess the performance of our method on benchmarks drawn from embedded systems code and device drivers, and experimentally compare it to conventional approaches that use source-to-source transformations. Our results show that our method significantly outperforms these techniques. To the best of our knowledge, our work is the first to demonstrate effective verification of low-level embedded software with nested interrupts.

show abstract

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

Interrupt Verification via Thread Verification

Cited by 45 publications

References 13 publications

Verification of Data Races in Concurrent Interrupt Handlers

Verification of Data Races in Concurrent Interrupt Handlers

Effective Verification for Low-Level Software with Competing Interrupts

Data Races and Static Analysis for Interrupt-Driven Kernels

Contact Info

Product

Resources

About