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 2015
FlashRelate: extracting relational data from semi-structured spreadsheets using examples
PLDI '15: Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2015, Pages 218–228https://doi.org/10.1145/2737924.2737952With hundreds of millions of users, spreadsheets are one of the most important end-user applications. Spreadsheets are easy to use and allow users great flexibility in storing data. This flexibility comes at a price: users often treat spreadsheets as a ...
Also Published in:
ACM SIGPLAN Notices: Volume 50 Issue 6, June 2015 - proceedingJune 2010
PLDI '10: Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation
We are pleased to present the proceedings of the ACM SIGPLAN 2010 Conference on Programming Language Design and Implementation. PLDI addresses all issues relevant to the design of programming languages, the theory and practice of associated software ...
- research-articleJune 2009
Efficiently and precisely locating memory leaks and bloat
PLDI '09: Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2009, Pages 397–407https://doi.org/10.1145/1542476.1542521Inefficient use of memory, including leaks and bloat, remain a significant challenge for C and C++ developers. Applications with these problems become slower over time as their working set grows and can become unresponsive. At the same time, memory ...
Also Published in:
ACM SIGPLAN Notices: Volume 44 Issue 6, June 2009 - ArticleJune 2007
Exterminator: automatically correcting memory errors with high probability
PLDI '07: Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2007, Pages 1–11https://doi.org/10.1145/1250734.1250736Programs written in C and C++ are susceptible to memory errors, including buffer overflows and dangling pointers. These errors, whichcan lead to crashes, erroneous execution, and security vulnerabilities, are notoriously costly to repair. Tracking down ...
Also Published in:
ACM SIGPLAN Notices: Volume 42 Issue 6, June 2007 - ArticleJune 2006
DieHard: probabilistic memory safety for unsafe languages
PLDI '06: Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2006, Pages 158–168https://doi.org/10.1145/1133981.1134000Applications written in unsafe languages like C and C++ are vulnerable to memory errors such as buffer overflows, dangling pointers, and reads of uninitialized data. Such errors can lead to program crashes, security vulnerabilities, and unpredictable ...
Also Published in:
ACM SIGPLAN Notices: Volume 41 Issue 6, June 2006 - ArticleMay 2001
Composing high-performance memory allocators
PLDI '01: Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementationJune 2001, Pages 114–124https://doi.org/10.1145/378795.378821Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 5, May 2001 - ArticleJune 1995
Garbage collection using a dynamic threatening boundary
PLDI '95: Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementationJune 1995, Pages 301–314https://doi.org/10.1145/207110.207164Generational techniques have been very successful in reducing the impact of garbage collection algorithms upon the performance of programs. However, all generational algorithms occasionally promote objects that later become garbage, resulting in an ...
Also Published in:
ACM SIGPLAN Notices: Volume 30 Issue 6, June 1995 - ArticleJune 1995
Corpus-based static branch prediction
PLDI '95: Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementationJune 1995, Pages 79–92https://doi.org/10.1145/207110.207118Correctly predicting the direction that branches will take is increasingly important in today's wide-issue computer architectures. The name program-based branch prediction is given to static branch prediction techniques that base their prediction on a ...
Also Published in:
ACM SIGPLAN Notices: Volume 30 Issue 6, June 1995 - ArticleJune 1993
Using lifetime predictors to improve memory allocation performance
PLDI '93: Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementationAugust 1993, Pages 187–196https://doi.org/10.1145/155090.155108Dynamic storage allocation is used heavily in many application areas including interpreters, simulators, optimizers, and translators. We describe research that can improve all aspects of the performance of dynamic storage allocation by predicting the ...
Also Published in:
ACM SIGPLAN Notices: Volume 28 Issue 6, June 1993 - ArticleJune 1993
Improving the cache locality of memory allocation
PLDI '93: Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementationAugust 1993, Pages 177–186https://doi.org/10.1145/155090.155107The allocation and disposal of memory is a ubiquitous operation in most programs. Rarely do programmers concern themselves with details of memory allocators; most assume that memory allocators provided by the system perform well. This paper presents a ...
Also Published in:
ACM SIGPLAN Notices: Volume 28 Issue 6, June 1993