Abstract
Escape analysis can improve the speed and memory efficiency of garbage collected languages by allocating objects to the call stack, but an offline analysis will potentially interfere with dynamic class loading and an online analysis must sacrifice precision for speed. We describe a technique that permits the safe use of aggressive, speculative offline escape analysis in programs potentially loading classes that violate the analysis results.
| Original language | American English |
|---|---|
| State | Published - Jun 1 2007 |
| Event | Proceedings of the 2007 International Conference on Software Engineering Research & Practice - Duration: Jun 1 2007 → … |
Conference
| Conference | Proceedings of the 2007 International Conference on Software Engineering Research & Practice |
|---|---|
| Period | 6/1/07 → … |
Keywords
- Automatic Refactoring
- Dynamic Class Loading
- Escape Analysis
- Speculative Optimization
Disciplines
- Bioinformatics
- Communication
- Communication Technology and New Media
- Computer Sciences
- Databases and Information Systems
- Life Sciences
- OS and Networks
- Physical Sciences and Mathematics
- Science and Technology Studies
- Social and Behavioral Sciences