Course

CS-550: Formal verification

Lectures in this course (58)

Introduces formal verification and its advantages over traditional testing methods, discussing automated theorem proving and compiling correctness statements into verification conditions.

Verifying Programs with Stainless

Explores the verification of programs using Stainless, focusing on functional correctness, proof assistants, and automation of reasoning tasks.

Formal Verification and Program Synthesis

By the instructor Viktor Kuncak explores formal verification, program synthesis, and teaching activities at EPFL.

Verifying Programs with Stainless: Part 2

Focuses on using Stainless for program verification, demonstrating the process of verifying programs and ensuring correctness.

First Steps with Stainless

Introduces Stainless, a verifier for Scala, emphasizing bug prevention and library access.

Auxiliary Assertions in Stainless

Showcases the use of assertions in Stainless to prove properties of fractions.

Verifying Programs with Stainless: How Stainless Works

Explores the inner workings of the Stainless framework, emphasizing verification-aware transformations and dependent type checking.

Unfolding recursive functions in Stainless

Covers the concept of unfolding recursive functions using the Stainless tool.

Verifying Programs with Stainless: An Extended Example

Explores program verification using Stainless with a focus on the Quite OK Image Format (QOI) and its Scala implementation.

Disasters, Successes, and Inductive Invariants

Explores software disasters, successful verifications, transition systems, and invariants in systems.

Stainless Tutorial

Presents a tutorial on how to install and use Stainless, a tool for verification of Scala programs.

Stainless Tutorial: Demo.scala Basics

Covers the basics of writing and verifying Scala code using the Demo.scala file.

Stainless Tutorial: Verification of Scala Code

Covers the use of Stainless, a verification tool for Scala, to ensure the correctness of Scala code.

Binary Search Trees Operations

Explains binary search tree operations, focusing on insertion, search, and list conversion, with an emphasis on formal verification and debugging.

Invariants in Bounded Counter: Understanding Inductive Invariants

Explores invariants in a bounded counter system and the significance of inductive invariants in verifying system properties.

Dispenser Example of Finite System

Explores a snack dispenser system with multiple levels and slots, analyzing its transition system and stable coin storage capacity.

Finite Systems Expressed with Formulas

Explores encoding finite systems with boolean functions, propositional logic, inductive invariants, and formal proof systems.

Finite Systems Expressed with Formulas

Explores finite transition systems, propositional logic, truth interpretation, satisfiability, and boolean function representation with circuits.

Idea of Symbolic Computation of Reachable States

Explores symbolic computation of reachable states in transition systems using fixed points and algorithms.

What is a Formal Proof?

Covers the concept of formal proof systems, their structure, and soundness.