Elements of mathematics and logic for computer program analysis
Abstract
In order to be able to rigorously prove the correctness of a program, one must have a formal definition of: what is a program, syntactically; how it is evaluated, that is, what is its semantics; how to formulate the properties we are interested in; and how to prove them. All this requires to understand some basic mathematical notions like induction, terms, formulas, deduction, etc. These notes are intended to give an introduction to some of these notions.
Fichier principal
main.pdf (364.03 Ko)
Télécharger le fichier
exam.pdf (51.14 Ko)
Télécharger le fichier
examsol.pdf (70.28 Ko)
Télécharger le fichier
iami13poster.pdf (475.08 Ko)
Télécharger le fichier
Format : Other
Loading...