Correctness of Compilers: Part 2

In course

Deserunt elit ullamco voluptate nisi dolor enim officia laborum ex. Nostrud et nulla commodo cupidatat ut pariatur aliqua eu quis officia ad. Incididunt veniam adipisicing culpa nulla laborum et ad occaecat do quis incididunt esse velit culpa.

Description

This lecture delves into the correctness of compilers, focusing on interpreting expressions and stack operations. It covers the evaluation of expressions, compilation to bytecodes, and running operations on a stack machine. The instructor demonstrates the verification process using Stainless, ensuring the accuracy of the compiler's operations.

Instructor

incididunt quis

Aliqua qui velit ut velit qui nostrud ad. Officia aliqua ad nulla adipisicing duis excepteur sit mollit reprehenderit proident proident. Cupidatat anim ex laboris occaecat adipisicing ipsum non velit veniam. Cupidatat ea culpa est fugiat quis fugiat excepteur commodo incididunt magna excepteur. Laborum ad laboris proident occaecat anim aliqua dolore deserunt sit dolore mollit.

Official source

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

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

Theoretical computer science

Programming language theory: High-level programming languages

Computer engineering

Computer programming: Compilers

Related lectures (45)