↓ Skip to main content

Theorem Proving in Higher Order Logics

Overview of attention for book
Cover of 'Theorem Proving in Higher Order Logics'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Twenty Years of Theorem Proving for HOLs Past, Present and Future
  3. Altmetric Badge
    Chapter 2 Will This Be Formal?
  4. Altmetric Badge
    Chapter 3 A Short Presentation of Coq
  5. Altmetric Badge
    Chapter 4 An ACL2 Tutorial
  6. Altmetric Badge
    Chapter 5 A Brief Overview of PVS
  7. Altmetric Badge
    Chapter 6 A Brief Overview of HOL4
  8. Altmetric Badge
    Chapter 7 The Isabelle Framework
  9. Altmetric Badge
    Chapter 8 A Compiled Implementation of Normalization by Evaluation
  10. Altmetric Badge
    Chapter 9 LCF-Style Propositional Simplification with BDDs and SAT Solvers
  11. Altmetric Badge
    Chapter 10 Nominal Inversion Principles
  12. Altmetric Badge
    Chapter 11 Canonical Big Operators
  13. Altmetric Badge
    Chapter 12 A Type of Partial Recursive Functions
  14. Altmetric Badge
    Chapter 13 Formal Reasoning About Causality Analysis
  15. Altmetric Badge
    Chapter 14 Imperative Functional Programming with Isabelle/HOL
  16. Altmetric Badge
    Chapter 15 HOL-Boogie — An Interactive Prover for the Boogie Program-Verifier
  17. Altmetric Badge
    Chapter 16 Secure Microkernels, State Monads and Scalable Refinement
  18. Altmetric Badge
    Chapter 17 Certifying a Termination Criterion Based on Graphs, without Graphs
  19. Altmetric Badge
    Chapter 18 Lightweight Separation
  20. Altmetric Badge
    Chapter 19 Theorem Proving in Higher Order Logics
  21. Altmetric Badge
    Chapter 20 A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
  22. Altmetric Badge
    Chapter 21 Certified Exact Transcendental Real Number Computation in Coq
  23. Altmetric Badge
    Chapter 22 Formalizing Soundness of Contextual Effects
  24. Altmetric Badge
    Chapter 23 First-Class Type Classes
  25. Altmetric Badge
    Chapter 24 Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL
  26. Altmetric Badge
    Chapter 25 Proof Pearl: Revisiting the Mini-rubik in Coq
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
4 X users
wikipedia
3 Wikipedia pages

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
1 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Theorem Proving in Higher Order Logics
Published by
Springer Berlin Heidelberg, January 2008
DOI 10.1007/978-3-540-71067-7
ISBNs
978-3-54-071065-3, 978-3-54-071067-7
Editors

Otmane Ait Mohamed, César Muñoz, Sofiène Tahar

X Demographics

X Demographics

The data shown below were collected from the profiles of 4 X users who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 1 100%
Readers by discipline Count As %
Computer Science 1 100%