Lectures related to Dynamic program analysis

Finite Element Analysis: Advanced Mechanisms in Engineering

Provides an overview of advanced mechanisms analysis using Finite Element Method and Finite Element Analysis in engineering applications.

Static Analysis for Amy: Techniques and Implementations

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

Program Optimizations and Abstract Interpretation Idea

Covers program optimizations, abstract interpretation, algebraic transformations, and interval analyses.

Introduction to MATLAB

Covers the basics of MATLAB and includes an exercise session on metabolic modeling.

Digital Humanities and Game Studies

Explores the intersection between digital humanities and game studies, showcasing various research projects and highlighting the interdisciplinary nature of research in these fields.

Sparsest Subgraph: Densest Subgraph

Covers Sparsest Subgraph and Densest Subgraph, focusing on correlation clustering and approximation algorithms.

Abstract Interpretation and Octagon Domain

Explores abstract interpretation principles and the Octagon domain, emphasizing precision-efficiency trade-offs and static program analysis.

Advanced Metaprogramming Queries: Code Volume & Complexity

Explores challenges in code volume, complexity, and metaprogramming queries over code.

Software security - Security testing

Covers software security testing approaches and coverage metrics.

Software Correctness: Testing and Verification

Explores software correctness through testing, verification, property-based fuzzing, and dynamic information flow control.

Dynamically Scheduled HLS: Program Analysis and Control Flow

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

Error Management in LabVIEW

Emphasizes error management in LabVIEW, source file analysis, and program execution with Xcode.

Automated Testing: Fuzzing and Sanitization

Explores fuzzing, bug oracles, code reviews, and automated testing techniques, emphasizing the importance of sanitization in detecting faults.

Property-Based Testing: QuickChick

Explores property-based testing using QuickChick, focusing on software correctness, specifications, and dynamic information flow control.

GPU-accelerated OLTP: Memory Efficiency and Query Throughput

Explores GPU-accelerated OLTP engines, emphasizing memory efficiency and query throughput in data-intensive applications.

Advanced Metaprogramming Queries: Code Volume & Complexity

Explores managing large codebases, higher abstraction levels, CodeDB, Datalog queries, and program analysis.

Optimal Binary Search Trees

Explains Optimal Binary Search Trees using dynamic programming and covers a midterm exam from 2016.

Bellman Ford: Shortest Paths

Introduces the Bellman-Ford algorithm for finding shortest paths in directed graphs with edge weights.

Algorithms: Final Exam Review

Provides a detailed review of the 2016 final exam, covering various algorithmic problems.

Linear Programming Techniques in Reinforcement Learning

Covers the linear programming approach to reinforcement learning, focusing on its applications and advantages in solving Markov decision processes.