This lecture, presented by the instructor Viktor Kuncak, focuses on formal verification and program synthesis, covering topics such as automated deduction, theorem proving, and declarative methods to simplify programming. The instructor, an associate professor at EPFL, shares insights from his research group's work in automatically proving program correctness and making programming tasks easier through synthesis. Additionally, he discusses his teaching activities at EPFL, including courses on functional programming, parallelism, concurrency, and formal verification.