Talks.cam will close on 1 July 2026, further information is available on the UIS Help Site
 

University of Cambridge > Talks.cam > SANDWICH Seminar (Computer Laboratory) > Decision procedures for parametric multi-width bitvectors

Decision procedures for parametric multi-width bitvectors

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

If you have a question about this talk, please contact Rini Banerjee.

I’m going to be explaining a new decision procedure theory of parametric, multi-width bitvectors. These are statements which are universally quantified over multiple bitwidths, and multiple bitvectors of these different bitwidths. I’ll sketch out a sound and complete decision procedure for the linear-bitwise theory, and time permitting, indicate why the nonlinear theory is undecidable.

This talk is part of the SANDWICH Seminar (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2026 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity