Sciweavers

37 search results - page 6 / 8
» Worst-Case Analysis of Heap Allocations
Sort
View
ESOP
2009
Springer
14 years 4 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell
SIGMETRICS
2004
ACM
103views Hardware» more  SIGMETRICS 2004»
14 years 3 months ago
Myths and realities: the performance impact of garbage collection
This paper explores and quantifies garbage collection behavior for three whole heap collectors and generational counterparts: copying semi-space, mark-sweep, and reference counti...
Stephen M. Blackburn, Perry Cheng, Kathryn S. McKi...
VMCAI
2010
Springer
14 years 7 months ago
Shape Analysis in the Absence of Pointers and Structure
Shape analyses (Chase et al. 1990, Sagiv et al. 2002) discover properties of dynamic and/or mutable structures. We ask, "Is there an equivalent to shape analysis for purely fu...
Matthew Might
IEEEPACT
2006
IEEE
14 years 3 months ago
A two-phase escape analysis for parallel java programs
Thread escape analysis conservatively determines which objects may be accessed in more than one thread. Thread escape analysis is useful for a variety of purposes – finding rac...
Kyungwoo Lee, Samuel P. Midkiff
PLDI
1999
ACM
14 years 2 months ago
Pointer Analysis for Multithreaded Programs
This paper presents a novel interprocedural, ow-sensitive, and context-sensitive pointer analysis algorithm for multithreaded programs that may concurrently update shared pointers...
Radu Rugina, Martin C. Rinard