Section: Application Domains
Model checking operational semantics
When operational semantics is presented as inference rules, it can often be encoded naturally as a logic program, which means that it is usually easy to animate such semantic specifications in direct and natural ways. Given the natural duality between finite success and finite failure (given a proof theoretic foundations in papers such as  and  ) it is also possible to describe model checking systems from a proof theoretic setting.
One application area for this work is, thus, the development of model checking software that can work on linguistic expressions that may contain bound variables. Specific applications could be towards checking bisimulation of -calculus and -calculus expressions.
More about a prototype model checker in this area is described below.