Automated Reasoning: Formal Verification with LISA

Related lectures (27)

Page 2 of 3

Covers propositions indexed by vectors, proof by induction, and Cartesian products of sets.

Covers the properties of injective functions and demonstrates their proofs through examples and visual aids.

Covers logic programming concepts, focusing on automated proof search and unification techniques in Coq.

Introduces Coq, covering defining propositions, proving theorems, and using tactics.

Covers the basics of propositional calculus and its importance in computer science.

Covers the definition of a simple programming language and its big-step semantics, including arithmetic expressions and imperative commands.

Covers the definition of an inductive data type in Coq and how to build proofs interactively using tactics.

Covers the basics of formal logic, focusing on logical expressions and mathematical proofs.

Introduces the basics of proof scripting in Coq, focusing on the Ltac language and its tactics for managing proofs effectively.

Explores historical mathematical proofs, decision problems, deductive systems, probabilistic and quantum proofs, and interactive proof systems.