Transcription of Static Program Analysis - Aarhus Universitet
{{id}} {{{paragraph}}}
Static Program AnalysisAnders M ller and Michael I. SchwartzbachJanuary 3, 2022 Copyright 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 .. Control Flow Graphs ..163 Type Types .. Type Constraints .. Solving Constraints with Unification .. Record Types .. Limitations of the Type Analysis ..334 Lattice Motivating Example: Sign Analysis .. Lattices .. Constructing Lattices .. Equations, Monotonicity, and Fixed Points.
We focus on analyses that are fully automatic (i.e., not involving program-mer guidance, for example in the form of loop invariants or type annotations) and conservative (sound but incomplete), and we only consider Turing com-plete languages (like most programming languages used in ordinary software development).
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}