Results 1 
9 of
9
A fully abstract may testing semantics for concurrent objects
 In Proceedings of LICS ’02. IEEE, Computer
, 2002
"... This paper provides a fully abstract semantics for a variant of the concurrent object calculus. We define may testing for concurrent object components and then characterise it using a trace semantics inspired by UML interaction diagrams. The main result of this paper is to show that the trace semant ..."
Abstract

Cited by 38 (4 self)
 Add to MetaCart
This paper provides a fully abstract semantics for a variant of the concurrent object calculus. We define may testing for concurrent object components and then characterise it using a trace semantics inspired by UML interaction diagrams. The main result of this paper is to show that the trace semantics is fully abstract for may testing. This is the first such result for a concurrent object language. 1.
Models for NamePassing Processes: Interleaving and Causal
 In Proceedings of LICS 2000: the 15th IEEE Symposium on Logic in Computer Science (Santa Barbara
, 2000
"... We study syntaxfree models for namepassing processes. For interleaving semantics, we identify the indexing structure required of an early labelled transition system to support the usual picalculus operations, defining Indexed Labelled Transition Systems. For noninterleaving causal semantics we de ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
We study syntaxfree models for namepassing processes. For interleaving semantics, we identify the indexing structure required of an early labelled transition system to support the usual picalculus operations, defining Indexed Labelled Transition Systems. For noninterleaving causal semantics we define Indexed Labelled Asynchronous Transition Systems, smoothly generalizing both our interleaving model and the standard Asynchronous Transition Systems model for CCSlike calculi. In each case we relate a denotational semantics to an operational view, for bisimulation and causal bisimulation respectively. We establish completeness properties of, and adjunctions between, categories of the two models. Alternative indexing structures and possible applications are also discussed. These are first steps towards a uniform understanding of the semantics and operations of namepassing calculi.
πcalculus in logical form
 Logic in Computer Science, LICS 2007
, 2007
"... Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model for picalculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is done by defining a logical counterpart of categorical constructions including dynamic name allocation and name exponentiati ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model for picalculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is done by defining a logical counterpart of categorical constructions including dynamic name allocation and name exponentiation, and showing that they are dual to standard constructs in functor categories. We show that initial algebras of functors defined in terms of these constructs give rise to a logic that is sound, complete, and characterises bisimilarity. The approach is modular, and we apply it to derive a logical formulation of picalculus. The resulting logic is a modal calculus with primitives for input, free output and bound output. 1.
A game semantics of the asynchronous πcalculus
 In Proceedings of 16th CONCUR
, 2005
"... Abstract. This paper studies the denotational semantics of the typed asynchronous πcalculus. We describe a simple game semantics of this language, placing it within a rich hierarchy of games models for programming languages, A key element of our account is the identification of suitable categorical ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract. This paper studies the denotational semantics of the typed asynchronous πcalculus. We describe a simple game semantics of this language, placing it within a rich hierarchy of games models for programming languages, A key element of our account is the identification of suitable categorical structures for describing the interpretation of types and terms at an abstract level. It is based on the notion of closed Freyd category, establishing a connection between our semantics, and that of the λcalculus. This structure is also used to define a trace operator, with which name binding is interpreted. We then show that our categorical characterization is sufficient to prove a weak soundness result. Another theme of the paper is the correspondence between justified sequences, on which our model is based, and traces in a labelled transition system in which only bound names are passed. We show that the denotations of processes are equivalent, via this correspondence, to their sets of traces. These results are used to show that the games model is fully abstract with respect to mayequivalence. 1
An algebraic process calculus
 In Proceedings of the twentythird annual IEEE symposium on logic in computer science (LICS
, 2008
"... We present an extension of the πIcalculus with formal sums of terms. The study of the properties of this sum reveals that its neutral element can be used to make assumptions about the behaviour of the environment of a process. Furthermore, the formal sum appears as a fundamental construct that can ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
We present an extension of the πIcalculus with formal sums of terms. The study of the properties of this sum reveals that its neutral element can be used to make assumptions about the behaviour of the environment of a process. Furthermore, the formal sum appears as a fundamental construct that can be used to decompose both internal and external choice. From these observations, we derive an enriched calculus that enjoys a confluent reduction which preserves the testing semantics of processes. This system is shown to be strongly normalising for terms without replication, and the study of its normal forms provides a fully abstract trace semantics for testing of πI processes. 1.
A fully abstract trace semantics for UML components
 In Bosangue et
"... Abstract. We present a fully abstract semantics for UML components. This semantics is formalized in terms of a notion of trace for components, providing a description of the component externally observable behavior inspired by UML sequence diagrams. Such a description abstracts from the actual imple ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. We present a fully abstract semantics for UML components. This semantics is formalized in terms of a notion of trace for components, providing a description of the component externally observable behavior inspired by UML sequence diagrams. Such a description abstracts from the actual implementation given by UML statemachines. Our full abstraction result is based on a may testing semantics which involves a composition of components in terms of crossborder dynamic class instantiation through component interfaces. 1
A Denotational Semantics for the piCalculus
 Fifth Irish Workshop in Formal Methods (IWFM’01
, 2001
"... In his categorical framework, Stark defines a domaintheoretic model for the #calculus based on functor categories. Despite being a sound abstract model, a more concrete semantics is required if it is to be used as a basis for proving properties about mobile systems. In this paper, we concretize St ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In his categorical framework, Stark defines a domaintheoretic model for the #calculus based on functor categories. Despite being a sound abstract model, a more concrete semantics is required if it is to be used as a basis for proving properties about mobile systems. In this paper, we concretize Stark's denotational model for the #calculus and provide a full definition of the semantic domains involved. We also include an example of how the model may be approximated in an abstract interpretation analysis. 1
A privacy analysis for the πcalculus: The denotational approach
 Roskilde University
, 2002
"... We present a nonuniform static analysis for the πcalculus that is built on a denotational semantics of the language and is useful in detecting instances of information leakage and insecure communications in systems with multilevel security policies. To ensure the termination of the analysis, we p ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present a nonuniform static analysis for the πcalculus that is built on a denotational semantics of the language and is useful in detecting instances of information leakage and insecure communications in systems with multilevel security policies. To ensure the termination of the analysis, we propose an abstraction, which maintains a finite number of names to be generated by any process. We prove the safety of the analysis and review a prototype of the analysis called the Picasso tool.
Presheaf models for the πcalculus
 In Proc. CTCS’97, volume 1290 of LNCS
, 1997
"... Abstract. The finite πcalculus has an explicit settheoretic functorcategory model that is known to be fully abstract for strong late bisimulation congruence. We characterize this as the initial free algebra for an appropriate set of operations and equations in the enriched Lawvere theories of Plo ..."
Abstract
 Add to MetaCart
Abstract. The finite πcalculus has an explicit settheoretic functorcategory model that is known to be fully abstract for strong late bisimulation congruence. We characterize this as the initial free algebra for an appropriate set of operations and equations in the enriched Lawvere theories of Plotkin and Power. Thus we obtain a novel algebraic description for models of the πcalculus, and validate an existing construction as the universal such model. The algebraic operations are intuitive, covering name creation, communication of names over channels, and nondeterminism; the equations then combine these features in a modular fashion. We work in an enriched setting, over a “possible worlds ” category of sets indexed by available names. This expands significantly on the classical notion of algebraic theories, and in particular allows us to use nonstandard arities that vary as processes evolve. Based on our algebraic theory we describe a category of models for the πcalculus, and show that they all preserve bisimulation congruence. We develop a direct construction of free models in this category; and generalise previous results to prove that all freealgebra models are fully abstract. 1