OOPSLA 2015
53 papers
- A co-contextual formulation of type rules and its application to incremental type checking
- A sound and optimal incremental build system with dynamic dependencies
- Accurate profiling in the presence of dynamic compilation
- Approximate computation with outlier detection in Topaz
- AutoMO: automatic inference of memory order parameters for C/C++11
- Automated backward error analysis for numerical code
- Automatic memory reclamation for lock-free data structures
- Automating ad hoc data representation transformations
- Automating grammar comparison
- Checks and balances: constraint solving without surprises in object-constraint programming languages
- Conditionally correct superoptimization
- Cross-layer memory management for managed language applications
- Customizable gradual polymorphic effects for Scala
- Declarative fence insertion
- Detecting redundant CSS rules in HTML5 applications: a tree rewriting approach
- Disjointness domains for fine-grained aliasing
- EXPLORER : query- and demand-driven exploration of interprocedural control flow properties
- Effectively mapping linguistic abstractions for message-passing concurrency to threads on the Java virtual machine
- Fast, multicore-scalable, low-fragmentation memory allocation through large virtual memory and global data structures
- Finding deep compiler bugs via guided stochastic program mutation
- FlashMeta: a framework for inductive program synthesis
- Galois transformers and modular abstract interpreters: reusable metatheory for program analysis
- Giga-scale exhaustive points-to analysis for Java in under a minute
- How scale affects structure in Java programs
- Incremental computation with names
- Interactively verifying absence of explicit information flows in Android apps
- Learning a strategy for adapting a program analysis via bayesian optimisation
- Optimizing hash-array mapped tries for fast and lean immutable JVM collections
- Partial evaluation of machine code
- Performance problems you can fix: a dynamic analysis of memoization opportunities
- Probability type inference for flexible approximate programming
- Programming with enumerable sets of structures
- Protocol-based verification of message-passing parallel programs
- RAIVE: runtime assessment of floating-point instability by vectorization
- Reasoning about the POSIX file system: local update and global pathnames
- Remote-scope promotion: clarified, rectified, and verified
- Runtime pointer disambiguation
- SATCheck: SAT-directed stateless model checking for SC and TSO
- Scalable race detection for Android applications
- Scrap your boilerplate with object algebras
- Selective control-flow abstraction via jumping
- ShamDroid: gracefully degrading functionality in the presence of limited resource access
- Stateless model checking of event-driven applications
- Static analysis of event-driven Node.js JavaScript applications
- Synthesis of layout engines from relational constraints
- Synthesizing Java expressions from free-form queries
- The chemical approach to typestate-oriented programming
- Tracing vs. partial evaluation: comparing meta-compilation approaches for self-optimizing interpreters
- Use at your own risk: the Java unsafe API in the wild
- Using C language extensions for developing embedded software: a case study
- Valor: efficient, software-only region conflict exceptions
- Vectorization of apply to reduce interpretation overhead of R
- Versatile yet lightweight record-and-replay for Android