Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJune 2017
An ELI-to-C compiler: design, implementation, and performance
ARRAY 2017: Proceedings of the 4th ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array ProgrammingPages 9–16https://doi.org/10.1145/3091966.3091969ELI is a succinct array-based interactive programming language derived from APL. In this paper we present the overall design and implementation of a bootstrapped ELI-to-C compiler which is implemented in ELI. We provide a brief introduction to the ELI ...
- short-paperJune 2015
Velociraptor: a compiler toolkit for array-based languages targeting CPUs and GPUs
ARRAY 2015: Proceedings of the 2nd ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array ProgrammingPages 19–24https://doi.org/10.1145/2774959.2774967We present a toolkit called Velociraptor that can be used by compiler writers to quickly build compilers and other tools for array-based languages. Velociraptor operates on its own unique intermediate representation (IR) designed to support a variety ...
- tutorialJune 2014
Just-in-time shape inference for array-based languages
ARRAY'14: Proceedings of ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array ProgrammingPages 50–55https://doi.org/10.1145/2627373.2627382In dynamic array-based languages, the most computationally intensive parts of the program often involve either explicit loops or vector operations. These loops and vector operations can be better optimized if the compiler has accurate information about ...
- research-articleJune 2013
First steps to compiling Matlab to X10
X10 '13: Proceedings of the third ACM SIGPLAN X10 WorkshopPages 2–11https://doi.org/10.1145/2481268.2481273Matlab is a popular dynamic array-based language commonly used by students, scientists and engineers, who appreciate the interactive development style, the rich set of array operators, the extensive builtin library, and the fact that they do not have to ...
- ArticleJune 2005
Optimising aspectJ
- Pavel Avgustinov,
- Aske Simon Christensen,
- Laurie Hendren,
- Sascha Kuzins,
- Jennifer Lhoták,
- Ondřej Lhoták,
- Oege de Moor,
- Damien Sereni,
- Ganesh Sittampalam,
- Julian Tibble
PLDI '05: Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementationPages 117–128https://doi.org/10.1145/1065010.1065026AspectJ, an aspect-oriented extension of Java, is becoming increasingly popular. However, not much work has been directed at optimising compilers for AspectJ. Optimising AOP languages provides many new and interesting challenges for compiler writers, ...
Also Published in:
ACM SIGPLAN Notices: Volume 40 Issue 6 - ArticleJune 2004
Jedd: a BDD-based relational extension of Java
PLDI '04: Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementationPages 158–169https://doi.org/10.1145/996841.996861In this paper we present Jedd, a language extension to Java that supports a convenient way of programming with Binary Decision Diagrams (BDDs). The Jedd language abstracts BDDs as database-style relations and operations on relations, and provides static ...
Also Published in:
ACM SIGPLAN Notices: Volume 39 Issue 6 - ArticleMay 2003
Points-to analysis using BDDs
PLDI '03: Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementationPages 103–114https://doi.org/10.1145/781131.781144This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs). In the model checking community, BDDs have been shown very effective for representing large sets and solving very large ...
Also Published in:
ACM SIGPLAN Notices: Volume 38 Issue 5 - proceedingJune 2002
PLDI '02: Proceedings of the ACM SIGPLAN 2002 conference on Programming language design and implementation
The program committee is pleased to present this proceedings of the 2002 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2002). PLDI 2002 was held June 17--19, 2002, in Berlin, Germany, marking the first time that the ...
- ArticleMay 1998
Communication optimizations for parallel C programs
PLDI '98: Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementationPages 199–211https://doi.org/10.1145/277650.277723This paper presents algorithms for reducing the communication overhead for parallel C programs that use dynamically-allocated data structures. The framework consists of an analysis phase called possible-placement analysis, and a transformation phase ...
Also Published in:
ACM SIGPLAN Notices: Volume 33 Issue 5 - ArticleJune 1994
Context-sensitive interprocedural points-to analysis in the presence of function pointers
PLDI '94: Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementationPages 242–256https://doi.org/10.1145/178243.178264This paper reports on the design, implementation, and empirical results of a new method for dealing with the aliasing problem in C. The method is based on approximating the points-to relationships between accessible stack locations, and can be used to ...
Also Published in:
ACM SIGPLAN Notices: Volume 29 Issue 6 - ArticleJune 1994
A general data dependence test for dynamic, pointer-based data structures
PLDI '94: Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementationPages 218–229https://doi.org/10.1145/178243.178262Optimizing compilers require accurate dependence testing to enable numerous, performance-enhancing transformations. However, data dependence testing is a difficult problem, particularly in the presence of pointers. Though existing approaches work well ...
Also Published in:
ACM SIGPLAN Notices: Volume 29 Issue 6 - ArticleJuly 1992
Abstractions for recursive pointer data structures: improving the analysis and transformation of imperative programs
PLDI '92: Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementationPages 249–260https://doi.org/10.1145/143095.143138Even though impressive progress has been made in the area of optimizing and parallelizing programs with arrays, the application of similar techniques to programs with pointer data structures has remained difficult. In this paper we introduce a new ...
Also Published in:
ACM SIGPLAN Notices: Volume 27 Issue 7