Program analysis is concerned with techniques that automatically
determine run-time properties of given programs prior to run-time.
It is used for validation in order to ensure that programs serve
their intended purpose and in further processing for efficient
execution such as in optimizing compilers. Optimal program analysis
provides a guarantee about the precision of the computed
results.
This monograph, a revised version of the author's habilitation
thesis, focusses on optimal flow analysis of sequential and
parallel programs. It studies algorithmic properties of various
versions of the well-known constant-propagation problem. In order
to come to grips with the variants considered, it combines
techniques from different areas such as linear algebra, computable
ring theory, abstract interpretation, program verification,
complexity theory, etc. Combination of techniques is the key to
further progress in automatic analysis and constant-propagation
allows us to illustrate this point in a theoretical study.
After a general overview, the monograph consists of three
essentially self-contained parts that can be read independently of
each other. These parts study: a hierarchy of constants in
sequential programs, inherent limits of flow analysis of parallel
programs, and how to overcome these limits by abandoning a classic
atomic execution assumption.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!