This is an introductory course on formal software specification and verification, covering various formalisms, methods, and tools for specifying the properties of a software program and for verifying that the program meets its specification. Its goal is to acquaint the students with fundamentals of formal software verification and to prepare them for conducting research in the area. We will focus on deductive (theorem proving) methods. A separate, complementary course entitled “Automatic Verification” covers algorithmic (model checking) methods.

• Dec. 26: slides for Why and for Temporal Verification available.
• Dec. 26: HW#4 and HW#5 due on Dec. 29.
• Dec. 21: slides for Owicki-Gries and for UNITY available.
• Dec. 15: slides for Z and B available.
• Nov. 17: slides for Hoare Logic (II): Procedures available.
• Nov. 03: slides for Predicate Transformers available.
• Nov. 03: HW#3 due on Nov. 17.
• Oct. 27: slides for Soundness and Completeness of Hoare Logic available.
• Oct. 20: HW#2 due on Oct. 27.
• Oct. 20: slides for Hoare Logic (I) and two notes available.
• Oct. 06: slides for Logical Proofs in Coq available.
• Sep. 28: slides for First-Order Logic available.
• Sep. 22: HW#1 due on Sep. 29.
• Sep. 15: HW#0 due on Sep. 22.
• Sep. 15: slides for Course Introduction and Propositional Logic and a note on Natural Deduction available.
• Sep. 12: this website is the sole source of all up to date course information and syllabus; there will be no separate PDF version.

Yih-Kuen Tsay (蔡益坤), Room 1108, Management II, 3366-1189, Xtsay@im.ntu.edu.twX (between the enclosing pair of X's)

Thursday 2:20-5:20PM, Room 303, College of Management, Building II
Note: when the class is small enough, we will meet in the seminar room on the 11th floor of that building.

Wednesday 1:30-2:30PM (Room 1108, Management II) or by appointment

Ming-Hsien Tsai (蔡明憲), 3366-1205, Xmhtsai208@gmail.comX (between the enclosing pair of X's).

Computer Programming and Discrete Mathematics

Class Notes and Selected Readings

We shall seek to strike a balance between depth and breadth, covering both the foundations and some of the more successful formalisms, techniques, and tools. Below is a tentative list of topics and their schedule:

• Introduction (.5 week: 09/15a)
  [slides]
• Propositional and First-Order Logics (2.5 weeks: 09/15b, 09/22, 09/29)
  [slides:Propositional Logic, First-Order Logic; notes: Natural Deduction]
• Logical Proofs in the Coq Proof Assistant (1 week: 10/06)
  [slides; Tactics for Natural Deduction in Coq]
• ESWeek + ATVA 2011 (10/09 – 10/14)
• Verification of Sequential Programs: Hoare Logic (2 weeks: 10/20, 10/27)
  [slides:Hoare Logic, Soundess and Completeness; notes: Rules of Hoare Logic, Proofs with Hoare Logic]
• Predicate Transformers and Program Derivation (1 week: 11/03)
  [slides]
• Procedures (+ Object Orientation) (1 week: 11/10)
  [slides]
• Program Verification Tools: Coq, Why, and Frama-C (2 weeks: 11/17, 11/24)
  [slides: Why, Frama-C]
• Data Refinement + Formal Methods: Z and B (2 weeks: 12/01, 12/03 or 12/10)
  [slides: Z, B]
• Concurrent, Reactive Systems: Owicki-Gries Method, UNITY, Linear Temporal Logic (2 weeks: 12/15, 12/22)
  [slides:Owicki-Gries, UNITY, Temporal Verification]
• Final (2011/12/29)
• Selected Topic: Modular/Compositional Reasoning (1 week: 2012/01/05)
  [slides]
• Selected Topic: Separation Logic (1 week: 2012/01/12)

Homework Assignments 15%, Final 35%, Term Paper/Report 40%, Participation 10%.

1. Logic for Computer Science: Foundations of Automatic Theorem Proving, J.H. Gallier, Harper & Row Publishers, 1985. (Note: click on the link to author's free download site.)
2. Proof Theory and Automated Deduction, J. Goubault-Larrecq and I. Mackie, Kluwer Academic Publishers, 1997.
3. Logic in Computer Science: Modelling and Reasoning about Systems, M. Huth and M. Ryan, Cambridge University Press, 2004.
4. Foundations for Programming Languages, J.C. Mitchell, The MIT Press, 1996.
5. Formal Syntax and Semantics of Programming Languages, K. Slonneger and B.L. Kurtz, Addison-Wesley, 1995.
6. Verification of Sequential and Concurrent Programs, 2nd Edition, K.R. Apt and E.-R. Olderog, Springer-Verlag, 1997.
7. The Science of Programming, D. Gries, Springer-Verlag, 1981.
8. Predicate Calculus and Program Semantics, E.W. Dijkstra and C.S. Scholten, Springer-Verlag, 1990.
9. Programming from Specifications, 2nd Edition, C. Morgan, 1994.
10. Software Foundations, B.C. Pierce, C. Casinghino, M. Greenberg, V. Sjöberg, and B. Yorgey. (Note: click on the link to authors' free download site.)
11. Certified Programming with Dependent Types , A. Chilipala. (Note: click on the link to author's free download site.)
12. The Z Notation: A Reference Manual, 2nd Edition, J.M. Spivey, 1992. (Note: click on the link to author's free download site.)
13. Software Engineering with B, J.B. Wordsworth, Addison-Wesley, 1996.
14. Modeling in Event-B: System and Software Engineering, J.-R. Abrial, Cambridge University Press, 2010.
15. The Temporal Logic of Reactive and Concurrent Systems: Specification, Z. Manna and A. Pnueli, Springer-Verlag, 1992.
16. Temporal Verification of Reactive Systems: Safety, Z. Manna and A. Pnueli, Springer, 1995.
17. Temporal Verification of Reactive Systems: Progress, Z. Manna and A. Pnueli, Book Draft, 1996. (Note: click on the link to authors' free download site.)
18. Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers, L. Lamport, Addison-Wesley, 2003.
19. Parallel Program Design: A Foundation, K.M. Chandy and J. Misra, Addison-Wesley, 1988.
20. A Discipline of Multiprogramming: Programming Theory for Distributed Applications, J. Misra, Springer, 2001
21. Beauty Is Our Business: A Birthday Salute to Edsger W. Dijkstra, Edited by W.H.J. Feijen, A.J.M. van Gasteren, D. Gries, and J. Misra, Springer-Verlag, 1990
22. The Formal Methods Page: http://formalmethods.wikia.com/wiki/Formal_methods, J. Bowen. (Note: this Web portal provides links to numerous formal methods and tools.)