CS Behind the Curtain (CS195 2003S)

Class 03: Program Verification

Back to Binary Search. On to The Structure of a Computer.

Held: Wednesday, 22 January 2003

Summary: Today we begin our consideration of why one might want to formally verify algorithms and programs and the tools one uses to do so.




Verification, Revisited

Boolean Basics

A Simple Boolean Grammar

Adding Precedence and Associativity

Proof and Reasoning



Tuesday, 7 January 2003 [Samuel A. Rebelsky]


Back to Binary Search. On to The Structure of a Computer.

Disclaimer: I usually create these pages on the fly, which means that I rarely proofread them and they may contain bad grammar and incorrect details. It also means that I tend to update them regularly (see the history for more details). Feel free to contact me with any suggestions for changes.

This document was generated by Siteweaver on Fri May 2 14:20:09 2003.
The source to the document was last modified on Mon Jan 20 12:41:00 2003.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS195/2003S/Outlines/outline.03.html.

You may wish to validate this document's HTML ; Valid CSS! ; Check with Bobby

Samuel A. Rebelsky, rebelsky@grinnell.edu