Model checking games: the recent advances on parity games
I will talk about parity games. The first objective is to show where they appear in verification and synthesis, in particular as algorithmic back end for model checking different logical formalisms.
The second objective is to present the latest results on this model, which are neatly explained using the newly introduced notion of universal graphs.
Sat 6 AprDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
13:30 - 15:30
|Model checking games: the recent advances on parity games|
I: Nathanaël Fijalkow CNRS, LaBRI, and Alan Turing Institute
|A Framework for Compositional Model Checking|
|Modalities as prices: a game model of intuitionistic linear logic with subexponentials|