Hoare Logic: Strongest Postcondition and Weakest Precondition

Related lectures (32)

Page 1 of 4

Covers Hoare Logic, its foundations, applications, and significance in program verification.

Covers Hoare logic, postconditions, preconditions, and program behavior proofs.

Explores converting imperative programs to formulas, including verification conditions, formula construction, and control flow structures.

Introduces Hoare logic for simplifying program behavior proofs through annotations.

Covers the concept of outer measure and properties of measurable sets.

Covers modeling control statements with functions in Scala, including while loops, repeat loops, and for-loops translation.

Covers the basics of Coq, focusing on arithmetic expressions, evaluation, and proof techniques.

Discusses translating program lines into French and using sensors to trigger actions.

Covers programming Thymio to move, stop, play music, and change colors.