CS 476

fall 2006

All Classes

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.

Status Icon Legend

: Section Status Closed
: Section Status Open
: Section Status Pending
: Section Status Open (Restricted)
: Section Status Unknown

Section Status updates every 10 minutes.

- CS 100
- CS 101
- CS 105
- CS 125
- CS 173
- CS 196
- CS 199
- CS 210
- CS 225
- CS 231
- CS 232
- CS 241
- CS 242
- CS 257
- CS 273
- CS 296
- CS 397
- CS 411
- CS 412
- CS 418
- CS 419
- CS 421
- CS 422
- CS 423
- CS 425
- CS 426
- CS 427
- CS 431
- CS 433
- CS 435
- CS 438
- CS 440
- CS 443
- CS 446
- CS 450
- CS 465
- CS 473
- CS 475
- CS 476
- CS 492
- CS 498
- CS 499
- CS 505
- CS 511
- CS 527
- CS 541
- CS 543
- CS 545
- CS 549
- CS 571
- CS 577
- CS 578
- CS 591
- CS 597
- CS 598
- CS 599

Detail	Status		CRN	Type	Section	Time	Day	Location	Instructor