PLDI 2008
34 papers
- A practical automatic polyhedral parallelizer and locality optimizer
- A study of concurrent real-time garbage collectors
- Automatic volume management for programmable microfluidics
- Bootstrapping: a technique for scalable flow and context-sensitive pointer alias analysis
- Certifying low-level programs with hardware interrupts and preemptive threads
- Checking race freedom via linear programming
- Conditional correlation analysis for safe region-based memory management
- Copy coalescing by graph recoloring
- Dataflow analysis for concurrent programs using datarace detection
- Deriving linearizable fine-grained concurrent objects
- Discovering properties about arrays in simple programs
- Efficient program execution indexing
- Explaining failures of program analyses
- Expressive and safe static reflection with MorphJ
- Fair stateless model checking
- Foundations of the C++ concurrency memory model
- Full functional verification of linked data structures
- Grammar-based whitebox fuzzing
- Immix: a mark-region garbage collector with space efficiency, fast collection, and mutator performance
- Inferring locks for atomic sections
- Iterative optimization in the polyhedral model: part ii, multidimensional time
- Liquid types
- Model checking transactional memories
- Orchestrating the execution of stream programs on multicore platforms
- Program analysis as constraint solving
- Quantitative information flow as network flow capacity
- Race directed random testing of concurrent programs
- Register allocation by puzzle solving
- SharC: checking data sharing strategies for multithreaded C
- Sketching concurrent data structures
- Sound, complete and scalable path-sensitive analysis
- Type-preserving compilation for large-scale optimizing object-oriented compilers
- Velodrome: a sound and complete dynamic atomicity checker for multithreaded programs
- XMem: type-safe, transparent, shared memory for cross-runtime communication and coordination