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 the principles of abstract interpretation and the Octagon domain, focusing on the representation of constraints and the trade-off between precision and efficiency. It explains the use of Galois connections, concretization, abstraction functions, and operations on DBMs. The lecture also delves into the static analysis of programs using the Octagon abstract domain, discussing assignments, branching, loops, and the benefits of sound approximations for detecting runtime issues.