Towards 'up to context' reasoning about higher-order processes

Adrien Durier 1, 2, 3, 4 Daniel Hirschkoff 1, 2, 4 Davide Sangiorgi 2, 3
2 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
4 PLUME - Preuves et Langages
LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : 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 factorised out and erased. In higher-order process languages, however, such techniques are rare, as their soundness is usually delicate and difficult to establish. In this paper we adapt the technique of unique solution of equations, that implicitly captures 'up-to context' reasoning, to the setting of the Higher-order π-calculus. Equations are written and solved with respect to normal bisimilarity, chosen both because of its efficiency — its clauses do not require universal quantifications on terms supplied by the external observer — and because of the challenges it poses on the 'up-to context' reasoning and that already show up when proving its congruence properties.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download
Contributor : Adrien Durier <>
Submitted on : Wednesday, August 15, 2018 - 7:12:36 PM
Last modification on : Friday, April 19, 2019 - 4:54:53 PM
Long-term archiving on : Friday, November 16, 2018 - 1:00:30 PM


Files produced by the author(s)


  • HAL Id : hal-01857391, version 1


Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi. Towards 'up to context' reasoning about higher-order processes. 2018. ⟨hal-01857391⟩



Record views


Files downloads