PLDI 2010
42 papers
- 2010 Athena lecture
- A GPGPU compiler for memory optimization and parallelism management
- A context-free markup language for semi-structured text
- Adversarial memory for detecting destructive races
- An analysis of the dynamic behavior of JavaScript programs
- Bamboo: a data-centric, object-oriented approach to many-core software
- Breadcrumbs: efficient context sensitivity for dynamic bug detection analyses
- Bringing extensibility to verified compilers
- Cache topology aware computation mapping for multicores
- Complete functional synthesis
- Composing parallel software efficiently with lithe
- DRFX: a simple and efficient memory model for concurrent programming languages
- Decoupled lifeguards: enabling path optimizations for dynamic correctness checking tools
- Detecting inefficiently-used containers to avoid bloat
- Evaluating iterative optimization across 1000 datasets
- Evaluating the accuracy of Java profilers
- Finding low-utility data structures
- FlumeJava: easy, efficient data-parallel pipelines
- GUESSTIMATE: a programming model for collaborative distributed systems
- Green: a framework for supporting energy-conscious programming using controlled approximation
- Inferable object-oriented typed assembly language
- Jinn: synthesizing dynamic bug detectors for foreign language interfaces
- Line-up: a complete and automatic linearizability checker
- Lock elision for read-only critical sections in Java
- MemSAT: checking axiomatic specifications of memory models
- Mint: Java multi-stage programming using weak separability
- Mixing type checking and symbolic execution
- PACER: proportional detection of data races
- Parameterized verification of transactional memories
- Printing floating-point numbers quickly and accurately with integers
- Resolving and exploiting the k-CFA paradox: illuminating functional vs. object-oriented program analysis
- Safe programmable speculative parallelism
- Safe to the last instruction: automated verification of a type-safe operating system
- Schism: fragmentation-tolerant real-time garbage collection
- Smooth interpretation
- Software data spreading: leveraging distributed caches to improve single thread performance
- Supporting speculative parallelization in the presence of dynamic data structures
- The reachability-bound problem
- Traceable data types for self-adjusting computation
- Type-preserving compilation of end-to-end verification of security enforcement
- Ur: statically-typed metaprogramming with type-level record computation
- Z-rays: divide arrays and conquer speed and flexibility