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.

easily seen for any special case. Assume for example the existence of an analyzer that decides if a variable in a program has a constant value in any execution. In other words, the analyzer is a program Athat takes as input a program T, one of T’s variables x, and some value k, and decides whether or not x’s value is

  Static, Analyzer