Sciweavers

39 search results - page 2 / 8
» Completeness and Nondeterminism in Model Checking Transactio...
Sort
View
113
Voted
DC
2010
15 years 10 days ago
Model checking transactional memories
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh
120
Voted
IPPS
2010
IEEE
14 years 9 months ago
Runtime checking of serializability in software transactional memory
Abstract--Ensuring the correctness of complex implementations of software transactional memory (STM) is a daunting task. Attempts have been made to formally verify STMs, but these ...
Arnab Sinha, Sharad Malik
103
Voted
OSDI
2008
ACM
16 years 16 days ago
Transactional Flash
Transactional flash (TxFlash) is a novel solid-state drive (SSD) that uses flash memory and exports a transactional interface (WriteAtomic) to the higher-level software. The copy-...
Vijayan Prabhakaran, Thomas L. Rodeheffer, Lidong ...
116
Voted
VMCAI
2009
Springer
15 years 7 months ago
An Abort-Aware Model of Transactional Programming
There has been a lot of recent research on transaction-based concurrent programming, aimed at offering an easier concurrent programming paradigm that enables programmers to better...
Kousha Etessami, Patrice Godefroid
ICECCS
2010
IEEE
196views Hardware» more  ICECCS 2010»
15 years 13 days ago
Implementing and Evaluating a Model Checker for Transactional Memory Systems
Abstract—Transactional Memory (TM) is a promising technique that addresses the difficulty of parallel programming. Since TM takes responsibility for all concurrency control, TM ...
Woongki Baek, Nathan Grasso Bronson, Christos Kozy...