Sciweavers

65 search results - page 3 / 13
» Concurrent Library Correctness on the TSO Memory Model
Sort
View
CAV
2008
Springer
157views Hardware» more  CAV 2008»
13 years 7 months ago
Effective Program Verification for Relaxed Memory Models
Program verification for relaxed memory models is hard. The high degree of nondeterminism in such models challenges standard verification techniques. This paper proposes a new veri...
Sebastian Burckhardt, Madanlal Musuvathi
IPPS
2008
IEEE
13 years 11 months ago
A deterministic multi-way rendezvous library for haskell
The advent of multicore processors requires mainstream concurrent programming languages with high level concurrency constructs and effective debugging techniques. Unfortunately, m...
Nalini Vasudevan, Satnam Singh, Stephen A. Edwards
CAV
2006
Springer
165views Hardware» more  CAV 2006»
13 years 9 months ago
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
Sebastian Burckhardt, Rajeev Alur, Milo M. K. Mart...
SPAA
2005
ACM
13 years 11 months ago
Efficient algorithms for verifying memory consistency
One approach in verifying the correctness of a multiprocessor system is to show that its execution results comply with the memory consistency model it is meant to implement. It ha...
Chaiyasit Manovit, Sudheendra Hangal
ECOOP
2010
Springer
13 years 10 months ago
Correct Refactoring of Concurrent Java Code
Automated refactorings as implemented in modern IDEs for Java usually make no special provisions for concurrent code. Thus, refactored programs may exhibit unexpected new concurren...
Max Schäfer, Julian Dolby, Manu Sridharan, Em...