CS-550: Formal verification

Lectures in this course (58)

Explores formal proofs, satisfiability problems, and inductive invariants using SAT queries in sequential circuits.

Explores completeness in propositional logic, resolution on clauses, conjunctive form, unit resolution, SAT solvers, and proof generation.

Explores the importance of soundness and completeness in a propositional proof system.

Covers the case analysis rule, propositional resolution, soundness, completeness, and resolution on clauses, with practical exercises included.

Covers the transformation of formulas into conjunctive normal form and the efficiency of algorithms for checking satisfiability.

Offers a tutorial on Coq, covering inductive definitions, recursive functions, propositions, theorems, and tactics.

Covers transition systems, behavior equivalence, and system refinement for system modeling and verification.

Covers Presburger arithmetic, quantifier elimination, and the transformation of formulas into disjunctive normal form.

Introduces formal verification methodology and Presburger arithmetic for program verification and automated reasoning.

Covers quantifier elimination in Presburger Arithmetic, exposing variables, ensuring coefficients, and handling bounds.

Explores quantifier elimination steps for Presburger Arithmetic, emphasizing techniques to simplify and eliminate quantifiers efficiently.

Covers first-order logic syntax, semantics, Skolemization, resolution, and normal form transformations.

Covers first-order logic syntax, semantics, and resolution for proving properties.

Covers first-order logic, resolution proofs, Skolem functions, and satisfiability checking in mathematics and program verification.

Explores term models, substructures, small model theorems, and the Herbrand model in first-order logic.

Explores converting imperative programs to formulas, including verification conditions, formula construction, and control flow structures.

Explores converting imperative programs to formulas for verification, covering assignments, if-else statements, and command semicolons.

Introduces Hoare logic for simplifying program behavior proofs through annotations.

Covers Hoare logic, strongest postcondition, and weakest precondition for simplifying proofs in imperative programming.

Covers Hoare logic, postconditions, preconditions, and program behavior proofs.

Page 2 of 3