Section: Application Domains
The Parsifal project has been developing approaches to meta-logic and theorem proving architecture that should allow for reasoning about the operational semantics of computational systems. Early work along these lines was reported in  . The meta-logical framework reported in that paper has been greatly extended by Miller and Tiu  ,  . These papers report success in the way such meta-logic can be used interactive to establish important properties concerning operational semantics. This work should naturally lead to addressing the following different applications.
Model checking as deduction. Being able to see model checking as a special kind of deduction should have many benefits for establishing the correctness of computational systems.
The POPLmark Challenge: Mechanized Meta-theory for the Masses
Correctness of security protocols
Mixing deduction and computation, as in, for example, proof carrying code.