3122 search results - page 6 / 625 » A Theory of Network Equivalence |
IFIP
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. We consider two standard notions in formal security protocol analysis: message deducibility and static equivalence under equational theories. We present polynomial-time a...
FOSSACS
2004
Springer
15 years 1 months ago
2004
Springer
We prove that if a finite alphabet of actions contains at least two elements, then the equational theory for the process algebra BCCSP modulo any semantics no coarser than readines...
FOSSACS
2006
Springer
15 years 1 months ago
2006
Springer
We prove that the equational theory of the process algebra BCCSP modulo completed simulation equivalence does not have a finite basis. Furthermore, we prove that with a finite alph...
CCS
2005
ACM
15 years 3 months ago
2005
ACM
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
105
click to vote
PODS
2008
ACM
15 years 9 months ago
2008
ACM
A schema mapping is a high-level specification that describes the relationship between two database schemas. As schema mappings constitute the essential building blocks of data ex...