180 search results - page 17 / 36 » Precise interprocedural analysis using random interpretation |
ISPDC
2008
IEEE
15 years 4 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
AAAI
1997
14 years 11 months ago
1997
In this paper, we propose a stochastic version of a general purpose functional programming language as a method of modeling stochastic processes. The language contains random choi...
BERTINORO
2005
Springer
15 years 3 months ago
2005
Springer
Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network ...
JAL
2002
14 years 9 months ago
2002
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
181
click to vote
POPL
2008
ACM
15 years 10 months ago
2008
ACM
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...