154 search results - page 10 / 31 » Dependence Flow Graphs: An Algebraic Approach to Program Dep... |
WORDS
2005
IEEE
14 years 8 days ago
2005
IEEE
Reliable program Worst-Case Execution Time (WCET) estimates are a key component when designing and verifying real-time systems. One way to derive such estimates is by static WCET ...
WCET
2008
13 years 8 months ago
2008
Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worstcase execution time (WCET). Flow analys...
APLAS
2010
ACM
13 years 7 months ago
2010
ACM
We consider the problem of specifying data structures with complex sharing in a manner that is both declarative and results in provably correct code. In our approach, abstract data...
PLDI
2006
ACM
14 years 20 days ago
2006
ACM
Dependence graphs and memoization can be used to efficiently update the output of a program as the input changes dynamically. Recent work has studied techniques for combining the...
MEMICS
2010
13 years 1 months ago
2010
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...