Lectures related to Automated Reasoning: Formal Verification with LISA

Explores the Cartesian product in linear algebra and the method of induction for proving propositions.

Covers the basics of proofs, defining sets, and applications between sets.

Covers the LISA proof assistant's codebase organization, kernel package, FOL formalization, and proof package.

Explores Lagrange multipliers, minimax theorems, and convex subsets in optimal transport theory.

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

Introduces logic, proofs, sets, functions, and algorithms in mathematics and computer science.

Covers polymorphism in Coq, focusing on data structures and functions like lists, length, and append.