Static Program Analysis - Aarhus Universitet

← Back to document page

Static Program AnalysisAnders M ller and Michael I. SchwartzbachJanuary 3, 2022Copyright 2008 2021 Anders M ller and Michael I. SchwartzbachDepartment of Computer ScienceAarhus University, DenmarkThis work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives International License. To view a copy of this license, Applications of Static Program Analysis . . . . . . . . . . . . . . Approximative Answers . . . . . . . . . . . . . . . . . . . . . . . Undecidability of Program Correctness . . . . . . . . . . . . . .62 A Tiny Imperative Programming The Syntax of TIP . . . . . . . . . . . . . . . . . . . . . . . . . . . Example Programs . . . . . . . . . . . . . . . . . . . . . . . . . . Normalization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Abstract Syntax Trees.

program being compiled, in order to generate efficient code. A few examples of such properties are: • Does the program contain dead code, or more specifically, is function f unreachable from main? If so, the code size can be reduced. • Is the value of some expression inside a loop the same in every iteration?

  Code, Static