Principles of Program Analysis / Edition 1

Principles of Program Analysis / Edition 1

ISBN-10:
3540654100
ISBN-13:
9783540654100
Pub. Date:
11/23/1999
Publisher:
Springer Berlin Heidelberg
ISBN-10:
3540654100
ISBN-13:
9783540654100
Pub. Date:
11/23/1999
Publisher:
Springer Berlin Heidelberg
Principles of Program Analysis / Edition 1

Principles of Program Analysis / Edition 1

$84.99
Current price is , Original price is $84.99. You
$84.99 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.

  • SHIP THIS ITEM

    Temporarily Out of Stock Online

    Please check back later for updated availability.


Overview

Program analysis concerns static techniques for computing reliable approximate information about the dynamic behaviour of programs. Applications include compilers (for code improvement), software validation (for detecting errors in algorithms or breaches of security) and transformations between data representation (for solving problems such as the Y2K problem). This book is unique in giving an overview of the four major approaches to program analysis: data flow analysis, constraint based analysis, abstract interpretation, and type and effect systems. The presentation demonstrates the extensive similarities between the approaches; this will aid the reader in choosing the right approach and in enhancing it with insights from the other approaches. The book covers basic semantic properties as well as more advanced algorithmic techniques. The book is aimed at M.Sc. and Ph.D. students but will be valuable also for experienced researchers and professionals.

Product Details

ISBN-13: 9783540654100
Publisher: Springer Berlin Heidelberg
Publication date: 11/23/1999
Edition description: 1999
Pages: 452
Product dimensions: 6.14(w) x 9.21(h) x 0.24(d)

Table of Contents

1 Introduction.- 2 Data Flow Analysis.- 3 Constraint Based Analysis.- 4 Abstract Interpretation.- 5 Type and Effect Systems.- 6 Algorithms.- A Partially Ordered Sets.- A.1 Basic Definitions.- A.2 Construction of Complete Lattices.- A.3 Chains.- A.4 Fixed Points.- Concluding Remarks.- B Induction and Coinduction.- B.1 Proof by Induction.- B.2 Introducing Coinduction.- B.3 Proof by Coinduction.- Concluding Remarks.- C Graphs and Regular Expressions.- C.1 Graphs and Forests.- C.2 Reverse Postorder.- C.3 Regular Expressions.- Concluding Remarks.- Index of Notation.
From the B&N Reads Blog

Customer Reviews