Compilation Methods SS 2013 - Slide 227
Objectives:
Understand call graphs
In the lecture:
- Structural abstraction of call relation,
- Structural properties, e. g. reachability,
- Simplified implementation of non-recursive functions, of functions without calls, of functions that are never called.
- Propagation of information along call paths.
- Description of function behaviour, e. g. no side-effect on global variables.
©2009 Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 15.05.2013