CSC-671
BS
Theory of Programming Languages
(DE) Domain Elective
Theory: 3 Cr. Hrs
Total: 3 Cr. Hrs
Classical formal methods: Formal specification and program correctness, Axiomatic proof systems (both Floyd-Hoare and Dijkstra's predicate transformers), Mills' functional correctness approach, abstract data types (both abstract model and algebraic specifications), and Scott-style denotational semantics based on least fixed points; Modern methods: Cleanroom, Model checking, Z, VDM; Case studies of formal methods in practice: PVS, Cleanroom use at IBM and NASA, Ariane 5, others
In Programmes
MPhil
MPhil (Computer Science)
Electives Pool —
Elective (Current Scheme)