CS 595C
Automated Decision Procedures
Winter 2013
Description:
There has been significant progress in automated decision procedures
during the last decade.
Satisfiability-Modula-Theories (SMT)-solvers,
which combine multiple decision procedures, have been successfully used
in solving problems in a variety of domains including program analysis,
testing, software verification, formal methods, computer security,
program synthesis, and electronic design automation. In this seminar, we
will discuss the basic algorithms used in modern SMT-solvers.
Each week, we will discuss one of the chapters from the following book:
Decision Procedures: An Algorithmic Point of View
Daniel Kroening, Ofer Strichman
There is also a website by
the authors that contains supplementary materials such as lecture notes
and extra reading.
Organizational Meeting:
Wednesday, January 9th at 1:00pm in HFH 1152.
Instructors:
Jo Atlee
and
Tevfik Bultan
Meeting time:
Wednesdays, 1:00pm
Location: HFH 1152
Enrollment Code: 75119
Units: This will be a 2 unit seminar
Course Work
- Each student will be responsible for presenting one chapter from the
textbook.
- Please prepare slides for presenting the high level ideas.
Use the whiteboard for detailed discussions and examples.
-
Everyone is required to read the chapter that will be discussed
before it is discussed in class.
Schedule and Presentations
- Week 1 (January 9): Organizational meeting
- Week 2 (January 16): Tevfik Bultan will present chapter 1
- Week 3 (January 23): Yutian Sun will present chapter 2
- Week 4 (January 30): Jaideep Nijjar will present chapter 3
- Week 5 (February 6): Abdulbaki (Baki) Aydin will present chapter 4 (4.1-4.3)
- Week 6 (February 13): Ivan (Bo) Bocic will present chapter 4 (4.4-4.6)
- Week 7 (February 20): Jaideep Nijjar will present chapter 7
- Week 8 (February 27): Ivan (Bo) Bocic will present chapter 9
- Week 9 (March 6): Yutian Sun will present chapter 10
- Week 10 (March 13): Abdulbaki (Baki) Aydin will present chapter 11