Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers program optimizations, abstract interpretation, algebraic transformations, and specialization for higher-order functions. It explains the basic idea of abstract interpretation, programs as control-flow graphs, and reachable states as a set of recursive equations. The instructor discusses interval analyses, bounds check elimination, and initialization analysis using examples.