The use of logic as an aid to programming. Formal semantics of programming languages: imperative programs, functional programs, parallel processes, communicating processes. Theorems about programs: transformations, reformations, state theorems. Partial and total correctness. Refinement theorems: by steps, by parts. Semantics of recursion and the least-fixed- point construction; monotonicity, continuity. Semantics of data types; data refinement.

• Fall, 2004

• Eric Hehner

• This course is also a undergraduate course - CSC465.