Prove Algorithm Correctness Using Formal Methods

8 weeks · 0 milestones

Write formal correctness proofs for 5 of your algorithm implementations using loop invariants, structural induction, or reduction to a known problem. Each proof must include: the invariant or inductive hypothesis, the proof that it holds at initialisation, the proof that it is maintained through each iteration or recursive step, and the proof that it implies the postcondition. Proof: the written proofs reviewed by a CS lecturer or engineer with formal methods background who asks you to prove correctness for a sixth algorithm you haven't prepared — you must apply your chosen proof technique to the new algorithm during the review session.

Sign in to start this outcome and track your progress publicly.