CS719: Topics in Mathematical Foundations of Formal Verification
Spring 2009


Instructor Supratik Chakraborty email: supratik [AT] cse ...
Friendly Teaching Assistants Abhisekh Sankaran email: abhisekh [AT] cse ...
  Annervaz K.M. email: annervaz [AT] cse ...

Announcements

  • Please subscribe to the CS719 page on moodle for latest updates, news, discussions, announcements etc.

Course Information

The purpose of this course is to provide students with a moderately in-depth exposure to a selection of mathematical topics that are needed as prerequisites for an advanced course or project in formal verification. This course is intended to become a prerequisite for CS615 "Formal Specification and Verification of Programs" . The exposure provided by this course is also intended to benefit students not necessarily working in the area of formal verification, but in related areas like programming languages, program analysis and optimization and logic. Some topics, especially in automata theory, overlap to some extent with the contents of CS712: Special Topics in Automata and Logics . CS712 is recommended as a companion (not a prerequisite) course.
This is a graduate level course recommended for students with a serious interest in formal methods and related areas. Good working knowledge of propositional and first order logics, automata theory and undergraduate level discrete mathematics is required for crediting/auditing the course. Students are also required to put in 4 to 5 hours of reading per week beyond the contact hours in class.

Hours

What When Where
Lectures Wed 17:15-18:45,
Thu 18:30-20:00
SIC 201, KReSIT Building
Office hour Wed 17:00-18:00 CFDVS Lab 1 (Maths basement)
(by email appointment)

Grading

Midsem 30%
Endterm 50%
Quizzes + Problem-solving paper 20%

Some more logistics ...

  • All exam and quizzes will be open book, notes and any material brought to the exam hall.
  • If you miss a quiz/exam for a genuine reason, meet the instructor after setting up an appointment.
  • Each quiz will carry equal weightage.
  • Informal discussion among students for the purpose of clarification is strongly encouraged.
  • There will be zero tolerance for dishonest means like copying solutions from others in quizzes, projects and end-term exam. Anybody found indulging in such activities will be summarily awarded an FR grade. The onus will be on the supposed offender to prove his or her innocence.
  • Problems ...

    Midterm Exam
    Endterm Exam

    Reading Material and References

    • B. A. Davey and H. A. Priestley, Introduction to Lattices and Orders, Second edition, Cambridge University Press, 2001
    • L. Libkin, Elements of Finite Model Theory, Springer, 2004
    • D. Kroening and O. Strichman, Decision Procedures: An Algorithmic Point of Viewd , Springer, 2008
    • Peter B. Andrews, An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof, 2nd edition, Springer, 2002
    • Herbert B. Enderton , A Mathematical Introduction to Logic, Second Edition, Academic Press, 2001
    • B. C. Pierce, Types and Programming Languages , The MIT Press, 2002
    • Introduction to Type Theory in The Nuprl Book , Cornell University, 1995 (http://www.cs.cornell.edu/Info/Projects/NuPrl/book/doc.html)
    • E. Gradel, W. Thomas, T. Wilke, Automata, Logic and Infinite Games: A Guide to Current Research , Springer, 2002
    • D. Perrin, J.E. Pin, Infinite Words: Automata, Semigroups, Logic and Games , Elsevier, 2004
    • J.C.M. Baeten and W.P. Wiejland, Process Algebra , Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 1990

    Current Reading List

    Order and Lattices:
    1. Chapters 1, 2 and 4 of B. A. Davey and H. A. Priestley, Introduction to Lattices and Orders, Second edition, Cambridge University Press, 2001

    Lecture Schedule

    Date Topics details
    Jan 9 Introduction, logistics. (Partial) orders: definitions, examples, chains, anti-chains, combining orders on smaller sets to obtain orders on larger sets, notions of minimal and maximal elements.
    Jan 13 Review of topics covered in last class, more on combining orders, constructing Hasse diagrams and reasoning about orders graphically.