143 search results - page 5 / 29 » Data-Flow Analysis of Program Fragments |
DEXAW
2004
IEEE
14 years 1 months ago
2004
IEEE
To achieve correct execution of peer-to-peer applications on non-reliable resources, we present a portable and distributed algorithm that provides fault tolerance and result checki...
SIGSOFT
2010
ACM
13 years 7 months ago
2010
ACM
A replay tool aiming to reproduce a program's execution interposes itself at an appropriate replay interface between the program and the environment. During recording, it log...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
WCET
2007
13 years 10 months ago
2007
To calculate the WCET of a program, safe upper bounds on the number of loop iterations for all loops in the program are needed. As the manual annotation of all loops with such bou...
SCP
1998
13 years 9 months ago
1998
Many interesting analyses for constraint logic-based languages are aimed at the detection of monotonic properties, that is to say, properties that are preserved as the computation...