Methods in program construction
- UE code IHDCB232
-
Schedule
30 30Quarter 1
- ECTS Credits 10
-
Language
Français
- Teacher Vanhoof Wim
By the end of the course the students will be able to reason formally about the correctness of a small program et will be able to compute its complexity. They will master the principles of Hoare logic as a proof technique; and they will have an understanding of some basic algorithmic techniques.
The objective of this course is to introduce students to formal reasoning about programs (in terms of correction and complexity) and to teach a rigorous method of program construction for programming in the small.
This course introduces the students to formal reasoning about programs. We study the principal concepts behind program specifications. We learn techniques that allow to prove that a program is correct with respect to a specification. Building on these techniques we derive a methodology for constructing (small) programs that are automatically correct. We also introduce the basic notions behind computing the complexity (time and memory) of a program et we study some search and sort algorithms.
Training | Study programme | Block | Credits | Mandatory |
---|---|---|---|---|
Bachelier en sciences informatiques (horaire décalé) | Standard | 0 | 10 | |
Bachelier en sciences informatiques (horaire décalé) | Standard | 2 | 10 |