Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

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.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Official source

Related concepts (32)

Static program analysis

In computer science, static program analysis (or static analysis) is the analysis of computer programs performed without executing them, in contrast with dynamic program analysis, which is performed on programs during their execution. The term is usually applied to analysis performed by an automated tool, with human analysis typically being called "program understanding", program comprehension, or code review. In the last of these, software inspection and software walkthroughs are also used.

Program analysis

In computer science, program analysis is the process of automatically analyzing the behavior of computer programs regarding a property such as correctness, robustness, safety and liveness. Program analysis focuses on two major areas: program optimization and program correctness. The first focuses on improving the program’s performance while reducing the resource usage while the latter focuses on ensuring that the program does what it is supposed to do.

Abstract interpretation

In computer science, abstract interpretation is a theory of sound approximation of the semantics of computer programs, based on monotonic functions over ordered sets, especially lattices. It can be viewed as a partial execution of a computer program which gains information about its semantics (e.g., control-flow, data-flow) without performing all the calculations.

Concrete

Concrete is a composite material composed of aggregate bonded together with a fluid cement that cures over time. Concrete is the second-most-used substance in the world after water, and is the most widely used building material. Its usage worldwide, ton for ton, is twice that of steel, wood, plastics, and aluminium combined. When aggregate is mixed with dry Portland cement and water, the mixture forms a fluid slurry that is easily poured and molded into shape.

Reinforced concrete

Reinforced concrete, also called ferroconcrete, is a composite material in which concrete's relatively low tensile strength and ductility are compensated for by the inclusion of reinforcement having higher tensile strength or ductility. The reinforcement is usually, though not necessarily, steel bars (rebar) and is usually embedded passively in the concrete before the concrete sets. However, post-tensioning is also employed as a technique to reinforce the concrete. In terms of volume used annually, it is one of the most common engineering materials.

Related lectures (33)

Abstract Interpretation in Stainless

Explores abstract interpretation in Stainless, demonstrating its application in program verification and discussing future directions for the project.

Concrete Durability: Carbonation and Chlorides

Explores concrete carbonation, reinforcement corrosion, prevention, and repair strategies, focusing on chlorides and freeze-thaw cycles.

Adjuvants and New Concretes

Explores the use of adjuvants in concrete and the development of new concrete technologies.

Concrete Durability: Corrosion and Repair

Discusses concrete corrosion, freeze-thaw impact, alkali reaction, and acid attacks.

Concrete Bridges: Design and Analysis