43 search results - page 8 / 9 » Presheaf Models for the pi-Calculus |
CSFW
2008
IEEE
14 years 22 days ago
2008
IEEE
We investigate the composition of protocols that share a common secret. This situation arises when users employ the same password on different services. More precisely we study w...
ENTCS
2010
13 years 6 months ago
2010
The theory of nominal sets is a theory for names, freshness and binders. It has recently been suggested as a framework for modelling local store because it allows for a more eleme...
CALCO
2009
Springer
14 years 26 days ago
2009
Springer
Higher-order recursion schemes are equations defining recursively new operations from given ones called “terminals”. Every such recursion scheme is proved to have a least inte...
FOSSACS
2005
Springer
13 years 11 months ago
2005
Springer
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
PPDP
2000
Springer
13 years 9 months ago
2000
Springer
We introduce and develop the notion of symmetric monoidal sketch. Every symmetric monoidal sketch generates a generic model. If the sketch is commutative and single-sorted, the gen...