Hoare's Logic with Example: Tower of Hanoi

Virtual University CS636 Formal Methods Lecture 9 delivers an authoritative, academically rigorous exploration of Hoare's Logic with Example: Tower of Hanoi, comprehensively addressing modules 49 to 54 of the official course curriculum. Grounded in the pedagogical standards established by Roland Backhouse in Program Construction, Richard Mitchell in Design by Contract, Jos Warmer in The Object Constraint Language, and J.M. Spivey in The Z Notation, this lecture establishes the theoretical foundations, mathematical formulations, and computational proofs necessary for mastering axiomatic verification of recursive algorithms, inductive hypotheses, and the Tower of Hanoi problem. The lecture demonstrates axiomatic program verification applied to classic recursive algorithms using the Tower of Hanoi. Students construct formal pre- and post-condition contracts for recursive subprograms, formulating rigorous inductive hypotheses. Stepwise verification proofs verify that recursive disk moves maintain disk order invariants and terminate in exactly 2^n - 1 steps. C.A.R. Hoare's axiomatic semantics utilizes Hoare triples to express program behavior as formal contracts between preconditions, code statements, and postconditions. A Hoare triple asserts that if the precondition holds prior to execution and the command terminates, then the postcondition is guaranteed to hold in the final state. Proving loop termination requires establishing a well-founded integer variant function that strictly decreases with each iteration while remaining bounded below. Auxiliary ghost variables capture initial state values without altering runtime memory, facilitating rigorous relational proofs between pre-states and post-states. OCL collection operations including iterate, select, reject, and forAll empower engineers to specify precise mathematical constraints over aggregate object relationships. Model-based specifications construct explicit mathematical state spaces utilizing sets, maps, sequences, and relations to represent system configurations. To ensure total readiness for Virtual University examinations, this chapter provides structured conceptual analysis, formal proof derivations, and high-yield solved practice MCQs directly reflecting past examination trends curated by Moaaz and Waqar Siddhu. Mastering these formal specification paradigms equips students to excel in semester midterms, final examinations, and professional engineering careers across high-assurance software engineering domains.