OOPSLA 2014
52 papers
- ASPIRE: exploiting asynchronous parallelism in iterative algorithms using a relaxed consistency based DSM
- Abstract semantic differencing via speculative correlation
- Accelerating iterators in optimizing AST interpreters
- Adaptive LL(*) parsing: the power of dynamic analysis
- Alembic: automatic locality extraction via migration
- An experimental survey of energy management across the stack
- Atlas: leveraging locks for non-volatile memory consistency
- Automated migration of build scripts using dynamic analysis and search-based refactoring
- Bounded exhaustive test input generation from hybrid invariants
- Call sequence prediction through probabilistic calling automata
- CheckCell: data debugging for spreadsheets
- Checking correctness of TypeScript interfaces for JavaScript libraries
- Chisel: reliability- and accuracy-aware optimization of approximate computational kernels
- Compiler verification meets cross-language linking via data abstraction
- Confined gradual typing
- Continuously measuring critical section pressure with the free-lunch profiler
- Cybertron: pushing the limit on I/O reduction in data-parallel programs
- Determinacy in static analysis for jQuery
- Distributed REScala: an update algorithm for distributed reactive programming
- Efficient subcubic alias analysis for C
- EventBreak: analyzing the responsiveness of user interfaces through performance-guided test generation
- Fast conservative garbage collection
- Fast splittable pseudorandom number generators
- Finding minimum type error sources
- Flint: fixing linearizability violations
- Foundations of path-dependent types
- From object algebras to attribute grammars
- GPS: navigating weak memory with ghosts, protocols, and separation
- Late data layout: unifying data representation transformations
- MIX10: compiling MATLAB to X10 for high performance
- Multithreaded test synthesis for deadlock detection
- Natural proofs for asynchronous programs using almost-synchronous reductions
- Phosphor: illuminating dynamic data flow in commodity jvms
- Rate types for stream programs
- Refactoring Java generics by inferring wildcards, in practice
- Region-based memory management for GPU programming languages: enabling rich data structures on a spartan host
- Rubah: DSU for Java on a stock JVM
- Smten with satisfiability-based search
- Space-efficient multi-versioning for input-adaptive feedback-driven program optimizations
- Staged parser combinators for efficient data processing
- Static analysis for independent app developers
- Statistical debugging for real-world performance problems
- StreamJIT: a commensal compiler for high-performance stream programming
- SurveyMan: programming and automatically debugging surveys
- Symbolic execution of multithreaded programs from arbitrary program contexts
- Tardis: affordable time-travel debugging in managed runtimes
- The hiphop virtual machine
- Translating imperative code to MapReduce
- Understanding energy behaviors of thread management constructs
- Using web corpus statistics for program analysis
- Validation of memory accesses through symbolic analyses
- i3QL: language-integrated live data views