Relational Semantics of Loops

In course

Cupidatat anim reprehenderit eiusmod fugiat culpa non elit voluptate cupidatat. Aute commodo veniam exercitation ut sit. Officia magna culpa labore eiusmod enim excepteur dolor proident anim anim nulla nostrud ad.

Description

This lecture covers the relational semantics of loops, including the translation of havoc operations, writing specifications using havoc and assume, program refinement and equivalence, stepwise refinement methodology, monotonicity with respect to refinement, heuristically eliminating quantifiers from formulas, the meaning of loops in programs, and the mathematical semantics of loops.

Instructor

Fugiat eiusmod voluptate commodo occaecat ad et enim duis laboris minim adipisicing excepteur. Aliqua proident tempor fugiat aliquip excepteur occaecat ullamco nulla consequat anim. Dolor anim anim dolore excepteur ex sit qui reprehenderit adipisicing tempor aliquip sint.

Official source

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

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

Logic

Classical logic: First-order logic

Related lectures (34)