Provably Safe Programs
Thomas E. Anderson · Newcastle University ePrints (Newcastle Univesity) · 1975
Two approaches are considered for simplifying the proof of a program, namely incorporating redundancy to assist in the proof, and employing a weaker specification than that originally intended. The proof should then ensure the adequacy (rather than the full correctness) of the program. Safeness, a special case of adequacy, is described and exemplified. Consideration is given to extending the concept of a safe program module to enable the inclusion of code for error recovery purposes.
Cited by 6 works. doi:10.25405/ncl.34127583