PLDI 2009
41 papers
- A decision procedure for subset constraints over regular languages
- A randomized dynamic program analysis technique for detecting real deadlocks
- A study of memory management for web-based applications on multicore processors
- An integrated proof language for imperative programs
- Analyzing recursive programs using a fixed-point calculus
- Automatic generation of library bindings using static analysis
- Binary analysis for measurement and attribution of program performance
- CEAL: a C-based language for self-adjusting computation
- Chameleon: adaptive selection of collections
- Control-flow refinement and progress invariants for bound analysis
- Dynamic software updates: a VM-centric approach
- Efficiently and precisely locating memory leaks and bloat
- Error propagation analysis for file systems
- FastTrack: efficient and precise dynamic race detection
- GC assertions: using the garbage collector to check heap properties
- Go with the flow: profiling copies to find runtime bloat
- Implementation of the memory-safe full ANSI-C compiler
- Laminar: practical fine-grained decentralized information flow control
- Lightweight annotations for controlling sharing in concurrent data structures
- LiteRace: effective sampling for lightweight data-race detection
- Merlin: specification inference for explicit information flow problems
- Parallelizing sequential applications on commodity hardware using a low-cost software transactional memory
- PetaBricks: a language and compiler for algorithmic choice
- Program verification using templates over predicate abstraction
- Programming model for a heterogeneous x86 platform
- Progress guarantee for parallel programs via bounded lock-freedom
- Proving optimizations correct using parameterized program equivalence
- Safe and timely updates to multi-threaded programs
- Semantics-aware trace analysis
- Sharing classes between families
- Snugglebug: a powerful approach to weakest preconditions
- SoftBound: highly compatible and complete spatial memory safety for c
- Staged information flow for javascript
- Stretching transactional memory
- TAJ: effective taint analysis of web applications
- Towards a holistic approach to auto-parallelization: integrating profile-driven parallelism detection and machine-learning based mapping
- Trace-based just-in-time type specialization for dynamic languages
- Type-based data structure verification
- Typed self-representation
- Verifiable composition of deterministic grammars
- Verified validation of lazy code motion