A Proof Assistant for Higher-Order Logic

[1]  Lawrence C. Paulson,et al.  The Inductive Approach to Verifying Cryptographic Protocols , 2021, J. Comput. Secur..

[2]  Tobias Nipkow,et al.  Structured Proofs in Isar/HOL , 2002, TYPES.

[3]  Lawrence C. Paulson,et al.  Relations Between Secrets: Two Formal Analyses of the Yahalom Protocol , 2001, J. Comput. Secur..

[4]  David Aspinall,et al.  Proof General: A Generic Tool for Proof Development , 2000, TACAS.

[5]  Paul Hudak,et al.  The Haskell School of Expression , 2000 .

[6]  Lawrence C. Paulson,et al.  Inductive analysis of the Internet protocol TLS , 1999, TSEC.

[7]  Tobias Nipkow,et al.  HOLCF = HOL + LCF , 1999, Journal of Functional Programming.

[8]  Wolfgang Naraschewski,et al.  Object-Oriented Verification Based on Record Subtyping in Higher-Order Logic , 1998, TPHOLs.

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

[10]  M. Gordon,et al.  Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[11]  T. Nipkom.  Functional unification of higher-order patterns , 1993, LICS 1993.

[12]  Martín Abadi,et al.  A logic of authentication , 1990, TOCS.

[13]  Roger M. Needham,et al.  Using encryption for authentication in large networks of computers , 1978, CACM.

[14]  M. V. Wilkes,et al.  The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

[15]  Tobias Nipkow,et al.  The supplemental Isabelle/HOL library , 2002 .

[16]  Markus Wenzel,et al.  Isabelle, Isar - a versatile environment for human readable formal proof documents , 2002 .

[17]  Jacques D. Fleuriot,et al.  Mechanizing Nonstandard Real Analysis , 2000 .

[18]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[19]  R. Bird.  Introduction to functional programming using Haskell, Second Edition , 1998 .

[20]  G. Lowe,et al.  Breaking and Fixing the Needham-Schroeder Public-Key Protocol using CSP and FDR , 1996 .

[21]  Lawrence C. Paulson,et al.  ML for the working programmer , 1991 .

[22]  Robin Milner,et al.  Definition of standard ML , 1990 .

[23]  J. Girard,et al.  Proofs and types , 1989 .

[24]  Lawrence C. Paulson,et al.  Logic and computation - interactive proof with Cambridge LCF , 1987, Cambridge tracts in theoretical computer science.

[25]  Kenneth H. Rosen,et al.  Discrete Mathematics and its applications , 2000 .

[26]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .