Sciweavers

118 search results - page 3 / 24
» Specifying and checking semantic atomicity for multithreaded...
Sort
View
ISSTA
2004
ACM
13 years 11 months ago
Exploiting purity for atomicity
The notion that certain procedures are atomic is a fundamental correctness property of many multithreaded software systems. A procedure is atomic if for every execution there is a...
Cormac Flanagan, Stephen N. Freund, Shaz Qadeer
KBSE
2008
IEEE
13 years 12 months ago
Predictive Typestate Checking of Multithreaded Java Programs
—Writing correct multithreaded programs is difficult. Existing tools for finding bugs in multithreaded programs primarily focus on finding generic concurrency problems such as...
Pallavi Joshi, Koushik Sen
TLDI
2003
ACM
121views Formal Methods» more  TLDI 2003»
13 years 10 months ago
Types for atomicity
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected and nondeterministic interactions between threads. Previous work has addresse...
Cormac Flanagan, Shaz Qadeer
SSS
2007
Springer
117views Control Systems» more  SSS 2007»
13 years 11 months ago
Distributed Synthesis of Fault-Tolerant Programs in the High Atomicity Model
In this paper, we concentrate on distributed algorithms for automated synthesis of fault-tolerant programs in the high atomicity model, where all processes can read and write all p...
Borzoo Bonakdarpour, Sandeep S. Kulkarni, Fuad Abu...
TLDI
2005
ACM
126views Formal Methods» more  TLDI 2005»
13 years 11 months ago
Type inference for atomicity
Atomicity is a fundamental correctness property in multithreaded programs. This paper presents an algorithm for verifying atomicity via type inference. The underlying type system ...
Cormac Flanagan, Stephen N. Freund, Marina Lifshin