Decision Procedures for Bitvector Reasoning in Lean
- 👤 Speaker: Siddharth Bhat (University of Cambridge)
- 📅 Date & Time: Thursday 23 January 2025, 17:00 - 18:00
- 📍 Venue: MR14 Centre for Mathematical Sciences
Abstract
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
Series This talk is part of the Formalisation of mathematics with interactive theorem provers series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- CMS Events
- Department of Computer Science and Technology talks and seminars
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- DPMMS Pure Maths study groups
- Formalisation of mathematics with interactive theorem provers
- Hanchen DaDaDash
- Interested Talks
- Martin's interesting talks
- MR14 Centre for Mathematical Sciences
- School of Physical Sciences
- School of Technology
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)


Thursday 23 January 2025, 17:00-18:00