Sciweavers

ESOP
2012
Springer
12 years 7 months ago
Generate, Test, and Aggregate - A Calculation-based Framework for Systematic Parallel Programming with MapReduce
Abstract. MapReduce, being inspired by the map and reduce primitives available in many functional languages, is the de facto standard for large scale data-intensive parallel progra...
Kento Emoto, Sebastian Fischer, Zhenjiang Hu
ESOP
2012
Springer
12 years 7 months ago
Complete Monitors for Behavioral Contracts
Abstract. A behavioral contract in a higher-order language may invoke methods of unknown objects. Although this expressive power allows programmers to formulate sophisticated contr...
Christos Dimoulas, Sam Tobin-Hochstadt, Matthias F...
ESOP
2012
Springer
12 years 7 months ago
The Call-by-Need Lambda Calculus, Revisited
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
Stephen Chang, Matthias Felleisen
ESOP
2012
Springer
12 years 7 months ago
Concurrent Library Correctness on the TSO Memory Model
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it is only appropriate for sequentially consistent mem...
Sebastian Burckhardt, Alexey Gotsman, Madanlal Mus...
ESOP
2012
Springer
12 years 7 months ago
Multiparty Session Types Meet Communicating Automata
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...
Pierre-Malo Deniélou, Nobuko Yoshida
ESOP
2012
Springer
12 years 7 months ago
GMeta: A Generic Formal Metatheory Framework for First-Order Representations
Abstract. This paper presents GMeta: a generic framework for firstorder representations of variable binding that provides once and for all many of the so-called infrastructure lem...
Gyesik Lee, Bruno C. D. S. Oliveira, Sungkeun Cho,...
ESOP
2012
Springer
12 years 7 months ago
Reasoning about Lock Placements
A lock placement describes, for each heap location, which lock guards the location, and under what circumstances. We formalize methods for reasoning about lock placements, making p...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...