1392 search results - page 105 / 279 » Dynamic Data Structure Analysis for Java Programs |
SC
2003
ACM
15 years 3 months ago
2003
ACM
This paper presents a compiler analysis for data communication for the purpose of transforming ordinary programs into ones that run on distributed systems. Such transformations ha...
SIGMETRICS
2008
ACM
14 years 9 months ago
2008
ACM
OSprof is a versatile, portable, and efficient profiling methodology based on the analysis of latency distributions. Although OSprof has offers several unique benefits and has bee...
SAS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Programming language technology can contribute to the development and understanding of Systems Biology by providing formal calculi for specifying and analysing the dynami...
IPL
2007
14 years 9 months ago
2007
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
IWMM
2009
Springer
15 years 4 months ago
2009
Springer
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...