Abstract
In Chapters 5 and 6 it has been seen how the Fixpoint Theorem can be used to prove program correctness (Examples 5.13 and 6.12). This proof method based directly on the definition of denotational semantics is powerful but too cumbersome for practical purposes. Other properties of denotational semantics, for example the Fixpoint Induction Principle or Park’s Theorem, can also be used for verification of programs and often lead to more wieldy proofs. It is the aim of Section 9.1 to illustrate the use of such properties by some examples. In Section 9.2 the method of subgoal induction will be introduced. It is arrived at from denotational semantics in much the same way as the inductive assertions method was derived from the operational semantics in Chapter 7. In the last section another verification method, called the structural induction method, will be presented.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
