Lecture

Abstract Interpretation Idea

Description

This lecture introduces the concept of abstract interpretation as a method to infer properties of program computations. It covers the basic idea, abstract states, fixpoints, control-flow graphs, and sets of states at program points. The lecture also discusses proving through fixpoints of approximate functions, reachable states as recursive equations, and analysis domains. It explains the approximation of sets, transfer functions, and updating sets in the context of program meaning and recursive equations.

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.

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.