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.

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? If so, the expression can be moved outside the loop to avoid redundant computations. • Does the value of variable x depend on the program input? If not, it could be precomputed at compile time.

  Main, Static