John Harrison: Slides from recent talks

• Robin Milner, 1934–2010: His work in theorem proving and verification. Special session at POPL, Austin TX, 28 January 2011.
• The HOL Light formalization of Euclidean space. Joint Mathematics Meetings, New Orleans, 8 January 2011.
• On the Cruelty of Really Doing Formal Proofs. Principia Mathematica anniversary symposium, Cambridge, 27 November 2010.
• Formal Proofs of Floating-Point Algorithms. Invited talk at SCAN 2010, Lyon, France, 28 September 2010.
• Verifying floating-point algorithms using formalized mathematics. Software Science Seminar, University of Tsukuba, Japan, 17 September 2010.
• A Formal Proof of Pick's Theorem. ICMS 2010, Kobe, Japan, 15 September 2010.
• Theorem Proving for Verification. 4-lecture course at the Summer School in Marktoberdorf, Germany, 11-14 August 2010.
• Challenges in Formalizing Geometric Theorems: A Case Study of Pick's theorem. Invited talk at SCSS 2010, Linz, Austria, 30 July 2010.
• Challenges in Formalizing Geometric Theorems: A Case Study of Pick's theorem. Invited talk at AUTOMATHEO workshop, Edinburgh, 15 July 2010.
• Formal Theorem Proving and Sum-of-Squares Techniques. LIDS seminar, MIT, 16 April 2010.
• Formal Methods at Intel — An Overview. Invited talk at Second NASA Formal Methods Symposium, Washington DC, 14 April 2010.
• Decidability and undecidability in theories of real vector spaces. Joint Mathematics Meetings, San Francisco, 16 Jan 2010.
• Decidability and undecidability in theories of real vector spaces. Nijmegen workshop, 6th October 2009.
• HOL Light: future wishes. Talk at Workshop on Interactive Theorem Proving, Cambridge, 25th August 2009.
• Grumpy Old Man. Talk at Workshop on Interactive Theorem Proving, Cambridge, 24th August 2009.
• Without Loss of Generality (also HOL Light demo code). Invited talk at TPHOLs 2009, Munich, 19th August 2009.
• HOL Light: An Overview (also HOL Light demo code). Invited tutorial at TPHOLs 2009, Munich, 18th August 2009.
• Automated Reasoning and its Applications. Colloqium, VAST Institute of Mathematics, 30th July 2009.
• Decimal Transcendentals via Binary. ARITH-19, 10th June 2009.
• Fast and accurate Bessel function computation. ARITH-19, 9th June 2009.
• An OCaml-based automated theorem-proving textbook. Talk at PDXfunc, the Portland Functional Programming Study Group, 11th May 2009.
• Decidability and undecidability in theories of real vector spaces. UCLA Logic Colloquium, 24th April 2009.
• Theorem Proving for Verification (also HOL Light demo code). Galois talk, a repeat of the CAV tutorial, 16th September 2008.
• Floating-point reasoning at the bit level. Invited talk at CAV 2008's Bit-Precise Reasoning worskshop, 14th July 2008.
• Theorem Proving for Verification (also HOL Light demo code). Invited tutorial at CAV 2008, 9th July 2008.
• (Un)decidability results on real vector spaces arising from the formalization of mathematics. Special session at Computability in Europe 2008, 16th June 2008.
• Formal methods in education and industry. Workshop on formal methods in curriculum, SRI, Menlo Park, 10th June 2008.
• Formalizing an Analytic Proof of the Prime Number Theorem. TTVSI Festschrift for Mike Gordon, 26th March 2008.
• Verifying Nonlinear Real Formulas via Sums of Squares. TPHOLs 2007, Kaiserslautern, 13th September 2007.
• Automated and Interactive Theorem Proving (5 lectures). Marktoberdorf Summer School, 2nd-7th August 2007.
• Automating elementary number-theoretic proofs using Gröbner bases. CADE 21, Bremen, 17th July 2007.
• A Short Survey of Automated Reasoning. Invited talk at Algebraic Biology 2007, RISC Linz, Austria, 2nd July 2007.
• Niche decision procedures. Invited talk at Calculemus, RISC Linz, Austria, 27th June 2007.
• A Proof-Theoretic Approach to Nullstellensatz-type results. Methods of Proof Theory in Mathematics, Bonn, Germany, 8th June 2007.
• Formalizing Mathematics. University of Pittsburgh, Pittsburgh PA, 22nd March 2007.
• Sums of Squares for Real-Closed Fields. Carnegie-Mellon University, Pittsburgh PA, 19th March 2007.
• Formalizing Mathematics. University of Nice, France, 29th November 2006.
• Overview for Viorel Preoteasa's defence. Åbo Akademi, Turku, Finland, 10th November 2006.
• Verifying floating-point algorithms using formalized mathematics. Åbo Akademi, Turku, Finland, 9th November 2006.
• HOL Light demo. Video recording. Second International Congress on Mathematical Software, Castro Urdiales, Spain, 3rd September 2006.
• Formalizing Mathematics. Video recording. Invited talk at Second International Congress on Mathematical Software, Castro Urdiales, Spain, 3rd September 2006.
• Towards self-verification of HOL Light. IJCAR 2006, Seattle, 18th August 2006.
• Taking Theorem Proving Mainstream. Logic Colloquium 2006, Nijmegen, 29th July 2006.
• Formal verification of floating-point at Intel. Journées Nationales d'Arithmétique des Ordinateurs, Lyon, 2nd June 2006.
• Software Implementation of Decimal Floating-Point. Journées Nationales d'Arithmétique des Ordinateurs, Lyon, 1st June 2006.
• Real Numbers in the Real World: Industrial applications of theorem proving. Larry Paulson Festcolloquium, TU Munich, Germany, 30th May 2006.
• Floating-Point Verification by Theorem Proving. International School on Hardware Verification, Bertinori, Italy, 27th May 2006.
• Mathematical Modeling to Formally Prove Correctness. Gelato Federation meeting, San Jose CA, 24th April 2006.
• Proving invariants using many-sorted logic. IFIP WG 2.3 Meeting 45, Bruges, Belgium, 16th March 2006.
• SOS and SDP for the universal theory of reals. Decision Procedures Forum, Microsoft Research, Cambridge UK. 12th September 2005.
• A HOL theory of Euclidean space. TPHOLs 2005, Oxford, UK, 24th August 2005.
• Decision Procedures (3 lectures). TYPES summer school, Gothenburg, Sweden, 19th August 2005.
• Logical Decision Procedures in Practice (5 lectures). Marktoberdorf Summer School, 10th August 2005.
• Floating-Point Verification, FM Industry Day, Newcastle Upon Tyne, UK, 20th July 2005.
• Verifying the Verifier. IFIP WG 2.3 Meeting 44, Niagara Falls, Canada, 7th June 2005.
• Optimizing Scientific Libraries for the Itanium. Gelato Federation meeting, HP, Cupertino CA, 25th May 2005.
• Various notions of "format". IEEE 754 revision meeting, Sun Microsystems, Menlo Park CA, 21st April 2005.
• Verifying Floating-Point Algorithms using Formalized Mathematics. ReSMiQ seminar, Concordia University, Montreal, Quebec, 30th March 2005.
• Formal Verification using HOL Light. Kestrel Institute, Palo Alto CA, 22nd March 2005.
• Challenges for the Formal Approach to Proof. ASL meeting, Stanford University, Palo Alto CA, 20th March 2005.
• Deduction and Applications panel introductions. Workshop on the Verification Grand Challenge, SRI Menlog Park, 20th February 2005.
• Verifying floating-point algorithms using formalized mathematics. New York University, 6th February 2004.
• Formal Verification of Mathematical Algorithms. IFIP WG 2.3 Meeting 42, Philadelphia PA, 8th January 2004.
• Intel's Successes with Formal Methods. Symposium on Software, Science and Society in honour of Dick Kieburtz, 5th December 2003.
• Formal Verification of Mathematical Algorithms. Invited talk at RNC5, Lyon, France, 5th September 2003.
• Computation and reflection in Coq and HOL. Katholieke Universiteit Nijmegen, 20th August 2003.
• Formal Verification Methods 1, 2, 3, 4, 5. Marktoberdorf Summer School, Germany, 30th July 2003.
• Formal Verification at Intel. Invited talk at LICS 2003, Ottawa, Canada, 22nd June 2003.
• Isolating critical cases for reciprocals using integer factorization. ARITH16, Santiago de Compostela, Spain, 17th June 2003.
• Formal Verification Methods 1, 2, 3, 4, 5. Logic & Automated Reasoning Summer school, ANU, Canberra, 9-12th December 2002.
• Formal Verification in Industry. Logic & Automated Reasoning Summer school, Australian National University, Canberra, 6th December 2002.
• Automated Theorem Proving in Real Applications, Evans & Sutherland Distinguished Lecture Series, Salt Lake City UT, 21st October 2002.
• Real Numbers in Real Applications. Invited talk at Formalizing Continuous Mathematics workshop associated with TPHOLs 2002, 19th August 2002.
• Extracting Test Problems from Real Applications. Invited talk at PaPS workshop at CADE18, Copenhagen, Denmark, 31st July 2002.
• Using theorem proving in industry. Proofs-as-Programs Summer School, University of Oregon, Eugene OR, 2nd July 2002.
• Formal Verification at Intel. Katholieke Universiteit Nijmegen, 21st June 2002.
• Formal Verification of Mathematical Software. Workshop on the Mathematics of Mathematical Software, Portland OR, 4th June 2002.
• Formal Verification of Mathematical Algorithms. ASL 2002 Annual Meeting, Las Vegas NV, 3rd June 2002.
• Theorem Proving in Real Applications. Invited talk at Automated Reasoning Workshop 2002, Imperial College London, 4th April 2002.
• The LCF Approach to Theorem Proving. University of Manchester, 12th September 2001.
• Complex Quantifier Elimination in HOL (also poster). Work in progress session, TPHOLs 2001, Edinburgh, Scotland, 4th September 2001.
• Using theorem proving in industry. CIS Colloquium, University of Oregon, Eugene, OR, 7th June 2001.
• Formal verification of floating-point algorithms. Oregon Graduate Institute, 1st March 2001.
• Formal Verification of Floating Point Algorithms. Invited talk at AOC Workshop, Lyon, France, 15th November 2000.
• Formal verification of floating point trigonometric functions. FMCAD 2000, Austin, TX, 2nd November 2000.
• Verifying floating-point algorithms using formalized mathematics. University of Alberta Distinguished Lecture Series, 16th October 2000.
• Formal verification of IA-64 division algorithms. TPHOLs 2000, Portland OR, 15th August 2000.
• High-Level Verification using Theorem Proving and Formalized Mathematics, Invited talk at CADE 2000, CMU, Pittsburgh PA, 17th June 2000.
• Formal Verification of IA-64 division algorithms. SRI Menlo Park, CA, 13th January 2000.
• Formal Verification of Floating-Point Arithmetic. Oregon Graduate Institute, 1st December 1999.
• Formal verification of IA-64 division and square root software. Automated Reasoning Group talk, Cambridge, 1st October 1999.
• A Machine-Checked Theory of Floating Point Arithmetic. TPHOLs '99, Nice, France, 14 September 1999.
• Formal Verification in Industry (I) and (II). TYPES summer school 1999, Giens, France, 4th September 1999.
• Formal verification of IA-64 division and square root software. Oregon Graduate Institute, 24 August 1999.
• Formalizing Basic First Order Model Theory. TPHOLs '98, Canberra, Australia, 1st October 1998.
• Formalizing Dijkstra. TPHOLs '98, Canberra, Australia, 28th September 1998.
• Automated Reasoning: A Survey. Logic in Computer Science Block Seminar, Venice International University, 16th March 1998.
• HOL Light and its use in Verification. Third Dutch Proof Tools Day, Utrecht, 6th March 1998.
• Formalizing Dijkstra. Automated Reasoning Talks, Cambridge, 12th Feb 1998.
• Floating point verification: the exponential function. Intel JF Campus, Portland OR, 8th January 1998, and Oregon Graduate Institute, 9th January 1998.
• Floating point verification in HOL Light: the exponential function. Presented for me at AMAST, December 1997.
• Towards HOL2000?. Automated Reasoning Talks, Cambridge, 13th November 1997.
• First Order Logic in Practice. Presented at FTP'97.
• A Prolog Technology Theorem Prover - Mark Stickel (JAR 1988). Presentation at the Automated Reasoning Reading Group!, Cambridge, 26th June 1997.
• Floating point verification: the exponential function. Automated Reasoning Talks, Cambridge, 5th June 1997.
• Verifying Algorithms for the Transcendental Functions. Scottish Applied Theorem Proving Day, St. Andrews, 14th March 1997.
• Automated Reasoning. Cambridge University Computer Society lecture, Cambridge, 22nd January 1997.
• Introduction to Functional Programming: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12. Undergraduate lecture course, January - February 1997.
• Proof Automation and Proof Style. Invited talk at 1996 TYPES Working group annual meeting, Aussois, 16th December 1996.
• HOL Light: A Tutorial Introduction. Formal Methods in Computer-Aided Design, system tutorial/demo, Palo Alto, 7th November 1996.
• Theorem Provers and Computer Algebra Systems. University of Cambridge Computer Lab Wednesday Seminar, Cambridge, 2nd November 1994.

Page last updated Wednesday 9th February 2011.