We study proof techniques for bisimilarity based on unique solution of equations. We draw inspiration from a result by Roscoe in the denotational setting of CSP and for failure semantics, essentially stating that an equation (or a system of equations) whose infinite unfolding never produces a divergence has the unique-solution property. We...
-
August 7, 2019 (v1)Journal articleUploaded on: December 4, 2022
-
2020 (v1)Journal article
Proving behavioural equivalences in higher-order languages is a difficult task, because interactions involve complex values, namely terms of the language. In coinductive (i.e., bisimulation-like) techniques for these languages, a useful enhancement is the 'up-to context' reasoning, whereby common pieces of context in related terms are...
Uploaded on: December 4, 2022 -
June 29, 2021 (v1)Conference paper
The π-calculus is used as a model for programming languages. Its contexts exhibit arbitrary concurrency, making them very discriminating. This may prevent validating desirable behavioural equivalences in cases when more disciplined contexts are expected. In this paper we focus on two such common disciplines: sequentiality, meaning that at any...
Uploaded on: December 3, 2022 -
December 1, 2020 (v1)Conference paper
The π-calculus has been advocated as a model to interpret, and give semantics to, languages with higher-order features. Often these languages make use of forms of references (and hence viewing a store as set of references). While translations of references in π-calculi (and CCS) have appeared, the precision of such translations has not been...
Uploaded on: December 4, 2022 -
2006 (v1)Journal article
The Ambient Logic (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured data. In this paper, we study the expressiveness of AL. We define formulas for capabilities and for communication in MA. We also derive some formulas that capture...
Uploaded on: December 4, 2022 -
2008 (v1)Journal article
The Ambient Logic (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured data. We study some basic questions concerning the discriminating power of AL, focusing on the equivalence on processes induced by the logic (=L). As underlying...
Uploaded on: December 4, 2022 -
September 5, 2017 (v1)Conference paper
We study proof techniques for bisimilarity based on unique solution of equations. We draw inspiration from a result by Roscoe in the denotational setting of CSP and for failure semantics, essentially stating that an equation (or a system of equations) whose infinite unfolding never produces a divergence has the unique-solution property. We...
Uploaded on: February 28, 2023 -
December 13, 2021 (v1)Publication
The π-calculus is used as a model for programming languages. Its contexts exhibit arbitrary concurrency, making them very discriminating. This may prevent validating desirable behavioural equivalences in cases when more disciplined contexts are expected. In this paper we focus on two such common disciplines: sequentiality, meaning that at any...
Uploaded on: December 3, 2022 -
July 9, 2018 (v1)Conference paper
We study Milner's encoding of the call-by-value λ-calculus into the π-calculus. We show that, by tuning the encoding to two subcalculi of the π-calculus (Internal π and Asynchronous Local π), the equivalence on λ-terms induced by the encoding coincides with Lassen's eager normal-form bisimilarity, extended to handle η-equality. As behavioural...
Uploaded on: December 3, 2022 -
July 10, 2020 (v1)Publication
The π-calculus has been advocated as a model to interpret, and give semantics to, languages withhigher-order features. Often these languages make use of forms of references (and hence viewing astore as set of references). While translations of references in π-calculi (and CCS) have appeared,the precision of such translations has not been fully...
Uploaded on: December 4, 2022 -
2022 (v1)Journal article
We study Milner's encoding of the call-by-value λ-calculus into the π-calculus. We show that, by tuning the encoding to two subcalculi of the π-calculus (Internal π and Asynchronous Local π), the equivalence on λ-terms induced by the encoding coincides with Lassen's eager normalform bisimilarity, extended to handle η-equality. As behavioural...
Uploaded on: December 3, 2022 -
April 22, 2015 (v1)Conference paper
We study the behavioural theory of πP, a π-calculus in the tradition of Fusions and Chi calculi. In contrast with such calculi, reduction in πP generates a preorder on names rather than an equivalence relation. We present two characterisations of barbed congruence in πP: the first is based on a compositional LTS, and the second is an...
Uploaded on: February 28, 2023 -
2016 (v1)Journal article
International audience
Uploaded on: February 28, 2023