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.

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
6
B
ING-INF/05
6
B
ING-INF/05
12
B
ING-INF/05

2° Year   activated in the A.Y. 2013/2014

ModulesCreditsTAFSSD
6
B
INF/01
Altre attivita' formative
4
F
-
ModulesCreditsTAFSSD
12
B
ING-INF/05
6
B
ING-INF/05
6
B
ING-INF/05
12
B
ING-INF/05
activated in the A.Y. 2013/2014
ModulesCreditsTAFSSD
6
B
INF/01
Altre attivita' formative
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

4S000023

Credits

6

Language

Italian

Scientific Disciplinary Sector (SSD)

ING-INF/05 - INFORMATION PROCESSING SYSTEMS

Period

II semestre dal Mar 4, 2013 al Jun 14, 2013.

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 in expressing the behavior of programs in logical formulae, and in designing automated reasoners capable to handle them 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: congruence closure, lists, arrays, combination of procedures by equality sharing.

Reference texts
Author Title Publishing house Year ISBN Notes
Daniel Kroening, Ofer Strichman Decision Procedures. An algorithmic point of view Springer 2008 978-3-540-74104-6
Aaron R. Bradley, Zohar Manna The Calculus of Computation - Decision Procedures with Applications to Verification (Edizione 1) Springer 2007 9783540741

Examination Methods

The grade is given by 30% C1 + 35% C2 + 35% P, where C1 is the midterm exam, C2 is the final exam, and P is an individual project. This applies to the exam session at the end of the course.
In the following sessions, the exam consists of a written test (E), whose difficulty is such to be equivalent to that of the union of C1, C2 and P, and whose grade determines alone the final grade. All grades will be registered: students may withdraw by informing the instructor. Cheating is forbidden and will determine loss of points for all students involved.

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