OOPSLA 2012
59 papers
- A black-box approach to understanding concurrency in DaCapo
- A variability-aware module system
- Adaptive multi-level compilation in a trace-based Java JIT compiler
- An abstract interpretation framework for refactoring with application to extract methods with contracts
- An empirical study of the influence of static type systems on the usability of undocumented software
- AutoMan: a platform for integrating human-based and digital computation
- Automatically enhancing locality for tree traversals with traversal splicing
- Automating object transformations for dynamic software updating
- Bolt: on-demand infinite loop escape in unmodified binaries
- Chaperones and impersonators: run-time support for reasonable interposition
- Checking reachability using matching logic
- Constrained kinds
- Dependent types for JavaScript
- Detecting problematic message sequences and frequencies in distributed systems
- Efficiently combining parallel software using fine-grained, language-level, hierarchical resource management policies
- Elixir: a system for synthesizing concurrent graph programs
- Energy types
- Eval begone!: semi-automated removal of eval from javascript programs
- Execution privatization for scheduler-oblivious concurrent programs
- Exploiting inter-sequence correlations for program behavior prediction
- Exploring multi-threaded Java application performance on multicore hardware
- Finding reusable data structures
- Formal specification of a JavaScript module system
- From clarity to efficiency for distributed algorithms
- GPUVerify: a verifier for GPU kernels
- Gradual typing for first-class classes
- Higher-order symbolic execution via contracts
- IFRit: interference-free regions for dynamic data-race detection
- Integrating task parallelism with actors
- Kitsune: efficient, general-purpose dynamic software updating for C
- LEAN: simplifying concurrency bug reproduction via replay-supported execution reduction
- Maple: a coverage-driven testing tool for multithreaded programs
- Mitigating the compiler optimization phase-ordering problem using machine learning
- Modular and verified automatic program repair
- Molecule: using monadic and streaming I/O to compose process networks on the JVM
- On the benefits and pitfalls of extending a statically typed language JIT compiler for dynamic scripting languages
- Open and efficient type switch for C++
- Optimization coaching: optimizers learn to communicate with programmers
- Predicate abstraction of Java programs with collections
- Program extrapolation with jennisys
- Reducing the barriers to writing verified specifications
- Refactoring android Java code for on-demand computation offloading
- Reim & ReImInfer: checking and inference of reference immutability and method purity
- Reusing debugging knowledge via trace-based bug search
- Safe compiler-driven transaction checkpointing and recovery
- Scaling symbolic execution using ranged analysis
- Software data-triggered threads
- Speculative analysis of integrated development environment recommendations
- Talk versus work: characteristics of developer collaboration on the jazz platform
- Taming MATLAB
- The HipHop compiler for PHP
- Towards a practical secure concurrent language
- Type-based safe resource deallocation for shared-memory concurrency
- Typestate-based semantic code search over partial programs
- Understanding the behavior of database operations under program control
- Uniqueness and reference immutability for safe parallelism
- White box sampling in uncertain data processing enabled by program analysis
- Work-stealing without the baggage
- k-Calling context profiling