CS 476
Fall 2014 Part of Term 1
Part of Term 1
Aug 25-Dec 10
Aug 25-Dec 10
Credit: 3 OR 4 hours.
Formal methods for demonstrating correctness and other properties of programs. Invariant assertions; Hoare axiomatics; well-founded orderings for proving termination; structural induction; computational induction; data structures; parallel programs; overview of predicate calculus.
3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 225; CS 373 or MATH 414.
Section Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
35855
|
Lecture-Discussion
|
D3
|
9:30AM
-10:45AM
|
TR
|
Siebel Center for Comp Sci
|
Meseguer, J
|
|
|
|
35852
|
Lecture-Discussion
|
D4
|
9:30AM
-10:45AM
|
TR
|
Siebel Center for Comp Sci
|
Meseguer, J
|
|