OOPSLA 2008
36 papers
- A tag-based approach for the design and composition of information processing applications
- A theory of aspects as latent topics
- Analysis and reduction of memory inefficiencies in Java strings
- Analyzing the performance of code-copying virtual machines
- Annotation refactoring: inferring upgrade transformations for legacy applications
- Caching and incrementalisation in the java query language
- Constrained types for object-oriented languages
- Contention-aware scheduler: unlocking execution parallelism in multithreaded java programs
- Deep typechecking and refactoring
- Delegation-based semantics for modularizing crosscutting concerns
- Design and implementation of transactional constructs for C/C++
- Designed as designer
- Dynamic optimization for efficient strong atomicity
- Efficient local type inference
- Efficient software model checking of soundness of type systems
- Enabling static analysis for partial java programs
- Enforcing object protocols by combining static and runtime analysis
- Generics of a higher kind
- Interprocedural query extraction for transparent persistence
- Java performance evaluation through rigorous replay compilation
- Java type inference is broken: can we fix it?
- Join patterns for visual basic
- Jolt: lightweight dynamic analysis and removal of object churn
- Mixing source and bytecode: a case for compilation by normalization
- Multiple dispatch in practice
- QVM: an efficient runtime for detecting defects in deployed systems
- Safer unsafe code for .NET
- Sound and extensible renaming for java
- The impact of static-dynamic coupling on remodularization
- The visitor pattern as a reusable, generic, type-safe component
- Tolerating memory leaks
- Towards adaptive programming: integrating reinforcement learning into a programming language
- Typestate-like analysis of multiple interacting objects
- Verifying correct usage of atomic blocks and typestate
- Whiteoak: introducing structural typing into java
- jStar: towards practical verification for java