90 search results - page 6 / 18 » Data-Flow Analysis for MPI Programs |
CORR
2006
Springer
14 years 11 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
15 years 22 days 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...
107
click to vote
SCP
1998
14 years 11 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...
82
Voted
IWPC
2005
IEEE
15 years 5 months ago
2005
IEEE
Previous studies have shown that novices do not tend to extract or use data-flow information during program comprehension. However, for impact analysis and similar tasks, data-...
107
click to vote
ESOP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...