Dynamic program analysis

Formal sciences
Theoretical computer science
Programming language theory
Formal verification

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (28)

Graph Algorithms: DFS, Topological Sort, SCC

Explores DFS, Topological Sort, SCC in graphs, and introduces Flow Networks with practical examples.

Avoiding Variable Capture

Explores variable capture in higher-order functions and the importance of variable renaming.

Software Security: Fuzzing

Explores fuzzing as an automated technique to improve program coverage in security testing.

Optimal Binary Search Tree

Explores optimal binary search trees to minimize expected search cost and discusses graphs representation using adjacency matrices and lists.

Information Theory: Prefix-Free Codes

Covers prefix-free codes, Kraft inequality, Huffman coding, and entropy.

Dynamic Error Analysis

Analyzes dynamic errors in precision mechanisms, focusing on theoretical vs. real movements, sources of error, and harmonic responses.

Static Analysis for Amy: Introduction to AST-based Analysis

Introduces AST-based analysis and its benefits over testing, covering its applications, rule implementations, and limitations.

Dependable Architectures and Software

Explores dependable architectures, error detection, fault-tolerant structures, and software reliability through examples like the Patriot Missile failure and ABB dual controller.

Page 2 of 2