Sciweavers

130 search results - page 1 / 26
» Efficiently Verifiable Escape Analysis
Sort
View
ECOOP
2004
Springer
13 years 10 months ago
Efficiently Verifiable Escape Analysis
Matthew Q. Beers, Christian Stork, Michael Franz
SERP
2007
13 years 6 months ago
Runtime Support of Speculative Optimization for Offline Escape Analysis
Escape analysis can improve the speed and memory efficiency of garbage collected languages by allocating objects to the call stack, but an offline analysis will potentially interf...
Kevin Cleereman, Michelle Cheatham, Krishnaprasad ...
HPCA
2006
IEEE
14 years 5 months ago
Completely verifying memory consistency of test program executions
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
Chaiyasit Manovit, Sudheendra Hangal
LPAR
2010
Springer
13 years 2 months ago
Verifying Pointer and String Analyses with Region Type Systems
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...
Lennart Beringer, Robert Grabowski, Martin Hofmann
ATVA
2009
Springer
142views Hardware» more  ATVA 2009»
13 years 8 months ago
TAPAAL: Editor, Simulator and Verifier of Timed-Arc Petri Nets
TAPAAL is a new platform independent tool for modelling, simulation and verification of timed-arc Petri nets. TAPAAL provides a stand-alone editor and simulator, while the verifica...
Joakim Byg, Kenneth Yrke Jørgensen, Jir&iac...