Lab for Automated Reasoning and Analysis LARA

Lecture 01: Introduction to Verification and Background


Propositional Logic Informally - Propositional Logic is the core logical reasoning

Predicate Logic Informally - We build on propositional logic to explain first-order predicate logic.

Proofs and Induction - We make sure that we are all familiar with basic proof techniques, which we will study as formal rule systems later.

Theorem Prover - Theorem provers can check proofs, automate the proof search or use other methods to show formula validity.

Computational Complexity - Limits of algorithms for theorem provers and decision procedures, and vocabulary for expressing problem difficulty.

Compiler - Compilers help us understand how to deploy verification systems (see also our Compiler Construction course)

Sets and Relations - Some more background, useful preparation for program semantics.


sav10/lecture_01.txt · Last modified: 2011/02/15 20:34 by vkuncak