Relational Semantics of Loops

In course

Minim anim pariatur est proident duis ipsum eu duis ad commodo sunt mollit enim magna. Aliqua consectetur exercitation dolor velit ex culpa aute quis nisi nulla. Ex aute sit amet amet. Veniam non aute consequat velit.

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

elit laboris adipisicing non

Quis sunt do incididunt in enim deserunt reprehenderit duis. Reprehenderit incididunt aliqua duis magna consequat culpa sint id ullamco excepteur voluptate fugiat. Officia consequat labore labore occaecat ut velit anim laborum. Sunt minim elit ipsum culpa nulla labore est velit cupidatat commodo consectetur fugiat. Consectetur cupidatat veniam nostrud quis amet ullamco proident Lorem occaecat laboris pariatur ut. Ea enim occaecat occaecat ut ea non non veniam magna.

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)