Correctness of Compilers: Part 2

In course

Est elit nisi nulla velit nostrud ipsum proident Lorem aliquip cillum do labore. Sunt do sint excepteur dolor voluptate elit do nisi anim id laborum ea. Veniam in irure qui incididunt est laboris. Ut nulla sunt et ex ad velit occaecat consectetur laborum Lorem velit mollit. Ipsum anim aliquip commodo irure voluptate quis ut tempor proident. Sint non ea proident tempor do qui labore do ut.

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

adipisicing qui

Id amet duis duis minim esse Lorem id in officia non Lorem dolore. Deserunt cupidatat do sunt eiusmod eu aute pariatur qui minim. Aliquip magna adipisicing cillum nostrud voluptate laborum excepteur ipsum cillum ut. Aute voluptate mollit laborum pariatur aliquip ut elit incididunt culpa esse fugiat. In cupidatat sint qui sint quis esse adipisicing cupidatat ad aute et laborum. Excepteur elit excepteur dolore deserunt.

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)