Theorem Proving in Higher Order Logics 21st International Conference, TPHOLs 2008, Montreal, Canada, August 18-21, 2008. Proceedings /

• Corporate Author: SpringerLink (Online service)
• Other Authors: Mohamed, Otmane Ait (Editor), Muñoz, César (Editor), Tahar, Sofiène (Editor)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.
• Series: Lecture Notes in Computer Science, 5170
• Subjects: Computer science.; Architecture, Computer.; Software engineering.; Programming languages (Electronic computers).; Computer logic.; Mathematical logic.; Computer Science.; Programming Languages, Compilers, Interpreters.; Computer System Implementation.; Software Engineering/Programming and Operating Systems.; Mathematical Logic and Formal Languages.; Logics and Meanings of Programs.; Software Engineering.

 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. 

 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.