Sciweavers

39 search results - page 1 / 8
» Abstracting Runtime Heaps for Program Understanding
Sort
View
CORR
2012
Springer
212views Education» more  CORR 2012»
11 years 12 months ago
Abstracting Runtime Heaps for Program Understanding
Mark Marron, Cesar Sanchez, Zhendong Su, Manuel F&...
EMSOFT
2003
Springer
13 years 9 months ago
Generating Heap-Bounded Programs in a Functional Setting
Abstract. High-level programming languages offer significant expressivity but provide little or no guarantees about resource utilization. Resource-bounded languages provide stron...
Walid Taha, Stephan Ellner, Hongwei Xi
IWPC
2006
IEEE
13 years 10 months ago
Dynamic Data Structure Analysis for Java Programs
Analysis of dynamic data structure usage is useful for both program understanding and for improving the accuracy of other program analyses. Static analysis techniques, however, su...
Sokhom Pheng, Clark Verbrugge
CGO
2007
IEEE
13 years 10 months ago
Run-Time Support for Optimizations Based on Escape Analysis
The JavaTM programming language does not allow the programmer to influence memory management. An object is usually allocated on the heap and deallocated by the garbage collector ...
Thomas Kotzmann, Hanspeter Mössenböck
ECOOP
2006
Springer
13 years 8 months ago
The Runtime Structure of Object Ownership
Object-oriented programs often require large heaps to run properly or meet performance goals. They use high-overhead collections, bulky data models, and large caches. Discovering t...
Nick Mitchell