Lecture

Hoare Logic: Strongest Postcondition and Weakest Precondition

Description

This lecture covers Hoare logic, which allows inserting annotations into code to simplify proofs about program behavior. Topics include computing relations, havoc, non-deterministic choice, assume command, and translating programs into relations.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.