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

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

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. 2014/2015
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

4S000557

Credits

6

Language

Italian

Scientific Disciplinary Sector (SSD)

INF/01 - INFORMATICS

Period

II semestre dal Mar 3, 2014 al Jun 13, 2014.

Location

VERONA

Learning outcomes

The course aims to deepen advanced subjects concerning compilers and static analysis. In particular the objective is that of providing advanced techniques for transforming programs with the aim, not only of obtaining standard optimization of code, but also of protecting code by hiding information or discovering vulnerabilities.

Program

- Introduction
- Mathematical foundations
- Lattice theory
- Abstract interpretation
- Control Flow Graphs (CFG)
- Basic compiler and optimization
- Algorithmic approaches to optimization
- CFG based approaches
- Dominance
- Avoiding redundance
- Available expressions
- Solving data-flow problems
- Monotonic analyses framework
- Formal framework
- Fix-point computations
- MOP and least solution
- Example
- Data-flow analysis
- Very busy expression
- Liveness analysis and optimization
- Copy propagation analysis and optimization
- Constant folding and reaching definition analyses
- Interval analysis
- Alias analysis
- Optimization
- Single static assignment (SSA)
- Constant propagation (with SSA)
- Code motion
- Partial redundancy elimination
- Probabilistic static analysis

Examination Methods

Progetto (approfondimento su uno degli argomenti del corso) + Presentazione

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