An Algorithmic and Social Introduction to Computer Science (CSC-105 2000S)


Class 30: Proving Programs Correct

Back to Some Reliability Considerations. On to The Costs of Reliability.

Held Tuesday, March 14, 2000

Overview

Today, we consider one way that we might make programs more reliable: by proving them correct.

Question 30 for today's class: What do we mean when we say a program is "correct"?

Question 31 for Wednesday's class: How do we balance the need for formal specifications required by program proof techniques and the complexity of modern graphical applications?

Notes

Contents

Summary


When is a program correct?

Proving Programs Correct

Applicability of Program Verification


History

Saturday, 22 January 2000

Tuesday, 14 February 2000

Back to Some Reliability Considerations. On to The Costs of Reliability.


Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.

This page may be found at http://www.math.grin.edu/~rebelsky/Courses/CS105/2000S/Outlines/outline.30.html

Source text last modified Tue Mar 14 09:20:43 2000.

This page generated on Tue Mar 14 09:25:30 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu