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. 2014/2015
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
Tre insegnamenti a scelta tra i seguenti
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.
Advanced Compilers (2013/2014)
Teaching code
4S000557
Academic staff
Coordinator
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