Decision Procedures for Bitvector Reasoning in Lean

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

• Siddharth Bhat (University of Cambridge)
• Thursday 23 January 2025, 17:00-18:00
• MR14 Centre for Mathematical Sciences.

If you have a question about this talk, please contact Anand Rao Tadipatri.

I’ll be giving a broad overview of the decision procedures we have been building for bitvector reasoning in Lean, with both fixed and infinite width. Time permitting, I shall sketch the design and mechanization strategy of the infinite width decision procedure, since the core involves verifying a cute model checking algorithm (k-induction), with games to be played to hook in a SAT solver into the tactic loop.

Note: work done in collaboration with the wider Lean community, and effort led by the Lean FRO : Henrik Boving, Kim Morrison, and Leo de Moura.

=== Hybrid talk ===

Join Zoom Meeting https://cam-ac-uk.zoom.us/j/87143365195?pwd=SELTNkOcfVrIE1IppYCsbooOVqenzI.1

Meeting ID: 871 4336 5195

Passcode: 541180

This talk is part of the Formalisation of mathematics with interactive theorem provers series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge talks
• DPMMS Lists
• DPMMS Pure Maths study groups
• DPMMS info aggregator
• DPMMS lists
• Department of Computer Science and Technology talks and seminars
• Formalisation of mathematics with interactive theorem provers
• Hanchen DaDaDash
• Interested Talks
• MR14 Centre for Mathematical Sciences
• School of Physical Sciences
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.