3 results
Sylvain Salvati ; Igor Walukiewicz.
We propose a model-based approach to the model checking problem for recursive schemes. Since simply typed lambda calculus with the fixpoint operator, lambda-Y-calculus, is equivalent to schemes, we propose the use of a model of lambda-Y-calculus to discriminate the terms that satisfy a given […]
Published on June 11, 2015
Sylvain Salvati ; Igor Walukiewicz.
We consider lambda-Y-calculus as a non-interpreted functional programming language: the result of the execution of a program is its normal form that can be seen as the tree of calls to built-in operations. Weak monadic second-order logic (wMSOL) is well suited to express properties of such trees. We […]
Published on March 23, 2017
Javier Esparza ; Denis Kuperberg ; Anca Muscholl ; Igor Walukiewicz.
Negotiations are a formalism for describing multiparty distributed cooperation. Alternatively, they can be seen as a model of concurrency with synchronized choice as communication primitive. Well-designed negotiations must be sound, meaning that, whatever its current state, the negotiation can still […]
Published on January 16, 2018