Skip to Main content Skip to Navigation

Unique solution techniques for processes and functions

Abstract : The bisimulation proof method is a landmark of the theory of concurrency and programming languages: it is a proof technique used to establish that two programs, or two distributed protocols, are equal, meaning that they can be freely substituted for one another without modifying the global observable behaviour. Such proofs are often difficult and tedious; hence, many proof techniques have been proposed to enhance this method, simplifying said proofs. We study such a technique based on ’unique solution of equations’. In order to prove that two programs are equal, we show that they are solution of the same recursive equation, as long as the equation has the ’unique solution property’: two of its solutions are always equal. We propose a guarantee to ensure that such equations do have a unique solution. We test this technique against a long- standing open problem: the problem of full abstraction for Milner’s encoding of the call-by-value λ-calculus in the π-calculus.
Document type :
Complete list of metadatas

Cited literature [216 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Wednesday, September 23, 2020 - 4:06:08 PM
Last modification on : Wednesday, October 14, 2020 - 4:08:54 AM


Version validated by the jury (STAR)


  • HAL Id : tel-02947048, version 1



Adrien Durier. Unique solution techniques for processes and functions. Programming Languages [cs.PL]. Université de Lyon; Università degli studi (Bologne, Italie), 2020. English. ⟨NNT : 2020LYSEN016⟩. ⟨tel-02947048⟩



Record views


Files downloads