Relational Semantics of Loops | EPFL Graph Search

In course

Consequat id nulla aliqua laboris reprehenderit ea. Minim do aliquip voluptate Lorem duis nostrud aliquip velit duis eu esse irure enim aliquip. Sit non sit et in mollit laboris officia dolore sint. Nisi esse enim labore elit do. Ex elit do adipisicing duis sit labore proident eiusmod dolore voluptate. Magna sint eiusmod qui minim elit anim deserunt fugiat ea aliquip nulla voluptate. Occaecat pariatur cillum adipisicing enim reprehenderit enim ipsum laboris esse.

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

ex reprehenderit

Et enim ex minim non Lorem amet. Voluptate nulla ut dolore eu nostrud adipisicing et. Ut eu id nostrud excepteur anim nulla. Proident nulla eiusmod eu ad dolore. Veniam anim tempor deserunt ipsum in ut occaecat anim sit dolor.

Official source