Theorem Proving in Higher Order Logics

[1]  John Harrison Floating Point Verification in HOL , 1995, TPHOLs.

[2]  MA John Harrison PhD Theorem Proving with the Real Numbers , 1998, Distinguished Dissertations.

[3]  Dirk van Dalen,et al.  Logic and structure , 1980 .

[4]  Shankar Natarajan,et al.  The Formal Semantics of PVS , 1999 .

[5]  Peter W. Markstein Computation of Elementary Functions on the IBM RISC System/6000 Processors , 1990, IBM J. Res. Dev..

[6]  Benjamin C. Pierce,et al.  Simple type-theoretic foundations for object-oriented programming , 1994, Journal of Functional Programming.

[7]  C. Seger,et al.  Formally Verifying IEEE Compliance of Floating-Point Hardware , 2022 .

[8]  Matt Kaufmann,et al.  A Mechanically Checked Proof of the , 1998 .

[9]  Peter W. Markstein,et al.  IA-64 and elementary functions - speed and precision , 2000 .

[10]  J. Strother Moore,et al.  An Industrial Strength Theorem Prover for a Logic Based on Common Lisp , 1997, IEEE Trans. Software Eng..

[11]  Lawrence Charles Paulson,et al.  Isabelle: A Generic Theorem Prover , 1994 .

[12]  A. J. M. van Gasteren,et al.  On the Shape of Mathematical Arguments , 1990, Lecture Notes in Computer Science.

[13]  Lawrence C. Paulson,et al.  Isabelle: The Next 700 Theorem Provers , 2000, ArXiv.

[14]  Mark Staples Representing WP Semantics in Isabelle/ZF , 1999, TPHOLs.

[15]  Steve Linton,et al.  VSDITLU: a verifiable symbolic definite integral table look-up , 1999, CADE.

[16]  Bruno Dutertre,et al.  Elements of Mathematical Analysis in PVS , 1996, TPHOLs.

[17]  Bart Jacobs,et al.  Specification of the JavaCard API in JML , 2000, CARDIS.

[18]  Burkhart Wolff,et al.  A Corrected Failure Divergence Model for CSP in Isabelle/HOL , 1997, FME.