OOPSLA 2013
50 papers
- Ball-Larus path profiling across multiple loop iterations
- Barrier invariants: a shared state abstraction for the analysis of data-dependent GPU kernels
- Bottle graphs: visualizing scalability bottlenecks in multi-threaded applications
- Bounded partial-order reduction
- CDSchecker: checking concurrent data structures written with C/C++ atomics
- Class hierarchy complementation: soundly completing a partial type graph
- Code optimizations using formally verified properties
- Combining concern input with program analysis for bloat detection
- Data-driven equivalence checking
- Detecting API documentation errors
- Do developers benefit from generic types?: an empirical comparison of generic and raw types in java
- Effective race detection for event-driven programs
- Efficient concurrency-bug detection across inputs
- Efficient context sensitivity for dynamic analyses via calling context uptrees and customized memory management
- Empirical analysis of programming language adoption
- Flexible access control for javascript
- Forsaking inheritance: supercharged delegation in DelphJ
- Fully concurrent garbage collection of actors on many-core machines
- Guided GUI testing of android apps with minimal restart and approximate learning
- Inductive invariant generation via abductive inference
- Injecting mechanical faults to localize developer faults for evolving software
- Input-covering schedules for multithreaded programs
- Instant pickles: generating object-oriented pickler combinators for fast and extensible serialization
- Interacting with dead objects
- Ironclad C++: a library-augmented type-safe subset of c++
- Isolation for nested task parallelism
- Language support for dynamic, hierarchical data partitioning
- Miniboxing: improving the speed to code size tradeoff in parametric polymorphism translations
- MrCrypt: static analysis for secure cloud computations
- Multiverse: efficiently supporting distributed high-level speculation
- OCTET: capturing and controlling cross-thread dependences efficiently
- On-the-fly capacity planning
- On-the-fly detection of instability problems in floating-point program execution
- Online feedback-directed optimizations for parallel Java code
- Option contracts
- Python: the full monty
- Refactoring with synthesis
- Relaxed separation logic: a program logic for C11 concurrency
- Resurrector: a tunable object lifetime profiling technique for optimizing real-world programs
- River trail: a path to parallelism in JavaScript
- Semi-automatic rename refactoring for JavaScript
- Set-based pre-processing for points-to analysis
- Steering symbolic execution to less traveled paths
- Storage strategies for collections in dynamically typed languages
- Synthesis modulo recursive functions
- Taking off the gloves with reference counting Immix
- Targeted and depth-first exploration for systematic testing of android apps
- The latency, accuracy, and battery (LAB) abstraction: programmer productivity and energy efficiency for continuous mobile context sensing
- Turning nondeterminism into parallelism
- Verifying quantitative reliability for programs that execute on unreliable hardware