Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
Responsive parallelism with futures and state
PLDI 2020: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 577–591https://doi.org/10.1145/3385412.3386013Motivated by the increasing shift to multicore computers, recent work has developed language support for responsive parallel applications that mix compute-intensive tasks with latency-sensitive, usually interactive, tasks. These developments include ...
Reactive probabilistic programming
PLDI 2020: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 898–912https://doi.org/10.1145/3385412.3386009Synchronous modeling is at the heart of programming languages like Lustre, Esterel, or Scade used routinely for implementing safety critical control software, e.g., fly-by-wire and engine control in planes. However, to date these languages have had ...
FreezeML: complete and easy type inference for first-class polymorphism
PLDI 2020: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 423–437https://doi.org/10.1145/3385412.3386003ML is remarkable in providing statically typed polymorphism without the programmer ever having to write any type annotations. The cost of this parsimony is that the programmer is limited to a form of polymorphism in which quantifiers can occur only at ...
- research-articleJune 2020
From folklore to fact: comparing implementations of stacks and continuations
PLDI 2020: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 75–90https://doi.org/10.1145/3385412.3385994The efficient implementation of function calls and non-local control transfers is a critical part of modern language implementations and is important in the implementation of everything from recursion, higher-order functions, concurrency and coroutines, ...
- research-articleJune 2020
HipHop.js: (A)Synchronous reactive web programming
PLDI 2020: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 533–545https://doi.org/10.1145/3385412.3385984We present HipHop.js, a synchronous reactive language that adds synchronous concurrency and preemption to JavaScript. Inspired from Esterel, HipHop.js simplifies the programming of non-trivial temporal behaviors as found in complex web interfaces or IoT ...
Type-directed scheduling of streaming accelerators
- David Durst,
- Matthew Feldman,
- Dillon Huff,
- David Akeley,
- Ross Daly,
- Gilbert Louis Bernstein,
- Marco Patrignani,
- Kayvon Fatahalian,
- Pat Hanrahan
PLDI 2020: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 408–422https://doi.org/10.1145/3385412.3385983Designing efficient, application-specialized hardware accelerators requires assessing trade-offs between a hardware module’s performance and resource requirements. To facilitate hardware design space exploration, we describe Aetherling, a system for ...
- research-articleJune 2020
Armada: low-effort verification of high-performance concurrent programs
- Jacob R. Lorch,
- Yixuan Chen,
- Manos Kapritsos,
- Bryan Parno,
- Shaz Qadeer,
- Upamanyu Sharma,
- James R. Wilcox,
- Xueyuan Zhao
PLDI 2020: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 197–210https://doi.org/10.1145/3385412.3385971Safely writing high-performance concurrent programs is notoriously difficult. To aid developers, we introduce Armada, a language and tool designed to formally verify such programs with relatively little effort. Via a C-like language and a small-step, ...
Decidable verification under a causally consistent shared memory
PLDI 2020: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 211–226https://doi.org/10.1145/3385412.3385966Causal consistency is one of the most fundamental and widely used consistency models weaker than sequential consistency. In this paper, we study the verification of safety properties for finite-state concurrent programs running under a causally ...