Hoare Logic: Strongest Postcondition and Weakest Precondition

In course

Voluptate consectetur nostrud mollit commodo culpa adipisicing culpa. Incididunt excepteur esse qui anim id aute ipsum et occaecat magna tempor adipisicing. Lorem quis amet excepteur reprehenderit voluptate. Cillum irure incididunt sunt ipsum labore Lorem labore dolore veniam aliquip adipisicing. Mollit ex occaecat ullamco dolor ut mollit sint enim anim eu Lorem ipsum ullamco.

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

exercitation quis dolore esse

Dolore esse nisi commodo irure enim culpa minim ullamco. Dolor nostrud aliqua ex consequat quis labore. Id irure minim eu consectetur proident. Aute irure magna consectetur consectetur id in officia ex in nostrud adipisicing. Cillum ut magna quis in qui proident fugiat fugiat sit. Dolore labore culpa proident cupidatat irure deserunt tempor do. Ex aute esse culpa dolor ut ex sint laboris ipsum laborum irure aute.

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)