OOPSLA 2016
52 papers
- A compiler for throughput optimization of graph algorithms on GPUs
- A practical framework for type inference error explanation
- Accelerating program analyses by cross-program training
- An improved algorithm for slicing machine code
- An operational semantics for C/C++11 concurrency
- Apex: automatic programming assignment error explanation
- Asserting reliable convergence for configuration management scripts
- Automated reasoning for web page layout
- Automatic enforcement of expressive security policies using enclaves
- Automatic parallelization of pure method calls via conditional future synthesis
- Call graphs for languages with parametric polymorphism
- Chain: tasks and channels for reliable intermittent programs
- Computing repair alternatives for malformed programs using constraint attribute grammars
- Dependent partitioning
- Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations
- Directed synthesis of failing concurrent executions
- Dynamically diagnosing type errors in unsafe code
- Efficient and thread-safe objects for dynamically-typed languages
- Extensible access control with authorization contracts
- FIDEX: filtering spreadsheet data using examples
- Finding compiler bugs via live code mutation
- Finding resume and restart errors in Android applications
- First-class effect reflection for effect-guided programming
- GEMs: shared-memory parallel programming for Node.js
- Gentrification gone too far? affordable 2nd-class values for fun and (co-)effect
- Hoare-style specifications as correctness conditions for non-linearizable concurrent objects
- Hybrid STM/HTM for nested transactions on OpenJDK
- Incremental forest: a DSL for efficiently managing filestores
- Java and scala's type systems are unsound: the existential crisis of null pointers
- LaCasa: lightweight affinity and object capabilities in Scala
- Low-overhead and fully automated statistical debugging with abstraction refinement
- Makalu: fast recoverable allocation of non-volatile memory
- Maximal causality reduction for TSO and PSO
- Modeling and analysis of remote memory access programming
- OrcO: a concurrency-first approach to objects
- Parallel incremental whole-program optimizations for Scala.js
- Parsing with first-class derivatives
- Portable inter-workgroup barrier synchronisation for GPUs
- Precise and maximal race detection from incomplete traces
- Prioritized garbage collection: explicit GC support for software caches
- Probabilistic model for code with decision trees
- Purposes, concepts, misfits, and a redesign of git
- Ringer: web automation by demonstration
- Scalable verification of border gateway protocol configurations with an SMT solver
- Semantic subtyping for imperative object-oriented languages
- Semantics-based program verifiers for all languages
- Speeding up machine-code synthesis
- Stateless model checking with data-race preemption points
- The missing link: explaining ELF static linking, semantically
- To be precise: regression aware debugging
- Type inference for static compilation of JavaScript
- Type soundness for dependent object types (DOT)