Sherlock: scalable deadlock detection for concurrent programs

Eslamimehr, Mahdi; Palsberg, Jens

doi:10.1145/2635868.2635918

Cited by 56 publications

(36 citation statements)

References 67 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Other deadlock detection approaches such as concolic execution [8] are between static analysis and runtime detection.…”

Section: Related Workmentioning

confidence: 99%

Static deadlock detection for concurrent go by global session graph synthesis

Yoshida

2016

Proceedings of the 25th International Conference on Compiler Construction

View full text Add to dashboard Cite

Go is a programming language developed at Google, with channelbased concurrent features based on CSP. Go can detect global communication deadlocks at runtime when all threads of execution are blocked, but deadlocks in other paths of execution could be undetected. We present a new static analyser for concurrent Go code to find potential communication errors such as communication mismatch and deadlocks at compile time. Our tool extracts the communication operations as session types, which are then converted into Communicating Finite State Machines (CFSMs). Finally, we apply a recent theoretical result on choreography synthesis to generate a global graph representing the overall communication pattern of a concurrent program. If the synthesis is successful, then the program is free from communication errors.We have implemented the technique in a tool, and applied it to analyse common Go concurrency patterns and an open source application with over 700 lines of code.

show abstract

“…Other deadlock detection approaches such as concolic execution [8] are between static analysis and runtime detection.…”

Section: Related Workmentioning

confidence: 99%

Static deadlock detection for concurrent go by global session graph synthesis

Yoshida

2016

Proceedings of the 25th International Conference on Compiler Construction

View full text Add to dashboard Cite

show abstract

“…There exist numerous techniques for deadlock detection, such as Chord [26] and Sherlock [10], that apply to different programming models. Most of the approaches pursue scalability without losing accuracy, thus effectiveness.…”

Section: Deadlocksmentioning

confidence: 99%

A Functional Safety OpenMP $$^{*}$$ for Critical Real-Time Embedded Systems

Royuela

Durán

Serrano

et al. 2017

Scaling OpenMP for Exascale Performance and Portability

View full text Add to dashboard Cite

Abstract. OpenMP* has recently gained attention in the embedded domain by virtue of the augmentations implemented in the last specification. Yet, the language has a minimal impact in the embedded real-time domain mostly due to the lack of reliability and resiliency mechanisms. As a result, functional safety properties cannot be guaranteed. This paper analyses in detail the latest specification to determine whether and how the compliant OpenMP implementations can guarantee functional safety. Given the conclusions drawn from the analysis, the paper describes a set of modifications to the specification, and a set of requirements for compiler and runtime systems to qualify for safety critical environments. Through the proposed solution, OpenMP can be used in critical real-time embedded systems without compromising functional safety.

show abstract

“…As noted in Section 1, thread-level race detection techniques [1,[3][4][5][8][9][10][12][13][14][15][25][26][27] cannot be directly adopted to address process-level race conditions. There are several reasons for this.…”

Section: Comparing System-level and Thread-level Race Detection Technmentioning

confidence: 99%

“…Many techniques have been proposed to improve dynamic analysis techniques by providing both observability (the ability to observe events) and controllability (the ability to permute execution interleavings during test runs) . These techniques attempt to abstract away scheduling nondeterminism in concurrent programs to achieve greater execution control.…”

Section: Introductionmentioning

confidence: 99%

“…On the other hand, such approaches may also fail to recognize user-defined synchronization primitives and report the existence of races that are not actual races (false positives). * Many techniques have been proposed to improve dynamic analysis techniques by providing both observability (the ability to observe events) and controllability (the ability to permute execution interleavings during test runs) [12][13][14][15]. These techniques attempt to abstract away scheduling nondeterminism in concurrent programs to achieve greater execution control.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An automated framework to support testing for process‐level race conditions

Srisa-an

Rothermel

2017

Software Testing Verif & Rel

View full text Add to dashboard Cite

Summary Race conditions are difficult to detect because they usually occur only under specific execution interleavings. Numerous program analysis and testing techniques have been proposed to detect race conditions between threads on single applications. However, most of these techniques neglect races that occur at the process level due to complex system event interactions. This article presents a framework, SIMEXPLORER, that allows engineers to effectively test for process‐level race conditions. SIMEXPLORER first uses dynamic analysis techniques to observe system execution, identify program locations of interest, and report faults related to oracles. Next, it uses virtualization to achieve the fine‐grained controllability needed to exercise event interleavings that are likely to expose races. We evaluated the effectiveness of SIMEXPLORER on 24 real‐world applications containing both known and unknown process‐level race conditions. Our results show that SIMEXPLORER is effective at detecting these race conditions, while incurring an overhead that is acceptable given its effectiveness improvements.

show abstract

Sherlock: scalable deadlock detection for concurrent programs

Cited by 56 publications

References 67 publications

Static deadlock detection for concurrent go by global session graph synthesis

Static deadlock detection for concurrent go by global session graph synthesis

A Functional Safety OpenMP $$^{*}$$ for Critical Real-Time Embedded Systems

An automated framework to support testing for process‐level race conditions

Contact Info

Product

Resources

About