Search

• < Previous
• 1
• Next >

---

Using models to model-check recursive schemes

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&nbsp;[&hellip;]

---

Soundness in negotiations

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&nbsp;[&hellip;]

---