Fall 2007
pdf

View schedules for



CS 476
Program Verification

Credit:  3 or 4 hours.


Examines formal methods for demonstrating correctness and other properties of programs; includes an overview of predicate calculus. Topics include: invariant assertions, Hoare axiomatics, well-founded orderings for proving termination, structural induction, computational induction, data structures, and parallel programs. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 225; CS 273 or MATH 414.


Section Information
CRNTypeSectionTimeDays Location  Instructor
35855  lecture- discussion  D3 09:30 AM - 10:45 AM TR  room 1103
Siebel Center for Comp Sci 
Meseguer, J 
3 hours

35852  lecture- discussion  D4 09:30 AM - 10:45 AM TR  room 1103
Siebel Center for Comp Sci 
Meseguer, J 
4 hours