Sort by: Order: Results:

Now showing items 21-40 of 44

  • Modelling session types using contracts 

    HENNESSY, MATTHEW; BERNARDI, GIOVANNI (2011)
    Session types and contracts are two formalisms used to study client- server protocols. In this paper we study the relationship between them. The main result is the existence of a fully abstract model of session types; this ...
  • Mutually testing processes 

    HENNESSY, MATTHEW (2015)
    This volume contains the proceedings of the 24th Conference on Concurrency Theory (CONCUR 2013) held in Buenos Aires, Argentina, during August 27–30, 2013. CONCUR 2013 was organized by the Universidad de Buenos Aires ...
  • Priorities in process algebras. 

    HENNESSY, MATTHEW (IEEE Computer Society, 1988)
    An operational semantics for an algebraic theory of concurrency is developed that incorporates a notion of priority into the definition of the execution of actions. An equivalence based on strong observational equivalences ...
  • Process Behaviour: Formulae vs. Tests 

    HENNESSY, MATTHEW (2010)
    Process behaviour is often defined either in terms of the tests they satisfy, or in terms of the logical properties they enjoy. Here we compare these two approaches, using extensional testing in the style of DeNicola, ...
  • Proof methodologies for behavioural equivalence in DPI 

    HENNESSY, MATTHEW (Springer, 2005)
    We focus on techniques for proving behavioural equivalence between systems in Dpi, a distributed version of the picalculus in which processes may migrate between dynamically created locations, and where resource access ...
  • Real Reward Testing for Probabilistic Processes 

    HENNESSY, MATTHEW (2011)
    We introduce a notion of real reward testing for probabilistic processes by extending the traditional nonnegative reward testing with negative rewards. In this testing framework, the may and must preorders turn out to ...
  • Real-reward testing for probabilistic processes 

    HENNESSY, MATTHEW (2013)
    We introduce a notion of real-valued reward testing for probabilistic processes by extending the traditional nonnegative-reward testing with negative rewards. In this richer testing framework, the may- and must-preorders ...
  • Remarks on Testing Probabilistic Processes 

    HENNESSY, MATTHEW (IEEE, 2007)
    We develop a general testing scenario for probabilistic processes, giving rise to two theories: probabilistic may testing and probabilistic must testing. These are applied to a simple probabilistic version of the ...
  • Resource access control in systems of mobile agents (Extended Abstract). 

    HENNESSY, MATTHEW (Elsevier, 1998)
    We describe a typing system for a distributed ?-calculus which guarantees that distributed agents cannot access the resources of a system without first being granted the capability to do so. The language studied allows ...
  • SAFEDPI: A language for controlling mobile code 

    HENNESSY, MATTHEW (2005)
    safeDpi is a distributed version of the Picalculus, in which processes are located at dynamically created sites. Parametrised code may be sent between sites using so-called ports, which are essentially higher-order ...
  • The Security Picalculus and Non-interference. 

    HENNESSY, MATTHEW (Elsevier, 2005)
    The security -calculus is a typed version of the asynchronous -calculus in which the types, in addition to constraining the input/output behaviour of processes, have security levels associated with them. This enables ...
  • Security Policies as Membranes in Systems for Global Computing 

    HENNESSY, MATTHEW (Elsevier, 2004)
    We propose a simple global computing framework, whose main concern is code migration. Systems are structured in sites, and each site is divided into two parts: a computing body, and a membrane which regulates the ...
  • Subtyping and Locality in Distributed Higher Order Mobile Processes (extended abstract). 

    HENNESSY, MATTHEW (Springer-Verlag, 1999)
    This paper studies one important aspect of distributed systems, locality, using a calculus of distributed higher-order processes in which not only basic values or channels, but also parameterised processes are transferred ...
  • Symbolic bisimulation for a higher-order distributed language with passivation (extended abstract) 

    KOUTAVAS, VASILEIOS; HENNESSY, MATTHEW (2013)
    We study the behavioural theory of a higher-order distributed calculus with private names and locations that can be passivated. For this language, we present a novel Labelled Transition System where higher-order inputs are ...
  • Testing Finitary Probabilistic Processes 

    HENNESSY, MATTHEW (2009)
    This paper provides modal- and relational characterisations of may- and must-testing preorders for recursive CSP processes with divergence, featuring probabilistic as well as nondeterministic choice. May testing is ...
  • A Testing Theory for a Higher-Order Cryptographic Language 

    HENNESSY, MATTHEW (2011)
    We study a higher-order concurrent language with cryptographic primitives, for which we develop a sound and complete, rstorder testing theory for the preservation of safety properties. Our theory is based on co-inductive ...
  • A theory for observational fault tolerance 

    HENNESSY, MATTHEW (Elsevier, 2007)
    One reason for the study of programs in the presence of faults, i.e. defects at the lowest level of abstractions [2], is to be able to construct more dependable systems, meaning systems exhibiting a high probability of ...
  • A theory of system behaviour in the presence of node and link failure 

    HENNESSY, MATTHEW (Elsevier, 2008)
    We develop a behavioural theory of distributed programs in the presence of failures such as nodes crashing and links breaking. The framework we use is that of D , a language in which located processes, or agents, may ...
  • Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems. 

    HENNESSY, MATTHEW (Elsevier, 2004)
    We de ne a typed bisimulation equivalence for the language Dpi, a dis- tributed version of the -calculus in which processes may migrate between dynamically created locations. It takes into account resource access policies, ...
  • Towards action-refinement in process algebras. 

    HENNESSY, MATTHEW (IEEE Computer Society Press., 1989)
    A simple process algebra which supports a form of refinement of an action by a process is presented and the question of an appropriate equivalence relation for it is addressed. The main result is that an adequate equivalence ...