YoVDO

Graph IRs for Impure Higher-Order Languages: Making Aggressive Optimizations Affordable - OOPSLA 2023

Offered By: ACM SIGPLAN via YouTube

Tags

Compiler Design Courses Symbolic Execution Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a groundbreaking 18-minute video presentation from OOPSLA2 2023 that introduces a novel graph-based intermediate representation (IR) for compiler optimizations in impure higher-order languages. Discover how this innovative approach combines reachability types with an expressive effect system to compute precise effect dependencies, enabling aggressive global optimizations while supporting local reasoning and separate compilation. Learn about the formalization of this new graph IR based on a λ-calculus with a reachability type-and-effect system and its application in various performance case studies, including tensor loop fusion, CUDA kernel fusion, symbolic execution of LLVM IR, and SQL query compilation. Gain insights into the significant speedups of up to 21x observed in the Scala LMS compiler framework using this new graph IR.

Syllabus

[OOPSLA23] Graph IRs for Impure Higher-Order Languages: Making Aggressive Optimizations Af...


Taught by

ACM SIGPLAN

Related Courses

Formal Software Verification
University System of Maryland via edX
Software Analysis & Testing
Georgia Institute of Technology via Udacity
Computer Systems Security
Massachusetts Institute of Technology via MIT OpenCourseWare
Reverse Engineering 3201: Symbolic Analysis
OpenSecurityTraining2 via Independent
angr: Binary Analysis Framework - Demonstration and Analysis
New York University (NYU) via YouTube