Integration of SMT Solvers with ITPs - There and Back Again

Add to your list(s) Download to your calendar using vCal

• Tjark Weber (University of Cambridge)
• Tuesday 02 March 2010, 13:00-14:00
• Computer Laboratory, William Gates Building, Room SS03.

If you have a question about this talk, please contact Thomas Tuerk.

How can interactive theorem provers benefit from SMT solvers? Can we integrate SMT solvers without enlarging the trusted code base? In this talk I will present an integration of SMT solvers with the HOL4 and Isabelle/HOL theorem provers. First translations from higher-order logic into the input languages of SMT solvers are described. Then LCF -style proof reconstruction for the SMT solver Z3 is explained, with a focus on efficiency. Our implementations outperform previous ones by several orders of magnitude. They show that LCF -style proof checking is feasible even for large SMT proofs with millions of inferences.

This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory Automated Reasoning Group Lunches
• Computer Laboratory, William Gates Building, Room SS03
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• yk373's list

Note that ex-directory lists are not shown.