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.

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/2026

The 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.

CURRICULUM TIPO:

1° Year 

ModulesCreditsTAFSSD
12
B
ING-INF/05
12
B
ING-INF/05
6
B
ING-INF/05
6
B
ING-INF/05

2° Year   activated in the A.Y. 2015/2016

ModulesCreditsTAFSSD
6
B
INF/01
Altre attivita' formative (taf f)
4
F
-
ModulesCreditsTAFSSD
12
B
ING-INF/05
12
B
ING-INF/05
6
B
ING-INF/05
6
B
ING-INF/05
activated in the A.Y. 2015/2016
ModulesCreditsTAFSSD
6
B
INF/01
Altre attivita' formative (taf f)
4
F
-
Modules Credits TAF SSD
Between the years: 1°- 2°

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.




S Placements in companies, public or private institutions and professional associations

Teaching code

4S003252

Credits

6

Language

Italian

Scientific Disciplinary Sector (SSD)

INF/01 - INFORMATICS

Period

II sem. dal Mar 2, 2015 al Jun 12, 2015.

Learning outcomes

The class presents problems and methods for system analysis and verification,
by automated reasoning techniques, such as theorem proving applied to deductive verification or model checking.
The students learn to solve the problems arising when expressing the behavior of systems in logical formulae, and to design automated reasoners capable to handle such formulae efficiently.

Program

Proof procedures in propositional and first-order logic. First-order theories.
Hoare logic, annotations, partial and total correctness, states, paths, invariants. Verification conditions for partial and total correctness: generation and proof of validity.
Decision procedures for equality, data structures, fragments of arithmetic, and their combination.

Examination Methods

The grade is given by 30% C1 + 30% C2 + 40% P, where C1 is the midterm exam, C2 is the final exam and P is a project. The grade thus generated is registered at the first exam session in June.
For all other sessions, the grade is given by 100% E, where E is a written test, hard enough to match the difficulty of C1 + C2 + P.
Registration: all grades will be registered.
Withdrawal: Students may withdraw by informing the instructor.
Cheating: All tests and projects are individual work. Cheating is strictly forbidden and will determine lowering of grades.

Students with disabilities or specific learning disorders (SLD), who intend to request the adaptation of the exam, must follow the instructions given HERE