Effective static deadlock detection

Naik, Mayur; Park, Chang-Seo; Sen, Koushik

doi:10.1109/icse.2009.5070538

Cited by 151 publications

(85 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The algorithm presented in [53] reduces the number of false alarms obtained by a data-flow interprocedural analysis described in the previous paragraph using six conditions. The first four represent results of reachability, alias, escape, and approximated may-happen-in-parallel analyses.…”

Section: Detection Of Deadlocksmentioning

confidence: 99%

A Uniform Classification of Common Concurrency Errors

Fiedor

Bohuslav

ena

et al. 2012

Computer Aided Systems Theory – EUROCAST 2011

View full text Add to dashboard Cite

Abstract. Nowadays, multi-threaded programs are quite common and so are concurrency errors. Many works devoted to detection of concurrency errors have been published in recent years and many of them presented definitions of concurrency errors that the proposed algorithms are able to handle. These definitions are usually expressed in different terms suitable for a description of the particular considered algorithms and they surprisingly often differ from each other in the meaning they assign to particular errors. To help understanding the errors and developing techniques for detecting them, this report strives to provide a uniform taxonomy of concurrency errors common in current programs, with a stress on those written in Java, together with a brief overview of techniques so far proposed for detecting such errors.

show abstract

Section: Detection Of Deadlocksmentioning

confidence: 99%

A Uniform Classification of Common Concurrency Errors

Fiedor

Bohuslav

ena

et al. 2012

Computer Aided Systems Theory – EUROCAST 2011

View full text Add to dashboard Cite

show abstract

“…Its use dates back to 1991 [12] where it was applied to detect deadlocks on Ada programs. It has been also applied in [14] to thread-based programs. There are some fundamental differences between [14] and our work due also in part to the differences between the underlying concurrency models.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

“…It has been also applied in [14] to thread-based programs. There are some fundamental differences between [14] and our work due also in part to the differences between the underlying concurrency models. Their algorithm detects locks due to lock-based synchronization whereas wait-notify in Java is not covered.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

May-Happen-in-Parallel Based Deadlock Analysis for Concurrent Objects

Flores-Montoya

Albert

Genaim

2013

Formal Techniques for Distributed Systems

View full text Add to dashboard Cite

Abstract. We present a novel deadlock analysis for concurrent objects based on the results inferred by a points-to analysis and a may-happenin-parallel (MHP) analysis. Similarly to other analysis, we build a dependency graph such that the absence of cycles in the graph ensures deadlock freeness. An MHP analysis provides an over-approximation of the pairs of program points that may be running in parallel. The crux of the method is that the analysis integrates the MHP information within the dependency graph in order to discard unfeasible cycles that otherwise would lead to false positives. We argue that our analysis is more precise and/or efficient than previous proposals for deadlock analysis of concurrent objects. As regards accuracy, we are able to handle cases that other analyses have pointed out as challenges. As regards efficiency, the complexity of our deadlock analysis is polynomial.

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

Effective static deadlock detection

Cited by 151 publications

References 12 publications

A Uniform Classification of Common Concurrency Errors

A Uniform Classification of Common Concurrency Errors

May-Happen-in-Parallel Based Deadlock Analysis for Concurrent Objects

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

Contact Info

Product

Resources

About