Sciweavers

79
Voted
POPL
2015
ACM
9 years 11 months ago
A Calculus for Relaxed Memory
We propose a new approach to programming multi-core, relaxed-memory architectures in imperative, portable programming languages. Our memory model is based on explicit, programmer-...
Karl Crary, Michael J. Sullivan
81
Voted
POPL
2015
ACM
9 years 11 months ago
Ur/Web: A Simple Model for Programming the Web
The World Wide Web has evolved gradually from a document delivery platform to an architecture for distributed programming. This largely unplanned evolution is apparent in the set ...
Adam Chlipala
POPL
2015
ACM
9 years 11 months ago
A Scalable, Correct Time-Stamped Stack
Concurrent data-structures, such as stacks, queues, and deques, often implicitly enforce a total order over elements in their underlying memory layout. However, much of this order...
Mike Dodds, Andreas Haas, Christoph M. Kirsch
POPL
2015
ACM
9 years 11 months ago
Decentralizing SDN Policies
Software-defined networking (SDN) is a new paradigm for operating and managing computer networks. SDN enables logicallycentralized control over network devices through a “contr...
Oded Padon, Neil Immerman, Aleksandr Karbyshev, Or...
82
Voted
POPL
2015
ACM
9 years 11 months ago
Proof Spaces for Unbounded Parallelism
In this paper, we present a new approach to automatically verify multi-threaded programs which are executed by an unbounded number of threads running in parallel. The starting poi...
Azadeh Farzan, Zachary Kincaid, Andreas Podelski