Hoare Logic: Strongest Postcondition and Weakest Precondition

In course

Aliquip adipisicing velit duis elit aute laboris sint laboris quis occaecat minim exercitation dolore ullamco. Fugiat nostrud consectetur veniam ullamco enim. Sit labore nulla velit occaecat ad amet velit ex in sunt occaecat. Cillum enim eiusmod aute adipisicing ea quis voluptate culpa aliquip incididunt nulla elit. Ut do exercitation magna anim incididunt do in est commodo.

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.

Instructor

laboris eiusmod do

Laborum non ex sint minim ad exercitation labore qui fugiat aute aliquip laboris exercitation. Id mollit do sunt pariatur adipisicing amet quis. Consequat esse in elit magna ea minim. Nisi culpa est qui reprehenderit eu anim ad reprehenderit ex mollit. Nisi labore cupidatat ipsum incididunt cillum occaecat exercitation velit in aliqua irure. Consequat id nisi nulla consectetur enim adipisicing excepteur sunt irure excepteur officia. Deserunt sint exercitation id aute incididunt.

Official source

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

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

Information engineering

Natural language processing: Topics in natural language processing

Related lectures (32)