Quicklinks to:
Instructor etc.,
Course Work,
Schedule,
Homeworks,
Project,
Academic Dishonesty Policy
Course Information
Instructor & TA
Meeting Time & Venue
- Class: Gilman 0611, MWF 2:10-3:00 PM
- Office Hrs (Samik): Appointment via Email
- Office Hrs (Ru): W 3-5 @ Pearson 0145
Discussions on WebCT: Enrolled students
can access
WebCT
using their ISU net-ID and same passwd as their iastate.edu
email account. I will post the homeworks in the assignment section of
course page in WebCt.
If you have a documented disability and anticipate needing
accommodations in this course, please make arrangements to meet with
me soon. Please request that a Disability Resources staff send a SAAR
form verifying your disability and specifying the accommodation you
will need.
Text Material & Resources
- Logic in Computer Science: Huth & Ryan
- Model Checking: Clarke, Grumberg & Peled
- Spin Model Checker: Holzmann
- Software Reliability Methods: Peled
- Automated Theorem Proving: Newborn
Syllabus
Propositional & Predicate logic, Logical inference, Temporal logic
(CTL, LTL, CTL*), Kripke structure, Model checking, Labeled transition
system, Process algebra CCS, Modal mu-calculus, Program verification,
Counter-example analysis, Theorem prover basics.
As per the pre-requisites Com S 330 (Discrete Computational Structures),
311 (Algorithms), registered students are assumed to have reasonable
background in logic, set theory, graph/search algorithms.
Course work (subject to discussion)
We have not assigned any specific text book for this course. You are
required to take detailed notes during the class lecture. If needed,
you will be referred to online materials to study or handouts will be
provided in class.
- Homeworks: 6-7 homeworks will be assigned. Each homework
will have at most 1 week turn-around deadline. We will try NOT to have any deadline
extensions.
- Midterms & Final: 2 Midterms will be held in February and
March. Midterm and Final exams' exact date/time will be announced in
class.
- Projects: Project work will be done in groups. Each group will
write a report and present their work in class at the end
of the semester. Groups may be interviewed by the instructor to assess
grades of group-members.
- Grading Policy:
Overall score in the course will be weighted average of the individual
scores. Typically:
>90% : A-, A
>75% : B-, B, B+
>60% : C-, C, C+
>45% : D-, D, D+
Schedule
- Week 1:
Intro to CTL model checking
- Week 2:
Equivalences, Labeling Algorithm
- Week 3:
Fixed points
- Week 4:
Fairness in CTL
- Week 5:
Binary Decision Diagrams
- Week 6:
Linear Temporal Logic
- Week 7:
Buchi Automata
- Week 8:
Homeworks
- Homework 1: Intro to CTL
- Homework 2: CTL, Fixed points
- Homework 3: SMV
- Homework 4:
- Homework 5:
- Homework 6:
Academic Dishonesty
Collaborations of any form during the exams and for homework
assignments will not be tolerated. Homeworks must be individual's
original work. Working in groups is only allowed in
projects. Dishonesty will result in an automatic F grade and a
formal charge of Academic Dishonesty will be reported through the Dean
of Students' Office (see the
University's Academic Dishonesty Policy for details).