Sciweavers

11213 search results - page 11 / 2243
» Low-contention data structures
Sort
View
USS
2010
13 years 7 months ago
Structuring Protocol Implementations to Protect Sensitive Data
In a bid to limit the harm caused by ubiquitous remotely exploitable software vulnerabilities, the computer systems security community has proposed primitives to allow execution o...
Petr Marchenko, Brad Karp
POPL
2011
ACM
13 years 20 days ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
EDBT
2012
ACM
306views Database» more  EDBT 2012»
12 years 6 days ago
Clydesdale: structured data processing on MapReduce
MapReduce has emerged as a promising architecture for large scale data analytics on commodity clusters. The rapid adoption of Hive, a SQL-like data processing language on Hadoop (...
Tim Kaldewey, Eugene J. Shekita, Sandeep Tata
FAST
2011
13 years 1 months ago
Consistent and Durable Data Structures for Non-Volatile Byte-Addressable Memory
The predicted shift to non-volatile, byte-addressable memory (e.g., Phase Change Memory and Memristor), the growth of “big data”, and the subsequent emergence of frameworks su...
Shivaram Venkataraman, Niraj Tolia, Parthasarathy ...
ICST
2011
IEEE
13 years 1 months ago
Constraint-Based Program Debugging Using Data Structure Repair
—Developers have used data structure repair over the last few decades as an effective means to recover on-the-fly from errors in program state. Traditional repair techniques wer...
Muhammad Zubair Malik, Junaid Haroon Siddiqui, Sar...