Abstract
An approach to the mechanization of the certification of programs is the development of a canonical form for computer programs. Two programs would be declared equivalent, that is, for all inputs they produce identical outputs, if and only if they have the same canonical form. The nature of such a canonical form for computer programs is discussed. For a certain non-trivial class of programs, a methodology for producing the canonical form from the original program is developed, and the present limitations of this approach are explored. Finally, the methodology is applied to two different sort algorithms, demonstrating that these algorithms are equivalent since they possess the same canonical form.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
