Theorem Proving in Higher Order Logics

ISBN-13: 9783540710653 / Angielski / Miękka / 2008 / 338 str.

Otmane Ait Mohamed

Opis

This volume constitutes the proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2008), which was held during August 18-21, 2008 in Montreal, Canada. TPHOLs covers all aspects of theorem proving in higher order logics as well as related topics in theorem proving and veri?cation. There were 40 papers submitted to TPHOLs 2008 in the full research c- egory, each of which was refereed by at least four reviewers selected by the ProgramCommittee. Of these submissions, 17 researchpapers and 1 proofpearl were accepted for presentation at the conference and publication in this v- ume. In keeping with longstanding tradition, TPHOLs 2008 also o?ered a venue for the presentation of emerging trends, where researchers invited discussion by means of a brief introductory talk and then discussed their work at a poster session. A supplementary proceedings volume was published as a 2008 technical report of Concordia University. The organizersaregratefulto MichaelGordonand StevenMiller for agreeing togiveinvitedtalksatTPHOLs2008.Aspartofthecelebrationofthe20yearsof TPHOLs, TPHOLs 2008 invited tool developers and expert users to give special tool presentations of the most representative theorem provers in higher order logics. The following speakers kindly accepted our invitation and we aregrateful tothem: YvesBertot(Coq), MattKaufmann(ACL2), SamOwre(PVS), Konrad Slind (HOL), and Makarius Wenzel (Isabelle).

Spis treści

Invited Papers.- Twenty Years of Theorem Proving for HOLs Past, Present and Future.- Will This Be Formal?.- Tutorials.- A Short Presentation of Coq.- An ACL2 Tutorial.- A Brief Overview of PVS.- A Brief Overview of HOL4.- The Isabelle Framework.- Regular Papers.- A Compiled Implementation of Normalization by Evaluation.- LCF-Style Propositional Simplification with BDDs and SAT Solvers.- Nominal Inversion Principles.- Canonical Big Operators.- A Type of Partial Recursive Functions.- Formal Reasoning About Causality Analysis.- Imperative Functional Programming with Isabelle/HOL.- HOL-Boogie — An Interactive Prover for the Boogie Program-Verifier.- Secure Microkernels, State Monads and Scalable Refinement.- Certifying a Termination Criterion Based on Graphs, without Graphs.- Lightweight Separation.- Real Number Calculations and Theorem Proving.- A Formalized Theory for Verifying Stability and Convergence of Automata in PVS.- Certified Exact Transcendental Real Number Computation in Coq.- Formalizing Soundness of Contextual Effects.- First-Class Type Classes.- Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL.- Proof Pearls.- Proof Pearl: Revisiting the Mini-rubik in Coq.

Blurb

This book constitutes the refereed proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2008, held in Montreal, Canada, in August 2008.

The 17 revised full papers presented together with 1 proof pearl (concise and elegant presentations of interesting examples), 5 tool presentations, and 2 invited papers were carefully reviewed and selected from 40 submissions. The papers cover all aspects of theorem proving in higher order logics as well as related topics in theorem proving and verification such as formal semantics of specification, modeling, and programming languages, specification and verification of hardware and software, formalisation of mathematical theories, advances in theorem prover technology, as well as industrial application of theorem provers.