Sciweavers

1392 search results - page 78 / 279
» Dynamic Data Structure Analysis for Java Programs
Sort
View
IWMM
2007
Springer
85views Hardware» more  IWMM 2007»
15 years 3 months ago
Uniqueness inference for compile-time object deallocation
This paper presents an analysis and transformation for individual object reclamation in Java programs. First, we propose a uniqueness inference algorithm that identifies variable...
Sigmund Cherem, Radu Rugina
VL
1998
IEEE
120views Visual Languages» more  VL 1998»
15 years 2 months ago
Visual Patterns + Multi-Focus Fisheye View: An Automatic Scalable Visualization Technique of Data-Flow Visual Program Execution
We present a scalable visualization technique for automatic animation of data-flow visual program execution. We also show a framework to assist programmers' browsing tasks by...
Buntarou Shizuki, Masashi Toyota, Etsuya Shibayama...
CGO
2010
IEEE
15 years 4 months ago
Linear scan register allocation on SSA form
The linear scan algorithm for register allocation provides a good register assignment with a low compilation overhead and is thus frequently used for just-in-time compilers. Altho...
Christian Wimmer, Michael Franz
CSMR
2005
IEEE
15 years 3 months ago
A Comparison of Online and Dynamic Impact Analysis Algorithms
Impact analysis is the process of determining the effect, or impact, of a change to a software system. Dynamic impact analysis uses data obtained from executing a program to perfo...
Ben Breech, Mike Tegtmeyer, Lori L. Pollock
PEPM
1994
ACM
15 years 1 months ago
The Essence of Eta-Expansion in Partial Evaluation
Abstract. Selective eta-expansion is a powerful "binding-time improvement", i.e., a sourceprogram modification that makes a partial evaluator yield better results. But li...
Olivier Danvy, Karoline Malmkjær, Jens Palsb...