A Framework for Compositional Model Checking
We present a compositional framework to model check higher-order programs with free variables of arbitrary order. Our framework extends traditional symbolic execution techniques with operational game semantics to model external components and thus check open terms. The goal of this framework is to check a term, e.g.\ a library, independent of its dependencies. We call our technique a framework considering the ability of game semantics to model external components regardless of the language targeted by the symbolic execution.
Sat 6 Apr
|13:30 - 14:30|
Nathanaël FijalkowCNRS, LaBRI, and Alan Turing Institute
|14:30 - 15:00|
|15:00 - 15:30|