Searching for authors named "Michele Boreale" – sorted by Relevance.
26 documents found, showing 1 through 10.
Next 10 →
-
Symbolic Analysis of Cryptographic Protocols in the Spi-Calculus
- …In the spi-calculus a cryptographic protocol can be described as a concurrent process. Analysis of the traces generated by this process can be used to verify authentication and secrecy properties of the protocol. However, the set of traces is typically very large or innite. We propose a symbolic …
- Cited by 5 (1 self) – Add To MetaCart
-
Symbolic Trace Analysis of Cryptographic Protocols
- …A cryptographic protocol can be described as a system of concurrent processes, and analysis…
- Cited by 73 (8 self) – Add To MetaCart
-
On the Symbolic Analysis of Low-Level Cryptographic Primitives: Modular Exponentiation and the Diffie-Hellman Protocol
- …Automatic methods developed so far for analysis of security protocols only model a limited set of cryptographic primitives (often, only encryption and concatenation) and abstract from low-level features of cryptographic algorithms. This paper is an attempt towards closing this gap. We propose a symb…
- Cited by 10 (1 self) – Add To MetaCart
-
Process Calculi and the Verification of Security Protocols
- …Recently there has been much interest towards using formal methods in the analysis of security protocols. Some recent approaches take advantage of concepts and techniques from the field of process calculi. Process calculi can be given a formal yet simple semantics, which permits rigorous definitions…
- Add To MetaCart
-
On Compositional Reasoning in the Spi-calculus
- …Observational equivalences can be used to reason about the correctness of security protocols described in the spi-calculus. Unlike in CCS or in #-calculus, these equivalences do not enjoy a simple formulation in spi-calculus. The present paper aims at enriching the set of tools for reasoning on proc…
- Cited by 7 (1 self) – Add To MetaCart
-
Type abstractions of name-passing processes
- …Abstract. We study methods to statically approximate “first-order ” process calculi (Pi, Join) by “propositional” models (CCS, BPP, Petri nets). We consider both open and closed behaviors of processes. In the case of open behavior, we propose a type system to associate pi-calculus processes with res…
- Cited by 1 (0 self) – Add To MetaCart
-
A Complexity Analysis of Bisimilarity for Value-Passing Processes
- …We study the complexity of deciding bisimilarity between non-deterministic processes with explicit primitives for manipulating data values. In particular, we consider a language with value-passing (input/output of data) and parametric definitions of processes. We distinguish the case in which data c…
- Cited by 1 (0 self) – Add To MetaCart
-
A Fully Abstract Semantics for Causality in the Pi-Calculus
- …We examine the meaning of causality in calculi for mobile processes like the ß-calculus, and we investigate the relationship between interleaving and causal semantics for such calculi. We separate two forms of causal dependencies on actions of ß-calculus processes, called subject and object depende…
- Cited by 7 (0 self) – Add To MetaCart
-
XPi: a typed process calculus for XML messaging
- …We present XPi, a core calculus for XML messaging. XPi features asynchronous communications, pattern matching, name and code mobility, integration of static and dynamic typing. Flexibility and expressiveness of this calculus is illustrated by a few examples, some concerning description and discov…
- Cited by 13 (2 self) – Add To MetaCart
-
Some Congruence Properties for π-calculus Bisimilarities
- …Both for interleaving and for non-interleaving semantics, several variants of a pi-calculus bisimilarity can be given which differ on the requirements imposed on name instantiations. Examples are the late, early, open and ground variants. The ground variant is the simplest because it places no requi…
- Cited by 3 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
