Lecture

Abstract Interpretation and Octagon Domain

Description

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.

Instructor

do mollit ad

Duis sint est ad fugiat ex esse nisi sint in do qui culpa proident do. Cillum consequat Lorem sunt cillum culpa dolore in incididunt laborum do officia. Id consequat reprehenderit occaecat anim cillum eu id non. Cupidatat consectetur exercitation nostrud dolore incididunt.

Official source

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

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: Formal verification

Related lectures (31)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.