3820 search results - page 348 / 764 » Bounded Model Debugging |
132
click to vote
FPCA
1989
15 years 8 months ago
1989
Bounded quantification was introduced by Cardelli and Wegner as a means of typing functions that operate uniformly over all subtypes of a given type. They defined a simple “ob...
106
Voted
FC
2010
Springer
15 years 8 months ago
2010
Springer
A number of security systems, from Chip-and-PIN payment cards to contactless subway and train tokens, as well as secure localization systems, are vulnerable to relay attacks. Encry...
149
click to vote
FORMATS
2009
Springer
15 years 8 months ago
2009
Springer
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
139
Voted
COLT
2006
Springer
15 years 8 months ago
2006
Springer
We propose a sequential randomized algorithm, which at each step concentrates on functions having both low risk and low variance with respect to the previous step prediction functi...
112
Voted
SPDP
1991
IEEE
15 years 8 months ago
1991
IEEE
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...