Static Deadlock Detection for the SHIM Concurrent Language

Vasudevan, Nalini; Edwards, Stephen A.

doi:10.1109/memcod.2008.4547686

Cited by 14 publications

(14 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is closely related to some of the techniques we have used earlier [28], although we solve a different problem.…”

Section: Introductionmentioning

confidence: 77%

“…Our analysis performs the same preprocessing as our static deadlock detector [28]. It begins by removing bounded recursion using Edwards and Zeng's technique [7].…”

Section: An Examplementioning

confidence: 99%

“…In our previous work [28], we build a synchronous system to find deadlocks in a SHIM program. We make use of the fact that for a particular input sequence, if a SHIM program deadlocks under one schedule it will deadlock under any other.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Buffer sharing in CSP-like programs

Vasudevan¹,

Edwards²

2009

2009 7th IEEE/ACM International Conference on Formal Methods and Models for Co-Design

Self Cite

View full text Add to dashboard Cite

show abstract

“…This is closely related to some of the techniques we have used earlier [28], although we solve a different problem.…”

Section: Introductionmentioning

confidence: 77%

“…Our analysis performs the same preprocessing as our static deadlock detector [28]. It begins by removing bounded recursion using Edwards and Zeng's technique [7].…”

Section: An Examplementioning

confidence: 99%

See 1 more Smart Citation

Buffer sharing in CSP-like programs

Vasudevan¹,

Edwards²

2009

2009 7th IEEE/ACM International Conference on Formal Methods and Models for Co-Design

Self Cite

View full text Add to dashboard Cite

show abstract

“…SHIM does not need to be analyzed under an interleaved model of concurrency since most properties, including deadlock, are preserved across schedules. We [15] therefore used a synchronous model checker NuSMV [1] to detect deadlocks in SHIM-a surprising choice since SHIM's concurrency model is fundamentally asynchronous. We later took a compositional approach [11] in which we build an automaton for a complete system piece by piece.…”

Section: Generating Code From Shimmentioning

confidence: 99%

Ensuring deterministic concurrency through compilation

Vasudevan

Edwards

2010

2010 IEEE International Symposium on Parallel &Amp; Distributed Processing, Workshops and PHD Forum (IPDPSW)

Self Cite

View full text Add to dashboard Cite

Abstract-Multicore shared-memory architectures are becoming prevalent but bring many programming challenges. Among the biggest is non-determinism: the output of the program does not depend merely on the input, but also on scheduling choices taken by the operating system.In this paper, we discuss and propose additional tools that provide determinism guarantees-compilers that generate deterministic code, libraries that provide deterministic constructs, and analyzers that check for determinism. Additionally, we discuss techniques to check for problems like deadlock that can result from the use of these deterministic constructs.

show abstract

“…Vasudevan et al [9] showed that the state space explosion can also be avoided by carefully choosing the primitives of the concurrent programming language. Unfortunately, this restricts the flexibility of the language.…”

Section: Related Workmentioning

confidence: 99%

Compile-Time Analysis and Specialization of Clocks in Concurrent Programs

Vasudevan

Tardieu²,

Dolby³

et al. 2009

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Clocks are a mechanism for providing synchronization barriers in concurrent programming languages. They are usually implemented using primitive communication mechanisms and thus spare the programmer from reasoning about low-level implementation details such as remote procedure calls and error conditions. Clocks provide flexibility, but programs often use them in specific ways that do not require their full implementation. In this paper, we describe a tool that mitigates the overhead of general-purpose clocks by statically analyzing how programs use them and choosing optimized implementations when available. We tackle the clock implementation in the standard library of the X10 programming language-a parallel, distributed object-oriented language. We report our findings for a small set of analyses and benchmarks. Our tool only adds a few seconds to analysis time, making it practical to use as part of a compilation chain.

show abstract

Static Deadlock Detection for the SHIM Concurrent Language

Abstract: Abstract

Cited by 14 publications

References 20 publications

Buffer sharing in CSP-like programs

Buffer sharing in CSP-like programs

Ensuring deterministic concurrency through compilation

Compile-Time Analysis and Specialization of Clocks in Concurrent Programs

Contact Info

Product

Resources

About