250 search results - page 25 / 50 » Static Probabilistic Timing Analysis for Multi-path Programs |
114
click to vote
ADHOCNOW
2004
Springer
15 years 4 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
117
click to vote
ICFP
2012
ACM
13 years 1 months ago
2012
ACM
In the static analysis of functional programs, pushdown flow analabstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method re...
96
Voted
ICSOC
2009
Springer
14 years 8 months ago
2009
Springer
Several activities in service oriented computing can benefit from knowing ahead of time future properties of a given service composition. In this paper we focus on how statically i...
100
Voted
PLDI
1997
ACM
15 years 3 months ago
1997
ACM
A major research goal for compilers and environments is the automatic derivation of tools from formal specifications. However, the formal model of the language is often inadequat...
SAS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Silicon chip design has passed a threshold whereby exponentially increasing transistor density (Moore’s Law) no longer translates into increased processing power for si...