Studying at the University of Verona
Here you can find information on the organisational aspects of the Programme, lecture timetables, learning activities and useful contact details for your time at the University, from enrolment to graduation.
Study Plan
This information is intended exclusively for students already enrolled in this course.If you are a new student interested in enrolling, you can find information about the course of study on the course page:
Laurea magistrale in Ingegneria e scienze informatiche - Enrollment from 2025/2026The Study Plan includes all modules, teaching and learning activities that each student will need to undertake during their time at the University.
Please select your Study Plan based on your enrollment year.
1° Year
| Modules | Credits | TAF | SSD |
|---|
2° Year activated in the A.Y. 2011/2012
| Modules | Credits | TAF | SSD |
|---|
Tre insegnamenti a scelta tra i seguenti | Modules | Credits | TAF | SSD |
|---|
| Modules | Credits | TAF | SSD |
|---|
Tre insegnamenti a scelta tra i seguenti | Modules | Credits | TAF | SSD |
|---|
Legend | Type of training activity (TTA)
TAF (Type of Educational Activity) All courses and activities are classified into different types of educational activities, indicated by a letter.
Automated program verification (2010/2011)
Teaching code
4S000023
Teacher
Coordinator
Credits
6
Language
Italian
Scientific Disciplinary Sector (SSD)
ING-INF/05 - INFORMATION PROCESSING SYSTEMS
Period
II semestre dal Mar 1, 2011 al Jun 15, 2011.
Learning outcomes
The class presents problems and methods for program analysis and verification, by automated reasoning techniques such as theorem proving or model checking. Objective of the class is that the student understands the problems arising on one hand
in expressing the behavior of programs in logical formulae, and on the other hand in designing automated reasoners capable to handle such formulae efficiently.
Program
Theorem proving in propositional logic: the Davis-Putnam-Logemann-Loveland procedure. Theorem proving in first-order logic: resolution and superposition. First-order theories. Hoare logic, annotations, partial and total correctness, states, paths, invariants. Invariant generation. Decision procedures for satisfiability modulo theories: equality, data structures, combination of theories by equality sharing, decision procedures based on resolution and superposition.
Examination Methods
For master students:
the exam consists of a written exam (C) and an individual project (P). The grade is given by 50% C + 50% P. This applies to the final exam at the end of the course.
In the following sessions, the exam consists of a written exam (E), whose difficulty is such to be equivalent to that of C+P, and whose grade determines alone the final grade.
Cheating is forbidden and will determine loss of points. Students may withdraw only by not handing-in the exam.
For PhD students:
oral exam consisting in the presentation of one or more papers from the literature.
