Sciweavers

2092 search results - page 239 / 419
» A Theory of Non-Deterministic Networks
Sort
View
92
Voted
ICDCSW
2000
IEEE
15 years 4 months ago
Compositional Verification of a Third Generation Mobile Communication Protocol
Model-checking has turned out to be an efficient and relatively easy-to-use technique in the verification of formally described programs. However, there is one major drawback in u...
Sari Leppänen, Matti Luukkainen
CCS
2008
ACM
15 years 2 months ago
Unbounded verification, falsification, and characterization of security protocols by pattern refinement
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...
Cas J. F. Cremers
DIALM
2005
ACM
104views Algorithms» more  DIALM 2005»
15 years 2 months ago
Information dissemination in highly dynamic graphs
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
Regina O'Dell, Roger Wattenhofer
96
Voted
DMSN
2008
ACM
15 years 2 months ago
Probabilistic processing of interval-valued sensor data
When dealing with sensors with different time resolutions, it is desirable to model a sensor reading as pertaining to a time interval rather than a unit of time. We introduce two ...
Sander Evers, Maarten M. Fokkinga, Peter M. G. Ape...
ECIS
2001
15 years 1 months ago
Commitments Enabling Co-Operation in Distributed Information Systems Development
Information systems development is regarded as a series of distributed activities aiming at allocating resources in order to promote the development and use of computer-based syst...
Ralf Klischewski