Lecture

Hoare Logic: Postconditions and Preconditions

In course

Elit cillum cupidatat esse ipsum et enim id. Irure dolore aliquip eu non qui commodo qui sint in. Cupidatat magna id excepteur voluptate elit do aliqua.

Description

This lecture introduces Hoare logic, a proof system for imperative program behavior. It covers concepts such as strongest postcondition and weakest precondition, illustrating how conditions on sets affect their size and the relationships between postconditions. The instructor explains the Hoare triple, defining postconditions and preconditions, and demonstrates how to prove program behavior using annotations.

Instructor

amet irure magna

Excepteur culpa voluptate sint sit proident aliquip aute ullamco. Ex ullamco aliquip laboris adipisicing nulla voluptate id Lorem et magna sit magna ut voluptate. Ut sint est incididunt cillum deserunt anim eu.

Official source

https://mediaspace.epfl.ch/media/0_8ebxh5n4

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.

Ontological neighbourhood

Theoretical computer science

Programming language theory: High-level programming languages

Related lectures (30)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.