Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
Low-latency, high-throughput garbage collection
PLDI 2022: Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and ImplementationJune 2022, Pages 76–91https://doi.org/10.1145/3519939.3523440To achieve short pauses, state-of-the-art concurrent copying collectors such as C4, Shenandoah, and ZGC use substantially more CPU cycles and memory than simpler collectors. They suffer from design limitations: i) concurrent copying with inherently ...
- research-articleJune 2018
Write-rationing garbage collection for hybrid memories
PLDI 2018: Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2018, Pages 62–77https://doi.org/10.1145/3192366.3192392Emerging Non-Volatile Memory (NVM) technologies offer high capacity and energy efficiency compared to DRAM, but suffer from limited write endurance and longer latencies. Prior work seeks the best of both technologies by combining DRAM and NVM in hybrid ...
Also Published in:
ACM SIGPLAN Notices: Volume 53 Issue 4, April 2018 - research-articleJune 2017
Debugging probabilistic programs
MAPL 2017: Proceedings of the 1st ACM SIGPLAN International Workshop on Machine Learning and Programming LanguagesJune 2017, Pages 18–26https://doi.org/10.1145/3088525.3088564Many applications compute with estimated and uncertain data. While advances in probabilistic programming help developers build such applications, debugging them remains extremely challenging. New types of errors in probabilistic programs include 1) ...
- research-articleJune 2013
Using managed runtime systems to tolerate holes in wearable memories
PLDI '13: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2013, Pages 297–308https://doi.org/10.1145/2491956.2462171New memory technologies, such as phase-change memory (PCM), promise denser and cheaper main memory, and are expected to displace DRAM. However, many of them experience permanent failures far more quickly than DRAM. DRAM mechanisms that handle permanent ...
Also Published in:
ACM SIGPLAN Notices: Volume 48 Issue 6, June 2013 - research-articleJune 2011
A security policy oracle: detecting security holes using multiple API implementations
PLDI '11: Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2011, Pages 343–354https://doi.org/10.1145/1993498.1993539Even experienced developers struggle to implement security policies correctly. For example, despite 15 years of development, standard Java libraries still suffer from missing and incorrectly applied permission checks, which enable untrusted applications ...
Also Published in:
ACM SIGPLAN Notices: Volume 46 Issue 6, June 2011 - research-articleJune 2011
Systematic editing: generating program transformations from an example
PLDI '11: Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2011, Pages 329–342https://doi.org/10.1145/1993498.1993537Software modifications are often systematic ---they consist of similar, but not identical, program changes to multiple contexts. Existing tools for systematic program transformation are limited because they require programmers to manually prescribe ...
Also Published in:
ACM SIGPLAN Notices: Volume 46 Issue 6, June 2011 - research-articleJune 2010
Efficient, context-sensitive detection of real-world semantic attacks
PLAS '10: Proceedings of the 5th ACM SIGPLAN Workshop on Programming Languages and Analysis for SecurityJune 2010, Article No.: 1, Pages 1–10https://doi.org/10.1145/1814217.1814218Software developers are increasingly choosing memory-safe languages. As a result, semantic vulnerabilities---omitted security checks, misconfigured security policies, and other software design errors---are supplanting memory-corruption exploits as the ...
- research-articleJune 2010
Z-rays: divide arrays and conquer speed and flexibility
PLDI '10: Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2010, Pages 471–482https://doi.org/10.1145/1806596.1806649Arrays are the ubiquitous organization for indexed data. Throughout programming language evolution, implementations have laid out arrays contiguously in memory. This layout is problematic in space and time. It causes heap fragmentation, garbage ...
Also Published in:
ACM SIGPLAN Notices: Volume 45 Issue 6, June 2010 - research-articleJune 2010
PACER: proportional detection of data races
PLDI '10: Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2010, Pages 255–268https://doi.org/10.1145/1806596.1806626Data races indicate serious concurrency bugs such as order, atomicity, and sequential consistency violations. Races are difficult to find and fix, often manifesting only after deployment. The frequency and unpredictability of these bugs will only ...
Also Published in:
ACM SIGPLAN Notices: Volume 45 Issue 6, June 2010 - research-articleJune 2009
Laminar: practical fine-grained decentralized information flow control
PLDI '09: Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2009, Pages 63–74https://doi.org/10.1145/1542476.1542484Decentralized information flow control (DIFC) is a promising model for writing programs with powerful, end-to-end security guarantees. Current DIFC systems that run on commodity hardware can be broadly categorized into two types: language-level and ...
Also Published in:
ACM SIGPLAN Notices: Volume 44 Issue 6, June 2009 - research-articleJune 2009
Dynamic software updates: a VM-centric approach
PLDI '09: Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2009, Pages 1–12https://doi.org/10.1145/1542476.1542478Software evolves to fix bugs and add features. Stopping and restarting programs to apply changes is inconvenient and often costly. Dynamic software updating (DSU) addresses this problem by updating programs while they execute, but existing DSU systems ...
Also Published in:
ACM SIGPLAN Notices: Volume 44 Issue 6, June 2009 - proceedingJune 2007
PLDI '07: Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation
The ACM SIGPLAN Conference on Programming Language and Design has its roots in the 1979 Symposium on Compiler Construction, and has grown to be the premiere conference in its area. While computer science has matured to include many other subfields, the ...
- 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 - ArticleMay 1998
Type-based alias analysis
PLDI '98: Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementationMay 1998, Pages 106–117https://doi.org/10.1145/277650.277670This paper evaluates three alias analyses based on programming language types. The first analysis uses type compatibility to determine aliases. The second extends the first by using additional high-level information such as field names. The third ...
Also Published in:
ACM SIGPLAN Notices: Volume 33 Issue 5, May 1998 - ArticleJune 1995
Tile size selection using cache organization and data layout
PLDI '95: Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementationJune 1995, Pages 279–290https://doi.org/10.1145/207110.207162When dense matrix computations are too large to fit in cache, previous research proposes tiling to reduce or eliminate capacity misses. This paper presents a new algorithm for choosing problem-size dependent tile sizes based on the cache size and cache ...
Also Published in:
ACM SIGPLAN Notices: Volume 30 Issue 6, June 1995