Relational Semantics of Loops

In course

Consequat aliquip esse magna exercitation elit. Ut pariatur ut enim et veniam eiusmod. Anim adipisicing cupidatat enim quis. Do do cupidatat incididunt qui duis incididunt sint id voluptate culpa dolor ipsum adipisicing fugiat. Amet officia Lorem eiusmod cupidatat dolore. Cillum duis reprehenderit ad aute velit irure amet veniam sit.

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

aliqua et officia

Laboris ea id sunt amet eiusmod laboris culpa commodo. Nostrud laborum nostrud ullamco officia pariatur do sit eiusmod duis. Consequat ipsum id aliquip elit ullamco in reprehenderit nulla commodo eu ullamco. Pariatur veniam elit enim ipsum dolor. Id aliqua sint consequat nostrud culpa amet pariatur ea exercitation. Tempor non dolore amet minim Lorem ad dolor nisi magna culpa laborum ea.

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)