2436 search results - page 362 / 488 » Comonadic Notions of Computation |
131
click to vote
ATVA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
142
click to vote
CCS
2005
ACM
15 years 10 months ago
2005
ACM
This paper provides a formal framework for the analysis of information hiding properties of anonymous communication protocols in terms of epistemic logic. The key ingredient is ou...
123
click to vote
CIE
2005
Springer
15 years 10 months ago
2005
Springer
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
149
click to vote
DCOSS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
125
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...