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.

in programming, what can be more fun than writing programs that analyze programs? As known from Turing and Rice, all nontrivial properties of the behavior of programs written in common programming languages are mathematically undecidable. This means that automated reasoning of software generally must involve approximation.

  Writing, Static