35 search results - page 7 / 7 » Static Deadlock Detection for the SHIM Concurrent Language |
PLDI
2009
ACM
13 years 11 months ago
2009
ACM
Data races are one of the most common and subtle causes of pernicious concurrency bugs. Static techniques for preventing data races are overly conservative and do not scale well t...
VEE
2006
ACM
13 years 10 months ago
2006
ACM
The Pi-calculus is a formalism to model and reason about highly concurrent and dynamic systems. Most of the expressive power of the language comes from the ability to pass communi...
PLDI
2006
ACM
13 years 10 months ago
2006
ACM
Atomic blocks allow programmers to delimit sections of code as ‘atomic’, leaving the language’s implementation to enforce atomicity. Existing work has shown how to implement...
PPOPP
2009
ACM
14 years 5 months ago
2009
ACM
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
LCTRTS
2000
Springer
13 years 8 months ago
2000
Springer
The control system of many complex mechatronic products requires for each task the Worst Case Execution Time (WCET), which is needed for the scheduler's admission tests and su...