+-+
| cscB36: Sample Correctness Proofs |
+-+
By: Nick Cheng
Note: ASCII notation to represent mathematical symbols is described here.
http:/www.utsc.utoronto.ca/~nick/ascii.html
Here are some proofs of correctness for iterative and recursive programs.
A
CSC B36
Assignment #2
Summer 2013
Best before: June 13.
1. Do exercise 5 on pages 71-72 of the course notes (about a mod function).
2. (a) Do exercise 7 on page 72 of the course notes (about base 3 multiplication).
Prove both partial correctness and term
CSC B36
Summer 2013
Assignment #1
Best before: May 30.
1. Read and understand chapter 0 of the course notes, then create a glossary of important concepts and
terms from that chapter.
2. Do exercises 3-6 on page 44 of the course notes (about validity of i
+-+
| cscB36: On structures of induction proofs |
+-+
By: Nick Cheng
Note: ASCII notation to represent mathematical symbols is described here.
http:/www.utsc.utoronto.ca/~nick/ascii.html
Introduction
=
Suppose P(n) is a predicate on natural numbers and w
+-+
| cscB36: Sample Proofs |
+-+
By: Nick Cheng
Note: ASCII notation to represent mathematical symbols is described here.
http:/www.utsc.utoronto.ca/~nick/ascii.html
We present examples of induction proofs here in hope that they can be used
as models wh
+-+
| cscB36: Notes on Structural Induction for Regexes |
+-+
By: Nick Cheng
Note: ASCII notation to represent mathematical symbols is described here.
http:/www.utsc.utoronto.ca/~nick/ascii.html
Introduction
=
Recall that the set RE of all regexes over s
+-+
| cscB36: Proving languages NOT regular using Pumping Lemma |
+-+
By: Nick Cheng
Note: ASCII notation to represent mathematical symbols is described here.
http:/www.utsc.utoronto.ca/~nick/ascii.html
Introduction
=
The Pumping Lemma is used for provin
+-+
| cscB36: Notes on Pseudocode used for Program Correctness |
+-+
By: Nick Cheng
Introduction
=
The pseudocode used in the course notes by Vassos Hadzilacos is based on
the programming language Pascal. However, most B36 students today are most
familiar
+-+
| cscB36: Notes on Proofs |
+-+
By: Nick Cheng
Introduction
=
These notes summarize what students should know about writing proofs.
We use ASCII notation to represent mathematical symbols as described here.
http:/www.utsc.utoronto.ca/~nick/ascii.html
+-+
| cscB36: Notes on Induction |
+-+
By: Nick Cheng
Note: ASCII notation to represent mathematical symbols is described here.
http:/www.utsc.utoronto.ca/~nick/ascii.html
Introduction
=
Given a predicate P(n), where n (- N, if we want to prove that P(n)
+-+
| cscB36: Majority Element |
+-+
By: Nick Cheng
Note: ASCII notation to represent mathematical symbols is described here.
http:/www.utsc.utoronto.ca/~nick/ascii.html
Introduction
=
Here's an example of an iterative program for which the loop invarian
+-+
| cscB36: Notes on Proving Correctness of Programs |
+-+
By: Nick Cheng
Note: ASCII notation to represent mathematical symbols is described here.
http:/www.utsc.utoronto.ca/~nick/ascii.html
Introduction
=
These notes summarize the main points on prov
+-+
| cscB36: On proving a set of connectives complete, and not complete |
+-+
By: Nick Cheng
Note: ASCII notation to represent mathematical symbols is described here.
http:/www.utsc.utoronto.ca/~nick/ascii.html
Introduction
=
For this course, you are ex
+-+
| cscB36: How NOT to write proofs |
+-+
By: Nick Cheng
Note: ASCII notation to represent mathematical symbols is described here.
http:/www.utsc.utoronto.ca/~nick/ascii.html
Introduction
=
Certain mistakes are common in proofs, especially ones written