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. 2010/2011
| 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.
Verifica (2009/2010)
Teaching code
4S02800
Teacher
Coordinator
Credits
6
Language
English
Scientific Disciplinary Sector (SSD)
ING-INF/05 - INFORMATION PROCESSING SYSTEMS
Period
2nd Semester dal Mar 1, 2010 al Jun 15, 2010.
Learning outcomes
The class presents problems and methods for program analysis and verification, by 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
First-order theories. Induction. Hoare logic, annotations, partial and total correctness, states, paths, invariants. Invariant generation. Choice of automated reasoning techniques: decision procedures for satisfiability modulo theories (equality, data structures, combination of theories,
decision procedures based on resolution and superposition);
model checking (symbolic model checking, predicate abstraction, counter-example guided refinement).
| Author | Title | Publishing house | Year | ISBN | Notes |
|---|---|---|---|---|---|
| Aaron R. Bradley, Zohar Manna | The Calculus of Computation - Decision Procedures with Applications to Verification (Edizione 1) | Springer | 2007 | 9783540741 | Testo adottato |
Examination Methods
For Master students:
Partial tests mode: it applies only to the exam session right at the end of the class. The exam consists of a written test (C) and an individual project (P) to be developed either at home or in the lab during the term. The final grade is given by 50% C + 50% P.
Single-test mode: the exam consists of a single written test E, whose difficulty is equivalent to that of C+P, and whose grade determines alone the final grade. This mode applies to all sessions.
For doctoral students:
oral exam consisting of the presentation of one or more related articles from the literature.
