The LSV seminar takes place on Tuesday at 11:00 AM. The usual location is the conference room at Pavillon des Jardins (venue). If you wish to be informed by e-mail about upcoming seminars, please contact Stéphane Le Roux and Matthias Fuegger.
The seminar is open to public and does not require any form of registration.
Using higher-order recusion schemes, one can model the computation flow of functional programs, and produce trees abstracting their set of executions. The higher-order model-checking problem is concerned with the verification of a logical property -- typically expressed in monadic second-order logic -- over this tree. A key feature of this logic being that it allows to express finitary as well as infinitary properties.
Ong proved the decidability of this problem in 2006 using game semantics to analyze higher-order recursion. Since then, other semantic approaches lead to alternate proofs, each of them bringing a new semantic insight to the problem. One of them, by Kobayashi and Ong, made use of intersection types.
In this talk, I will introduce the higher-order model-checking problem, and explain how Paul-André Melliès and I could obtain a new proof of Ong's decidability result by carefully analyzing the Kobayashi-Ong type system at the light of linear logic and of its semantics.