Advanced Model Checking

Summer Semester 2015

Armin Biere


No lecture on May 27.


This lecture is about algorithms for SAT and applications of SAT to model checking and related problems.

The lecture takes place Wednesdays from 8:30 to 10:00 in room S3 048.


Version 2015.2 of the slide set is available as amcslides.pdf.

You find a description of the Plaisted-Greenbaum polarity based encoding in our recent TACAS paper.

As background material consider the Handbook of Satisfiability (see also the tutorial page of the SAT association).

The SAT Association, the SAT conference, and the SAT Competition.

SMVFlatten tool to flatten SMV models.

Further related papers are listed on our publication page, additional software, particularly SAT solvers, can be found on our software page