↓ 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 On the Correctness of Operating System Kernels
  3. Altmetric Badge
    Chapter 2 Theorem Proving in Higher Order Logics
  4. Altmetric Badge
    Chapter 3 Shallow Lazy Proofs
  5. Altmetric Badge
    Chapter 4 Mechanized Metatheory for the Masses: The PoplMark Challenge
  6. Altmetric Badge
    Chapter 5 A Structured Set of Higher-Order Problems
  7. Altmetric Badge
    Chapter 6 Formal Modeling of a Slicing Algorithm for Java Event Spaces in PVS
  8. Altmetric Badge
    Chapter 7 Proving Equalities in a Commutative Ring Done Right in Coq
  9. Altmetric Badge
    Chapter 8 A HOL Theory of Euclidean Space
  10. Altmetric Badge
    Chapter 9 A Design Structure for Higher Order Quotients
  11. Altmetric Badge
    Chapter 10 Axiomatic Constructor Classes in Isabelle/HOLCF
  12. Altmetric Badge
    Chapter 11 Meta Reasoning in ACL2
  13. Altmetric Badge
    Chapter 12 Reasoning About Java Programs with Aliasing and Frame Conditions
  14. Altmetric Badge
    Chapter 13 Theorem Proving in Higher Order Logics
  15. Altmetric Badge
    Chapter 14 Verifying a Secure Information Flow Analyzer
  16. Altmetric Badge
    Chapter 15 Proving Bounds for Real Linear Programs in Isabelle/HOL
  17. Altmetric Badge
    Chapter 16 Essential Incompleteness of Arithmetic Verified by Coq
  18. Altmetric Badge
    Chapter 17 Verification of BDD Normalization
  19. Altmetric Badge
    Chapter 18 Extensionality in the Calculus of Constructions
  20. Altmetric Badge
    Chapter 19 A Mechanically Verified, Sound and Complete Theorem Prover for First Order Logic
  21. Altmetric Badge
    Chapter 20 A Generic Network on Chip Model
  22. Altmetric Badge
    Chapter 21 Formal Verification of a SHA-1 Circuit Core Using ACL2
  23. Altmetric Badge
    Chapter 22 From PSL to LTL: A Formal Validation in HOL
  24. Altmetric Badge
    Chapter 23 Proof Pearl: A Formal Proof of Higman’s Lemma in ACL2
  25. Altmetric Badge
    Chapter 24 Proof Pearl: Dijkstra’s Shortest Path Algorithm Verified with ACL2
  26. Altmetric Badge
    Chapter 25 Theorem Proving in Higher Order Logics
  27. Altmetric Badge
    Chapter 26 Proof Pearl: Using Combinators to Manipulate let-Expressions in Proof
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

blogs
1 blog
twitter
4 X users
wikipedia
7 Wikipedia pages

Readers on

mendeley
7 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 2005
DOI 10.1007/11541868
ISBNs
978-3-54-028372-0, 978-3-54-031820-0
Editors

Joe Hurd, Tom Melham

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 7 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Germany 1 14%
Argentina 1 14%
Unknown 5 71%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 29%
Student > Master 2 29%
Researcher 2 29%
Professor > Associate Professor 1 14%
Readers by discipline Count As %
Computer Science 5 71%
Mathematics 1 14%
Unknown 1 14%