2 search results - page 1 / 1 » Skeletons, Homomorphisms, and Shapes: Characterizing Protoco... |
ENTCS
2007
13 years 4 months ago
2007
In this paper we develop a framework, based on strand spaces, for reasoning about cryptographic protocols and characterizing their executions. We define skeletons, homomorphisms,...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...