Paulson, Lawrence C. - Computer Laboratory, University of Cambridge

• Experiments On Supporting Interactive Proof Using Resolution
• The next seven hundred theorem provers Lawrence C Paulson
• Set Theory for Verification: II Induction and Recursion
• Mechanizing a Theory of Program Composition LAWRENCE C. PAULSON
• Constructible Lawrence C Paulson
• Verifying the SET Registration Protocols Giampaolo Bella
• Representing Component States in Higher-Order Logic
• Mechanizing Set Theory Cardinal Arithmetic and the Axiom of Choice
• Isabelle-91 Tobias Nipkow
• Foundations of Functional Programming
• Software Engineering Computer Science Tripos Part IA, Part II (General) and Diploma
• Strategic Principles in the Design of Isabelle Lawrence C. Paulson
• Proving Newton's Propositio Kepleriana using Geometry and Nonstandard Analysis in Isabelle
• A Compiler Generator for Semantic Grammars A DISSERTATION
• SET Cardholder Registration: the Secrecy Proofs
• A higher-order implementation of rewriting Lawrence Paulson
• A Formal Proof of Sylow's Theorem An Experiment in Abstract Algebra with Isabelle HOL
• Inductive Analysis of the Internet Protocol TLS Lawrence C. Paulson, University of Cambridge
• Mechanizing UNITY in Isabelle Lawrence C. Paulson
• Formal Verification of Cardholder Registration in SET
• Relations Between Secrets: Two Formal Analyses of the Yahalom Protocol
• A Simple Formalization and Proof for the Mutilated Chess Board
• Program Composition in Isabelle/UNITY Sidi O. Ehmety and Lawrence C. Paulson
• The Reflection Theorem: A Study in Meta-Theoretic Reasoning
• The Verification of an Industrial Payment Protocol The SET Purchase Phase
• Under consideration for publication in Formal Aspects of Computing Mechanizing Compositional
• Proof Pearl: Defining Functions Over Finite Sets Tobias Nipkow1
• Accountability Protocols: Formalized and Verified Giampaolo Bella, Universit`a di Catania
• Lightweight Relevance Filtering for Machine-Generated Resolution Problems
• Source-Level Proof Reconstruction for Interactive Theorem Proving
• Extending a Resolution Prover for Inequalities on Elementary Functions
• MetiTarski: An Automatic Prover for the Elementary Functions
• Applications of MetiTarski in the Verification of Control and Hybrid Systems
• Formal Verification of Analog Designs using William Denman, Behzad Akbarpour, Sofi`ene Tahar Mohamed H. Zaki and Lawrence C. Paulson
• MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions
• Formal Verification of Analog Circuits in the Presence of Noise and Process Variation
• Introduction to Isabelle Lawrence C. Paulson
• Security Protocols and Their Correctness 1 L. C. Paulson Security Protocols and Their Correctness
• Inductive Verification of Smart Card Protocols Giampaolo Bella
• Exploring Properties of Normal Multi-modal Logics in Simple Type Theory
• Verifying Second-Level Security Protocols Giampaolo Bella1,2
• A Fixedpoint Approach to (Co)Inductive and (Co)Datatype Definitions
• Proving Security Protocols Correct Lawrence C. Paulson
• Set Theory for Verification: I. From Foundations to Functions
• Verifying the SET Protocol: Overview Lawrence C. Paulson
• Mechanising BAN Kerberos by the Inductive Method
• Mechanical Proofs about a Non-Repudiation Protocol
• A Combination of Nonstandard Analysis and Geometry Theorem Proving, with Application
• Reasoning about Coding Theory: The Benefits We Get from Computer Algebra
• Using Isabelle to Prove Properties of the Kerberos Authentication System
• Verification of The SET Protocol Giampaolo Bella, Fabio Massacci, Lawrence C. Paulson et al.
• Fundamenta Informaticae 34 (1999) 120 1 A Pragmatic Approach to Extending Provers by Computer
• Kerberos Version IV: Inductive Analysis of the Secrecy Goals
• Automation for Interactive Proof Computer Laboratory
• A Generic Tableau Prover and its Integration with Isabelle
• Towards Automatic Proofs of Inequalities Involving Elementary Functions
• Isabelle's Object-Logics Lawrence C. Paulson
• Should Your Specification Language Be Typed? LESLIE LAMPORT
• A Sectioning Concept for Isabelle Florian Kammuller1
• Verifying Multicast-Based Security Protocols Using the Inductive Method
• Case Splitting in an Automatic Theorem Prover for Real-Valued Special Functions