We describe a system that uses automated planning to synthesize correct and efficient parallel graph programs from high-level algorithmic specifications. Automated planning allo...
Dimitrios Prountzos, Roman Manevich, Keshav Pingal...
We present an approach for compiling a rich subset of APL into dataparallel programs that can be executed on GPUs. The compiler is based on the APLTAIL compiler, which compiles AP...
Fusion is a program optimisation technique commonly implemented using special-purpose compiler support. In this paper, we present an alternative approach, implementing fold-based ...
We present a method for example-guided synthesis of functional programs over recursive data structures. Given a set of input-output examples, our method synthesizes a program in a...
In the X10 language, computations are modeled as lightweight threads called activities. Since most operating systems only offer relatively heavyweight kernel-level threads, the X1...
Manuel Mohr, Sebastian Buchwald, Andreas Zwinkau, ...
We propose the APGAS library for Java 8. Inspired by the core constructs and semantics of the Resilient X10 programming language, APGAS brings many benefits of the X10 programmin...
Distributed systems are difficult to implement correctly because they must handle both concurrency and failures: machines may crash at arbitrary points and networks may reorder, ...
James R. Wilcox, Doug Woos, Pavel Panchekha, Zacha...
We present Code Phage (CP), a system for automatically transferring correct code from donor applications into recipient applications that process the same inputs to successfully e...
Stelios Sidiroglou-Douskos, Eric Lahtinen, Fan Lon...
Subtle concurrency errors in multithreaded libraries that arise because of incorrect or inadequate synchronization are often difficult to pinpoint precisely using only static tech...