Induction in Proofs about Programs
Name
MIT-LCS-TR-093.pdf
Size
1.75 MB
Format
Adobe PDF
Checksum (MD5)
990db51146f63e3401c9509d55f181b1
Author(s)
Greif, Irene Gloria
Date Issued
February 1972
Series/Report no.
MIT-LCS-TR-093
MAC-TR-093
Abstract
Four methods for proving equivalence of programs by induction are described and compared. They are recursion induction, structural induction, mu-rule induction, and truncation induction. McCarthy's formalism for conditional expressions as function definitions is used and reinterpreted in view of Park's work on results on results in lattice theory as related to proofs about programs. The possible application of this work to automatic program verification is commented upon.
Persistent DSpace Link
