Goto Statements: Sematics and Deduction Systems

摘要

A simple language containing goto statements is presented together with denotational and operational semantics for it. Equivalence of these semantical descriptions is proven. Furthermore, soundness and completeness of a Hoare-like proof system for the language is shown via two steps. First, a proof system is given and validity is defined using a variant of direct semantics. In this case soundness and completeness proofs are relatively easy. After that, a proof system is given which is more in the style of program proving using jumps and functions. Validity in this system is defined through continuation semantics. This validity definition is then related to validity in the first system, and using this correspondence, soundness and completeness for the second system is proven.