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.

• 01/04: old exams.
• 12/29: solutions to homework assignments: HW#3, HW#4, HW#5.
• 12/22: solutions to homework assignments: HW#1, HW#2.
• 12/22: slides for Compositional Reasoning available.
• 12/07: slides for UNITY and the Temporal Verification available.
• 12/07: slides for the Owicki-Gries Method available.
• 12/01: slides for Frama-C with Coq available.
• 11/24: slides for Frama-C and ACSL available.
• 11/17: slides for Hoare Logic (II): Procedures available.
• 11/10: slides for Predicate Transformers available.
• 11/03: slides for Soundness and Completeness of Hoare Logic available.
• 10/27: slides for Hoare Logic (I) and two notes available.
• 10/13: slides and a note for Coq available.
• 09/22: slides for Course Introduction, Propositional Logic, and First-Order Logic and a note on Natural Deduction available.
• 09/20: this website created to complement the NTU COOL site for this course.

Yih-Kuen Tsay (蔡益坤), NTU IM Dept., 3366-1189, Xtsay@im.ntu.edu.twX (between the enclosing pair of X's)

Wednesday 2:20-5:20PM, Room 203, Management Building 2

Tuesday 1:30~2:00PM, Wednesday 1:30~2:00PM, or by appointment, Room 1108, Management Building 2.

Wei-Cheng Liu (劉韋成), Xr09725026@ntu.edu.twX (between the enclosing pair of X's).
Jack Su (蘇俊杰), Xr09725002@ntu.edu.twX (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: Reasoning about Programs (.5 week: 09/22a) [slides]
• Fundamentals: Propositional and First-Order Logics (2.5 weeks: 09/22b, 09/29, 10/06) [slides:Propositional Logic, First-Order Logic; notes: Natural Deduction]
• Verification Tools: Coq (2 weeks: 10/13, 10/20) [slides; notes:Tactics for Natural Deduction in Coq]
• Sequential Programs: Hoare Logic (I) (2 weeks: 10/27, 11/03) [slides:Hoare Logic, Soundess and Completeness; notes: Rules of Hoare Logic, Proofs with Hoare Logic]
• Predicate Transformers (1 week: 11/10) [slides]
• Procedures: Hoare Logic (II) (1 week: 11/17) [slides]
• Verification Tools: Frama-C + Plugins (2 weeks: 11/24, 12/01) [slides: Frama-C and ACSL, Frama-C with Coq; examples:Frama-C Examples]
• Concurrent, Reactive Systems: Owicki-Gries Method (1 week: 12/08) [slides]
• Concurrent, Reactive Systems: UNITY and Linear Temporal Logic (1 week: 12/15) [slides: UNITY,Temporal Verification]
• Selected Topics: Modular/Compositional Reasoning (1 week: 12/22) [slides]
• Selected Topics: Separation Logic (1 week: 12/29) [slides]
• Final Exam (2022/01/05)
• Broader Picture: An Overview of Formal Methods (1 week: 01/12) [slides]
• Wrap-Up Discussions (1 week: 01/19)

Homework Assignments 20%, Participation 10%, Final Exam 40%, Term Paper/Report 30%.

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. Introduction to C program proof with Frama-C and its WP plugin, Allan Blanchard, 2020.
11. 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.)
12. Certified Programming with Dependent Types , A. Chilipala. (Note: click on the link to author's free download site.)
13. The Z Notation: A Reference Manual, 2nd Edition, J.M. Spivey, 1992. (Note: click on the link to author's free download site.)
14. Software Engineering with B, J.B. Wordsworth, Addison-Wesley, 1996.
15. Modeling in Event-B: System and Software Engineering, J.-R. Abrial, Cambridge University Press, 2010.
16. The Temporal Logic of Reactive and Concurrent Systems: Specification, Z. Manna and A. Pnueli, Springer-Verlag, 1992.
17. Temporal Verification of Reactive Systems: Safety, Z. Manna and A. Pnueli, Springer, 1995.
18. Temporal Verification of Reactive Systems: Progress, Z. Manna and A. Pnueli, Book Draft, 1996. (Note: click on the link to authors' free download site.)
19. Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers, L. Lamport, Addison-Wesley, 2003.
20. Parallel Program Design: A Foundation, K.M. Chandy and J. Misra, Addison-Wesley, 1988.
21. A Discipline of Multiprogramming: Programming Theory for Distributed Applications, J. Misra, Springer, 2001
22. 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
23. 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.)