Sciweavers

89 search results - page 3 / 18
» Semantic subtyping for the pi-calculus
Sort
View
LICS
2012
IEEE
11 years 7 months ago
A Higher-Order Distributed Calculus with Name Creation
—This paper introduces HOpiPn, the higher-order pi-calculus with passivation and name creation, and develops an equivalence theory for this calculus. Passivation [Schmitt and Ste...
Adrien Piérard, Eijiro Sumii
CCS
2011
ACM
12 years 5 months ago
Trace equivalence decision: negative tests and non-determinism
We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-...
Vincent Cheval, Hubert Comon-Lundh, Stéphan...
FORTE
2001
13 years 6 months ago
Patterns and Rules for Behavioural Subtyping
Abstract Subtyping relations for object-oriented formalisms describe relationships between super- and subclasses which satisfy the substitutability requirement imposed on types and...
Heike Wehrheim
TCS
2008
13 years 5 months ago
Semantic subtyping for the pi-calculus
Subtyping relations for the -calculus are usually defined in a syntactic way, by means of structural rules. We propose a semantic characterisation of channel types and use it to d...
Giuseppe Castagna, Rocco De Nicola, Daniele Varacc...
LFP
1990
102views more  LFP 1990»
13 years 6 months ago
A Semantic Basis for Quest
Quest is a programming language based on impredicative type quantifiers and subtyping within a three-level structure of kinds, types and type operators, and values. The semantics ...
Luca Cardelli, Giuseppe Longo