Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture introduces Hoare logic, focusing on the concepts of strongest postcondition and weakest precondition. It covers the definitions of Hoare triple, strongest postcondition, and weakest precondition, along with examples and proofs. The instructor explains how to use Hoare logic to simplify proofs about imperative program behavior.