250 search results - page 8 / 50 » Static Probabilistic Timing Analysis for Multi-path Programs |
159
click to vote
POPL
2003
ACM
15 years 10 months ago
2003
ACM
We present an interprocedural and compositional algorithm for finding pairs of compatible allocation sites, which have the property that no object allocated at one site is live at...
100
click to vote
CCS
1998
ACM
15 years 2 months ago
1998
ACM
We develop a framework for analyzing security protocols in which protocol adversaries may be arbitrary probabilistic polynomial-time processes. In this framework, protocols are wr...
PEPM
2007
ACM
15 years 4 months ago
2007
ACM
Functional Reactive Programming (frp) extends traditional functional programming with dataflow evaluation, making it possible to write interactive programs in a declarative style...
ESOP
2007
Springer
15 years 4 months ago
2007
Springer
We give a new practical algorithm to compute, in finite time, a fixpoint (and often the least fixpoint) of a system of equations in the abstract numerical domains of zones and t...
158
click to vote
LICS
2003
IEEE
15 years 3 months ago
2003
IEEE
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...