This paper investigates the interactive power of the higher-order pi-calculus extended with parameterization. We study two kinds of parameterization: name parameterization and process parameterization. We show that each of these kinds of ...$\mathbb{}$

The idea of pervasive computing is that information processing will become part of everyday life, and will be available everywhere, making computing so natural to the point of being invisible in the ambient. An important concept that arises with ...

We give a formal account of stream-based, service-centered calculus (SSCC), a calculus for modelling service-based systems, suitable to describe both service composition (orchestration) and the protocols that services follow when invoked (...

We propose a finite structural translation of possibly recursive π-calculus terms into Petri nets. This is achieved by using high-level nets together with an equivalence on markings in order to model entering into recursive calls, which do not ...

Recent advances in logics for reasoning about resources provide a new approach to compositional reasoning in interacting systems. We present a calculus of resources and processes, based on a development of Milner’s synchronous calculus of ...

High-level language program compilation strategies can be proven correct by modelling the process as a series of refinement steps from source code to a machine-level description. We show how this can be done for programs containing recursively-...

The connection between operational and denotational semantics is of longstanding interest in the study of programming languages. The emphasis has been on positive results, whether for adequacy or full abstraction. One normally considers the ...

Action calculi, which generalise process calculi such as Petri nets, π-calculusand ambient calculus, have been presented in terms of action graphs. We here offer linear action graphs as a primitive basis for action calculi. This paper presents ...

Milner's value-passing calculus for describing and reasoning about communicating systems is formalised in the HOL proof assistant. Based on a previously defined mechanisation of pure CCS (no data communication, only synchronisation) in HOL, ...

We present an O(n³) time type inference algorithm for a type system with a largest typeΤ, a smallest type ⊥, and the usual ordering between function types. The algorithm infers type annotations of least shape, and it works equally well for ...

In this paper we define an extension ofF_≤ [CUG92] to which we add functions that dispatch on different terms according to the type they receive as argument. In other words, we enrich the explicit parametric polymorphism ofF_≤ by an explicit “ad hoc”...

This paper expands upon work begun in [Tho89], in building a logic for the Miranda functional programming language. After summarising the work in that paper, a translation of Miranda definitions into logical formulas is presented, and illustrated ...

In this paper we use the chemical abstract machine (CHAM) framework [BeB90, BeB92, Bou94] for discussing various semantics for the Facile programming language [GMP89, GMP90, FAR93] and for formalising (parts of) its implementations. We use these ...

An extension of Dijkstra's guarded command language is studied, including unbounded demonic choice and a backtrack operator. We consider three orderings on this language: a refinement ordering defined by Back, a new deadlock ordering, and an ...

A general formulation of inductive and recursive definitions in Martin-Löf's type theory is presented. It extends Backhouse's ‘Do-It-Yourself Type Theory’ to include inductive definitions of families of sets and definitions of functions by ...

We illustrate the difference between sequential composition in process algebra axiomatisations like ACP and action prefixing in process calculi like CCS. We define both early and late input in a general framework extending ACP, and consider ...

This article presents the definition and some basic properties of the Deva meta-calculus, a generic logical framework whose design was driven by the needs arising from the instantiation to software development methods. As a result, Deva contains ...

In a basic agent calculus, equality often links the agents which provide the same external behaviour in any context. Since the universe of agents and the universe of contexts depend on the used action set, equality depends a priori on this set of ...

An algebraic view of recursive definitions is presented, extending an already familiar analogy with homomorphisms. A notion of simulation of one recursive definition by another is then defined. This leads to a particular approach to verification ...

Diagram chasing is an established proof technique in Category Theory.Algebraic calculation is a good alternative; made possible thanks to anotation for various unique arrows and a suitableformulation of initiality, and the calculational properties ...