Proving Program? 

Forum: U Chicago, Com Sci 221 old messages, autumn 2000
Re: Assignment #4, due 25 October (Mike O'Donnell)
Date: 2000, Oct 24
From: <gsyeung@midway.uchicago.edu>

Should we prove that the program works with the pre/post assertions and the invariant or should we just comment on it. Also, on the assignment you wrote that pictures should be precise, I was wondering if I can informally prove the program with a flow chart? Should we prove the termination case? And do we allow for user error in the input? (i.e. L > U for L= lower bound of array and U= upper bound). OR should we not allow user input on the L and U and just initialize L =0 and U = size of array? Gary Yeung

Messages

1. No proof required; assume input correct by Mike O'Donnell, 2000, Oct 24

to: "Proving Program?"