185 search results - page 21 / 37 » Dependability Analysis of Virtual Memory Systems |
154
Voted
CC
2012
Springer
13 years 11 months ago
2012
Springer
The computational cost and precision of a shape style heap analysis is highly dependent on the way method calls are handled. This paper introduces a new approach to analyzing metho...
158
Voted
PEPM
1993
ACM
15 years 8 months ago
1993
ACM
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
132
click to vote
JTRES
2010
ACM
15 years 4 months ago
2010
ACM
With traditional testing, the test case has no control over non-deterministic scheduling decisions, and thus errors dependent on scheduling are only found by pure chance. Java Pat...
145
click to vote
IWMM
2007
Springer
15 years 10 months ago
2007
Springer
This paper presents an analysis and transformation for individual object reclamation in Java programs. First, we propose a uniqueness inference algorithm that identifies variable...
119
click to vote
IISWC
2008
IEEE
15 years 10 months ago
2008
IEEE
Commercial server applications remain memory bound on modern multiprocessor systems because of their large data footprints, frequent sharing, complex non-strided access patterns, ...