407 search results - page 67 / 82 » Malleable Proof Systems and Applications |
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
We consider Glauber dynamics on finite spin systems. The mixing time of Glauber dynamics can be bounded in terms of the influences of sites on each other. We consider three parame...
SEFM
2006
IEEE
14 years 1 months ago
2006
IEEE
We define a model of labelled product systems of automata and explore its connections with process calculi and trace languages. Bisimilarity of labelled product systems is defin...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
Garbage collectors are notoriously hard to verify, due to their lowlevel interaction with the underlying system and the general difficulty in reasoning about reachability in graph...
ICST
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper, we consider typical applications in which the business logic is separated from the access control logic, implemented in an independent component, called the Policy ...
CSFW
2008
IEEE
14 years 2 months ago
2008
IEEE
Secure communication in distributed systems is notoriously hard to achieve due to the variety of attacks an adversary can mount, based on message interception, modification, redi...