1134 search results - page 116 / 227 » Distributed Proving in Access-Control Systems |
122
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Distributed systems are now both very large and highly dynamic. Peer to peer overlay networks have been proved efficient to cope with this new deal that traditional approaches can ...
110
Voted
IANDC
2008
15 years 3 months ago
2008
We develop a behavioural theory of distributed programs in the presence of failures such as nodes crashing and links breaking. The framework we use is that of D, a language in whi...
104
Voted
SPAA
1997
ACM
15 years 7 months ago
1997
ACM
: This paper presents a network mapping algorithm and proves its correctness assuming a traffic-free network. Respecting well-defined parameters, the algorithm produces a graph iso...
100
Voted
CONCUR
2005
Springer
15 years 9 months ago
2005
Springer
d Abstract) Adrian Francalanza and Matthew Hennessy University of Sussex, Falmer Brighton BN1 9RH, England Abstract. We develop a behavioural theory of distributed programs in the ...
107
Voted
CONCUR
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. The question we consider in this paper is: “When can a combination of fine-grain execution steps be contracted into an atomic action execution”? Our answer is basica...