XWe have detected your location as outside the U.S/Canada, if you think this is wrong, you can choose your location.

Macmillan Higher Education Celebrating 20 years of Macmillan Study Skills

Cart

Continue Shopping
All prices are shown excluding Tax
The submitted promocode is invalid
* Applied promocode: ×

Important information on your ebook order

Principles of Program Analysis

Author(s):
Publisher:

Springer

Pages: 452
Further Actions:

Recommend to library

AVAILABLE FORMATS

Paperback - 9783642084744

01 December 2010

$79.99

In stock

Hardcover - 9783540654100

22 October 1999

$79.99

Free Shipping

In stock

Ebook - 9783662038116

27 February 2015

$59.99

In stock

All prices are shown excluding Tax

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...

Show More

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.

Show Less

The only book providing an introduction to the active area of program analysis for advanced students, researchers, and professionals
Tested in various courses: Aarhus, Imperial College (London), Pisa, Saarbr?cken, Tel Aviv, Copenhagen, Schloss Dagstuhl International Conference and Research Center
Power Point transparencies will be made available online

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.
Add a review

New Publications 

Best Sellers