Theorem Proving in Higher Order Logics

Verified lexical analysis.- Extending window inference.- Program abstraction in a higher-order logic framework.- The village telephone system: A case study in formal software engineering.- Generating embeddings from denotational descriptions.- An interface between CLAM and HOL.- Classical propositional decidability via Nuprl proof extraction.- A comparison of PVS and Isabelle/HOL.- Adding external decision procedures to HOL90 securely.- Formalizing basic first order model theory.- Formalizing Dijkstra.- Mechanical verification of total correctness through diversion verification conditions.- A type annotation scheme for Nuprl.- Verifying a garbage collection algorithm.- Hot: A concurrent automated theorem prover based on higher-order tableaux.- Free variables and subexpressions in higher-order meta logic.- An LPO-based termination ordering for higher-order terms without ?-abstraction.- Proving isomorphism of first-order logic proof systems in HOL.- Exploiting parallelism in interactive theorem provers.- I/O automata and beyond: Temporal logic and abstraction in Isabelle.- Object-oriented verification based on record subtyping in Higher-Order Logic.- On the effectiveness of theorem proving guided discovery of formal assertions for a register allocator in a high-level synthesis system.- Co-inductive axiomatization of a synchronous language.- Formal specification and theorem proving breakthroughs in geometric modeling.- A tool for data refinement.- Mechanizing relevant logics with HOL.- Case studies in meta-level theorem proving.- Formalization of graph search algorithms and its applications.