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.

undecidable. This means that automated reasoning of software generally must involve approximation. It is also well known that testing, i.e. concretely running programs and inspecting the output, may reveal errors but generally cannot show their absence. In contrast, static program analysis can – with the right kind

  Testing, Software, Static