Cantitate/Preț
Produs

Principles of Program Analysis

Autor Flemming Nielson, Hanne R. Nielson, Chris Hankin
en Limba Engleză Hardback – 22 oct 1999
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 34130 lei  6-8 săpt.
  Springer Berlin, Heidelberg – dec 2010 34130 lei  6-8 săpt.
Hardback (1) 51884 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 22 oct 1999 51884 lei  6-8 săpt.

Preț: 51884 lei

Preț vechi: 64854 lei
-20% Nou

Puncte Express: 778

Preț estimativ în valută:
9931 10328$ 8322£

Carte tipărită la comandă

Livrare economică 13-27 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540654100
ISBN-10: 3540654100
Pagini: 488
Ilustrații: XXI, 452 p.
Dimensiuni: 156 x 234 x 33 mm
Greutate: 0.85 kg
Ediția:1999
Editura: Springer Berlin, Heidelberg
Colecția Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Professional/practitioner

Cuprins

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.

Caracteristici

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 Includes supplementary material: sn.pub/extras