TOPLAS 2000
28 papers
- A balanced code placement framework
- An automata-theortetic approach to modular model checking
- Automated data-member layout of help objects to improve memory-hierarchy performance
- Compiler techniques for code compaction
- Context-sensitive synchronization-sensitive analysis is undecidable
- Efficient and safe-for-space closure conversion
- Extending Graham-Glanville techniques for optimal code generation
- From flop to megaflops: Java for technical computing
- Fusion-based register allocation
- Generation of LR parsers by partial evaluation
- Graph rewrite systems for program optimization
- Incremental analysis of constraint logic programs
- Independence in CLP languages
- Integrating object-oriented programming and protected objects in Ada 95
- Java bytecode compression for low-end embedded systems
- Lazy rewriting on eager machinery
- Local type inference
- Optimizing memory usage in the polyhedral model
- Program transformation and runtime support for threaded MPI execution on shared-memory machines
- Sets and constraint logic programming
- Standard fixpoint iteration for Java bytecode verification
- Syntactic type abstraction
- The benefits and costs of DyC's run-time optimizations
- The role of commutativity in constraint propagation algorithms
- Type-based analysis of uncaught exceptions
- Typed memory management via static capabilities
- Undecidability of context-sensitive data-independence analysis
- Understanding class hierarchies using concept analysis