
Principles of Program Analysis
Springer (Publisher)
Published on 1. December 2010
Book
Paperback/Softback
XXI, 452 pages
978-3-642-08474-4 (ISBN)
Description
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.
More details
Edition
Softcover reprint of hardcover 1st ed. 1999
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Professional/practitioner
Illustrations
XXI, 452 p.
Dimensions
Height: 234 mm
Width: 156 mm
Thickness: 26 mm
Weight
717 gr
ISBN-13
978-3-642-08474-4 (9783642084744)
DOI
10.1007/978-3-662-03811-6
Schweitzer Classification
Other editions
Additional editions

Flemming Nielson | Hanne R. Nielson | Chris Hankin
Principles of Program Analysis
Book
10/1999
Springer
€85.59
Shipment within 10-15 days
Persons
Flemming Nielson and Hanne Riis Nielson are full professors at the Technical University of Denmark (DTU), where they research formal methods for safe and secure systems in the Dept. of Applied Mathematics and Computer Science. They have written successful textbooks, including the Springer titles "Semantics with Applications: An Appetizer" and "Principles of Program Analysis", and they have lectured on these topics at Aalborg University, Aarhus University, the University of Kiel, Saarland University, and the Technical University of Denmark.
Content
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.