A distributed pi-calculus / by 253369 Hennessy, Matthew

Subjects:

Privacy by typing in the $\pi$-calculus by Dimitrios Kouzapas, Anna Philippou

“…In particular, we propose the \Pcalc, a calculus based on the $\pi$-calculus with groups extended with constructs for reasoning about private data. …”
Get full text

Resource Usage Analysis for the Pi-Calculus by Naoki Kobayashi, Kohei Suenaga, Lucian Wischik

“…To the authors' knowledge, ours is the first type-based resource usage analysis that deals with an expressive concurrent language like the pi-calculus.…”
Get full text

On hierarchical communication topologies in the pi-calculus by Ong, C, D'Osualdo, E

Formalising the pi-calculus using nominal logic by Jesper Bengtson, Joachim Parrow

“…We formalise the pi-calculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL. …”
Get full text

Contextual equivalence for higher-order pi-calculus revisited by Alan Jeffrey, Julian Rathke

“…The higher-order pi-calculus is an extension of the pi-calculus to allow communication of abstractions of processes rather than names alone. …”
Get full text

The $\pi$-Calculus is Behaviourally Complete and Orbit-Finitely Executable by Bas Luttik, Fei Yang

“…In this paper, we study the relationship between executable behaviour and behaviour that can be specified in the $\pi$-calculus. We establish that every finitely executable behaviour can be specified in the $\pi$-calculus up to divergence-preserving branching bisimilarity. …”
Get full text

Type Reconstruction for the Linear \pi-Calculus with Composite Regular Types by Luca Padovani

“…We extend the linear {\pi}-calculus with composite regular types in such a way that data containing linear values can be shared among several processes, if there is no overlapping access to such values. …”
Get full text

A Polynomial Translation of pi-calculus FCPs to Safe Petri Nets by Victor Khomenko, Roland Meyer, Reiner Hüchting

“…We develop a polynomial translation from finite control pi-calculus processes to safe low-level Petri nets. …”
Get full text

A Distribution Law for CCS and a New Congruence Result for the pi-calculus by Daniel Hirschkoff, Damien Pous

“…This axiomatisation is then used to derive congruence of strong bisimilarity in the finite pi-calculus in absence of sum. To our knowledge, this is the only nontrivial subcalculus of the pi-calculus that includes the full output prefix and for which strong bisimilarity is a congruence.…”
Get full text

A Formal Approach to Coercion Resistance and Its Application to E-Voting by Stanislas Riou, Oksana Kulyk, David Yeregui Marcos del Blanco

Subjects: Get full text

An ECC-based mutual data access control protocol for next-generation public cloud by Naveed Khan, Zhang Jianbiao, Huhnkuk Lim, Jehad Ali, Intikhab Ullah, Muhammad Salman Pathan, Shehzad Ashraf Chaudhry

Subjects: Get full text

A formal specification and verification framework for timed security protocols by Li, Li, Sun, Jun, Liu, Yang, Sun, Meng, Dong, Jin-Song

Subjects: Get full text

Psi-calculi: a framework for mobile processes with nominal data and logic by Jesper Bengtson, Magnus Johansson, Joachim Parrow, Björn Victor

“…The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. …”
Get full text

Acyclic Solos and Differential Interaction Nets by Thomas Ehrhard, Olivier Laurent

“…We present a restriction of the solos calculus which is stable under reduction and expressive enough to contain an encoding of the pi-calculus. As a consequence, it is shown that equalizing names that are already equal is not required by the encoding of the pi-calculus. …”
Get full text

Psi-Calculi Revisited: Connectivity and Compositionality by Johannes Åman Pohjola

“…Psi-calculi is a parametric framework for process calculi similar to popular pi-calculus extensions such as the explicit fusion calculus, the applied pi-calculus and the spi calculus. …”
Get full text

Trees from Functions as Processes by Davide Sangiorgi, Xian Xu

“…We give general conditions under which an encoding of the {\lambda}-calculus into the {\pi}-calculus is sound and complete with respect to such trees. …”
Get full text

A theorem proving framework for the formal verification of Web Services Composition by Petros Papapanagiotou, Jacques D. Fleuriot

“…Our approach is based on the proofs-as-processes paradigm that enables inference rules of Classical Linear Logic (CLL) to be translated into pi-calculus processes. In this setting, composition is achieved by representing available web services as CLL sentences, proving the requested composite service as a conjecture, and then extracting the constructed pi-calculus term from the proof. …”
Get full text

An intensionally fully-abstract sheaf model for $\pi$ (expanded version) by Clovis Eberhart, Tom Hirschowitz, Thomas Seiller

“…Following previous work on CCS, we propose a compositional model for the $\pi$-calculus in which processes are interpreted as sheaves on certain simple sites. …”
Get full text

Non-Deterministic Functions as Non-Deterministic Processes (Extended Version) by Joseph W. N. Paulus, Daniele Nantes-Sobrinho, Jorge A. Pérez

“…We study encodings of the lambda-calculus into the pi-calculus in the unexplored case of calculi with non-determinism and failures. …”
Get full text