Advertisement

Variations on Constants

Flow Analysis of Sequential and Parallel Programs

  • Markus Müller-Olm

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3800)

Table of contents

  1. Front Matter
  2. Markus Müller-Olm
    Pages 1-11
  3. Markus Müller-Olm
    Pages 13-29
  4. Markus Müller-Olm
    Pages 53-79
  5. Markus Müller-Olm
    Pages 81-99
  6. Markus Müller-Olm
    Pages 101-109
  7. Markus Müller-Olm
    Pages 111-143
  8. Markus Müller-Olm
    Pages 153-160
  9. Markus Müller-Olm
    Pages 161-164
  10. Markus Müller-Olm
    Pages 165-171
  11. Back Matter

About this book

Introduction

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.

Keywords

Automat Processing algorithm algorithms compiler complexity complexity theory verification

Authors and affiliations

  • Markus Müller-Olm
    • 1
  1. 1.Institut für Informatik, Fachbereich Mathematik und InformatikWestfälische Wilhelms-UniversitätMünsterGermany

Bibliographic information

  • DOI https://doi.org/10.1007/11871743
  • Copyright Information Springer-Verlag Berlin Heidelberg 2006
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-45385-7
  • Online ISBN 978-3-540-45386-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site