SAT problems and bounded model checking: CS 601 2019 02 14
Channel: Orion Lawlor
Date: 15/02/2019

The theoretical boolean satisfiability problem, and how you can use a tool like CBMC to convert C programs with assert statements into a boolean expression for use with a SAT solver.  Slides:
https://docs.google.com/presentation/d/1TQOV8-OoAcqAHkydGJFWPb6XjZJ5r9egQ19BiP4Wvc0/

CBMC lecture notes:
https://docs.google.com/document/d/187IpLVt71wF-9GDbrimgXKTwWL65QM7XvME5kWPm50Q/