Sciweavers

29 search results - page 5 / 6
» Static data race detection for concurrent programs with asyn...
Sort
View
SPIN
2000
Springer
13 years 9 months ago
Using Runtime Analysis to Guide Model Checking of Java Programs
This paper describes how two runtime analysis algorithms, an existing data race detection algorithm and a new deadlock detection algorithm, have been implemented to analyze Java pr...
Klaus Havelund
SIGSOFT
2007
ACM
14 years 6 months ago
Programming asynchronous layers with CLARITY
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
Prakash Chandrasekaran, Christopher L. Conway, Jos...
PPOPP
2006
ACM
13 years 11 months ago
Exploiting distributed version concurrency in a transactional memory cluster
We investigate a transactional memory runtime system providing scaling and strong consistency for generic C++ and SQL applications on commodity clusters. We introduce a novel page...
Kaloian Manassiev, Madalin Mihailescu, Cristiana A...
MICRO
2009
IEEE
132views Hardware» more  MICRO 2009»
14 years 12 days ago
Finding concurrency bugs with context-aware communication graphs
Incorrect thread synchronization often leads to concurrency bugs that manifest nondeterministically and are difficult to detect and fix. Past work on detecting concurrency bugs ...
Brandon Lucia, Luis Ceze
SAS
2012
Springer
208views Formal Methods» more  SAS 2012»
11 years 8 months ago
Finding Non-terminating Executions in Distributed Asynchronous Programs
Programming distributed and reactive asynchronous systems is complex due to the lack of synchronization between concurrently executing tasks, and arbitrary delay of message-based c...
Michael Emmi, Akash Lal