Lectures related to Runtime verification

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

Explores the challenges and benefits of compiler verification, emphasizing the importance of verifying compilers for critical software.

Covers the second-order verification of floating systems and the displacement method for piles under various loading conditions.

Provides an overview of lambda calculus, type safety, and type inference in programming languages.

Discusses graph algorithms, focusing on flow networks and strongly connected components.