Lectures related to Data-flow analysis

Dataflow Analysis: Translation Inefficiencies and Optimizations

Explores translation inefficiencies, optimizations, hoisting functions, closure conversion, and dataflow analysis concepts like available expressions and live variables.

Closure Conversion and Dataflow Analysis

Explores closure conversion, function hoisting, and dataflow analysis for program optimization.

Wurzelkriterium: Majorantenkriterium

Covers the Majorantenkriterium and Wurzelkriterium for convergence tests of series.

The transhipment problem, The maximum flow problem

Explores the maximum flow and transhipment problems in network optimization.

Abstract Interpretation Idea

Covers abstract interpretation, fixpoints, control-flow graphs, and program state approximation.

Data Cleaning Challenges: Optimizing Error Detection

Addresses challenges in data cleaning for analysis, proposing optimizations to reduce processing time.

Boolean Types and Control Structures

Explores boolean types, logical operators, and control structures in Python, emphasizing the evaluation of expressions and the use of relational operators.

Dataflow Analysis: Optimization

Explores dataflow analysis for optimization, including equations solving, live variables, reaching definitions, and very busy expressions.

Register Allocation Using Graph Coloring

Covers register allocation using graph coloring to minimize memory access in programs.

Convergence Criteria: Limits Calculation

Covers the convergence criteria for sequences and limits calculation, discussing properties, rules, examples, and boundedness.

WASM Virtual Machine: Group 13

Explores the development of a WebAssembly Virtual Machine by Group 13, covering pipeline stages, interpreter structure, and stack management.

Python Programming Basics

Covers the basics of Python programming, focusing on flow control structures, interactive mode, script mode, and variables.

Code Optimization: Speeding-up Analyses

Explores techniques to speed up dataflow analyses and discusses the importance of node ordering and post-order traversal.

Dynamically Scheduled HLS: Program Analysis and Control Flow

Explores Dynamically Scheduled HLS and imperative language compilation for dataflow machines.

Problem Solving Techniques

Covers various problem-solving techniques and their real-world applications.

Online Algorithms: Competitive Ratio

Covers online algorithms and competitive ratio in caching strategies to optimize memory usage.

Cutting Plane Methods

Explores cutting plane methods, ellipsoid algorithm, and competitive algorithms for optimization.

OLAP Queries and Optimizations

Covers OLAP queries, examples of comparisons, ranking, and optimizations for query performance.

Relaxation-based Retiming

Covers relaxation-based retiming to optimize cycle-time by shortening paths with excessive delays.

Static Analysis for Amy: Techniques and Implementations

Explores static analysis techniques like AST-based analysis and taint analysis applied to the Amy language.