## Logical properties of name restriction (2001)

### Cached

### Download Links

- [lucacardelli.name]
- [lucacardelli.name]
- [lucacardelli.name]
- DBLP

### Other Repositories/Bibliography

Venue: | Proc. 5th Int. Conf. Typed Lambda Calculi and Applications (TLCA’01), volume 2044 of Lecture Notes in Computer Science |

Citations: | 46 - 6 self |

### BibTeX

@INPROCEEDINGS{Cardelli01logicalproperties,

author = {Luca Cardelli and Andrew D. Gordon},

title = {Logical properties of name restriction},

booktitle = {Proc. 5th Int. Conf. Typed Lambda Calculi and Applications (TLCA’01), volume 2044 of Lecture Notes in Computer Science},

year = {2001},

pages = {46--60},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract. We extend the modal logic of ambients described in [7] to the full ambient calculus, including name restriction. We introduce logical operators that can be used to make assertions about restricted names, and we study their properties. 1

### Citations

809 | Mobile Ambients
- Cardelli, Gordon
- 1998
(Show Context)
Citation Context ...ended to represent hidden communication channels, has been used also to represent hidden encryption keys [2] and as the basis for definitions of secrecy [2, 4]. In the context of the ambient calculus =-=[6]-=-, name restriction can be used to represent hidden locations and (by extrapolating [4] and [5]) secret locations. In general, we would like to have process calculi where we can represent protocols for... |

785 | A calculus for cryptographic protocols: The spi calculus
- Abadi, Gordon
- 1997
(Show Context)
Citation Context ... their properties. 1 Introduction The π-calculus notion of name restriction [12], initially intended to represent hidden communication channels, has been used also to represent hidden encryption keys =-=[2]-=- and as the basis for definitions of secrecy [2, 4]. In the context of the ambient calculus [6], name restriction can be used to represent hidden locations and (by extrapolating [4] and [5]) secret lo... |

587 |
Communicating and Mobile Systems: the π-Calculus
- Milner
- 1999
(Show Context)
Citation Context ...ng name restriction. We introduce logical operators that can be used to make assertions about restricted names, and we study their properties. 1 Introduction The π-calculus notion of name restriction =-=[12]-=-, initially intended to represent hidden communication channels, has been used also to represent hidden encryption keys [2] and as the basis for definitions of secrecy [2, 4]. In the context of the am... |

245 | Secrecy by typing in security protocols - Abadi - 1999 |

145 | A new approach to abstract syntax involving binders
- Gabbay, Pitts
- 1999
(Show Context)
Citation Context ...e are infinitely many of them, since a fresh name can be replaced by any other fresh name. Therefore, “freshness” can be expressed formally as the existence of a cofinite set of interchangeable names =-=[10]-=-. We use Fin(S) for the collection of finite subsets of a set S. 4.1 The Gabbay-Pitts Property We would like to obtain the following property for x. : P x. ⇔ m Λ. m fn(P, ) ∧ P {x←m} (® n[]) x®(y[ ] x... |

70 | Ambient groups and mobility types
- Cardelli, Ghelli, et al.
- 2000
(Show Context)
Citation Context ...ption keys [2] and as the basis for definitions of secrecy [2, 4]. In the context of the ambient calculus [6], name restriction can be used to represent hidden locations and (by extrapolating [4] and =-=[5]-=-) secret locations. In general, we would like to have process calculi where we can represent protocols for creating shared encryption keys and secret locations; name restriction seems crucial to all t... |

41 | Extensionality and Intensionality of the Ambient Logics
- Sangiorgi
- 2001
(Show Context)
Citation Context ...ion. Because of our original motivation in describing location structures in detail, the properties described by our logic are much finer, and are invariant only up to structural congruence (see also =-=[14]-=- for a recent characterization). Because of this, our logic is closely related to intuitionistic linear logic and to bunched logics: see [7] for a comparison. Our logic is unusual also because it hand... |

36 |
D.: A Calculus of Mobile Processes, Part 1 – 2
- Milner, Parrow, et al.
- 1992
(Show Context)
Citation Context ...mantic properties of the π-calculus and its descendants to be preserved by fresh renaming; an early example is a fresh renaming lemma for strong bisimulation in the original article on the π-calculus =-=[13, 9]-=-. 2.4 Validity Valid Formulas, Sequents, and Rules A closed formula is valid when it is satisfied by all processes. A general formula is valid when it is valid under any closed instantiation of its fr... |

16 |
modal logics for mobile ambients
- Cardelli, Gordon, et al.
- 2000
(Show Context)
Citation Context ...out “the first restricted name” or any particular restricted name of a process. The ambient calculus can be regarded essentially as an extension of the π-calculus with dynamic location structures. In =-=[7]-=- we present a modal logic for describing properties of ambient calculus processes, with particular emphasis on expressing the structure and evolution of hierarchies of locations. Much of that logic ca... |

9 | Verifiable and Executable Logic Specifications of Concurrent Objects in π - Caires, Monteiro - 1998 |

2 |
Gordon: Secrecy and Group Creation. Catuscia Palamidessi, editor
- Cardelli, Ghelli, et al.
- 2000
(Show Context)
Citation Context ... notion of name restriction [11], initially intended to represent hidden communication channels, has been used also to represent hidden encryption keys [2] and as the basis for definitions of secrecy =-=[2, 4]-=-. In the context of the Ambient Calculus [6], name restriction can be used to represent hidden locations and (by extrapolating [4] and [5]) secret locations. In general, we would like to have process ... |

1 | Zilio, Spatial Congruence for Ambients is Decidable - Dal - 2000 |

1 |
Miculan and Ivan Scangnetto, π-Calculus in (Co)Inductive Type Theory
- Honsell, Marino
- 2000
(Show Context)
Citation Context ...mantic properties of the π-calculus and its descendants to be preserved by fresh renaming; an early example is a fresh renaming lemma for strong bisimulation in the original article on the π-calculus =-=[13, 9]-=-. 2.4 Validity Valid Formulas, Sequents, and Rules A closed formula is valid when it is satisfied by all processes. A general formula is valid when it is valid under any closed instantiation of its fr... |

1 |
Equational Properties of Mobile Ambients. Wolfgang Thomas, Editor
- Gordon, Cardelli
- 1999
(Show Context)
Citation Context ...en the original process is also non-0. That is, non-0-ness cannot be hidden by restriction. Consider, for example, the process P = (νn)n[]. Under many standard behavioral equivalences ≈ we have P ≈ 0 =-=[11]-=-. However, we have P n®¬0, and hence by (® ¬0), we have that P ¬0. This example shows quite clearly that our logic is finer than standard behavioral equivalences, and that it can inspect the structure... |