Abstract: We discuss some of the proposals in the literature about contract theories and session types dealing with asynchronous communication. Assuming that communication is mediated by buffers, notions of compatibility,
Concrete artefacts are produced and used for dissemination. These include scientific publications, a repository of use-cases, tutorials, a non-technical article presenting the main achievements of the project, material for tutorials and recorded tutorials. These artefacts will remain available to the general public beyond the duration of the project and promote a continuative and long-term dissemination.
If you are unable to view these files, please log in or register.
Abstract: Session types is a typing discipline for concurrent and distributed processes that allows errors such as communication mismatches and deadlocks to be detected statically. Refinement types are types elaborated
Abstract: The idea of runtime verification is to observe the executions of a system in order to derive information on its behaviour. By analysing executions rather than the system itself,
Abstract: Choreographic Programming exploits choreographies as a programming language. We will introduce choreographic programming, and showcase its use for programming distributed applications which are: dynamically updatable by including new code
Abstract: Many software engineering artefacts, such as source code or specifications, define a set of operations and impose restrictions to the ordering on which they have to be invoked. Enabledness Preserving
Abstract: In complex distributed systems, communicating participants agree on a protocol to follow, by specifying the type and direction of data exchanged. Session types are an elegant type formalism used to model structured communication-based programming. They guarantee
Deadlock analysis of concurrent programs that contain coordination primitives (wait, notify and notifyAll) is notoriously challenging. Not only these primitives affect the scheduling of processes, but also notifications unmatched by
Pomsets are a model of concurrent computations introduced by Pratt. We adopt pomsets as a syntax-oblivious specification model of distributed systems where coordination happens via asynchronous message-passing. In this paper,