Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
fv19:top [2019/06/25 11:29] vkuncak |
fv19:top [2019/08/13 17:43] vkuncak [Formal Verification EPFL Course (CS-550), Fall 2019] |
||
|---|---|---|---|
| Line 6: | Line 6: | ||
| Instructors: [[http://lara.epfl.ch/~kuncak/|Viktor Kuncak]] and [[https://people.epfl.ch/jad.hamza?lang=en|Jad Hamza]] | Instructors: [[http://lara.epfl.ch/~kuncak/|Viktor Kuncak]] and [[https://people.epfl.ch/jad.hamza?lang=en|Jad Hamza]] | ||
| + | |||
| + | One of the verification tools used: [[http://stainless.epfl.ch/|Stainless]] | ||
| + | |||
| + | [[http://concrete-semantics.org|Concrete semantics]] | ||
| ===== Introduction ===== | ===== Introduction ===== | ||
| Line 40: | Line 44: | ||
| * Importance of Reliable Systems. Methodology of Formal Verification. Soundness and Completeness in Modeling and Tools. Successful Tools and Flagship Case Studies | * Importance of Reliable Systems. Methodology of Formal Verification. Soundness and Completeness in Modeling and Tools. Successful Tools and Flagship Case Studies | ||
| - | * Review of [[sav17:ta1.pdf|Sets, Relations, Computability, Propositional and First-Order Logic Syntax, Semantics]], Sequent Calculus. | + | * Review of Sets, Relations, Computability, Propositional and First-Order Logic Syntax, Semantics, Sequent Calculus. |
| * Completeness and Semi-Decidability for First-Order Logic. Inductive Definitions and Proof Trees. Higher-Order Logic and LCF Approach. | * Completeness and Semi-Decidability for First-Order Logic. Inductive Definitions and Proof Trees. Higher-Order Logic and LCF Approach. | ||
| * State Machines. Transition Formulas. Traces. Strongest Postconditions and Weakest Preconditions. | * State Machines. Transition Formulas. Traces. Strongest Postconditions and Weakest Preconditions. | ||