Principles of Program Analysis

Flemming Nielson

ISBN 10: 3540654100 / ISBN 13: 9783540654100

Editore: Springer Berlin Heidelberg, 1999

Riguardo questo articolo

Druck auf Anfrage Neuware - Printed after ordering - 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.

Codice articolo 9783540654100

Dati bibliografici

• Titolo: Principles of Program Analysis
• Editore: Springer Berlin Heidelberg
• Data di pubblicazione: 1999
• Lingua: Inglese
• ISBN 10: 3540654100
• ISBN 13: 9783540654100
• Rilegatura: Buch
• Condizione: Neu
• Dimensioni: 240 L x 161 A x 32 P (millimetri) 240 millimetri di larghezza per 161 millimetri di altezza per 32 millimetri di profondità
• Peso: 883 grammi

Descrizione articolo

Riassunto

Program analysis utilizes static techniques for computing reliable information about the dynamic behavior of programs. Applications include compilers (for code improvement), software validation (for detecting errors) and transformations between data representation (for solving problems such as Y2K). This book is unique in providing 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 illustrates the extensive similarities between the approaches, helping readers to choose the best one to utilize.

Contenuti

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.