72 search results - page 9 / 15 » Weak models of distributed computing, with connections to mo... |
162
click to vote
POPL
2005
ACM
15 years 9 months ago
2005
ACM
Several formal languages have been proposed to encode privacy policies, ranging from the Platform for Privacy Preferences (P3P), intended for communicating privacy policies to con...
126
Voted
FIDJI
2004
Springer
15 years 2 months ago
2004
Springer
We present a calculus for establishing non-interference of several Java threads running in parallel. The proof system is built atop an implemented sequential Java Dynamic Logic cal...
80
Voted
CONCUR
2004
Springer
15 years 2 months ago
2004
Springer
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
COORDINATION
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Constraint automata have been used as an operational model for component connectors that coordinate the cooperation and communication of the components by means of a netw...
115
click to vote
PODC
1994
ACM
15 years 1 months ago
1994
ACM
The notion of belief has been useful in reasoning about authentication protocols. In this paper, we show how the notion of belief can be applied to reasoning about cache coherence...