CS 476
Fall 2005 All Classes
All Classes
Credit: 3 OR 4 hours.
(C S 376) 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 Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
35855
|
Lecture-Discussion
|
D3
|
9:30AM
-10:45AM
|
TR
|
1103 Siebel Center for Comp Sci
|
Meseguer, J
|
|
|
|
35852
|
Lecture-Discussion
|
D4
|
9:30AM
-10:45AM
|
TR
|
1103 Siebel Center for Comp Sci
|
Meseguer, J
|
|