HOME > Detail View

Detail View

Principles of program analysis

Principles of program analysis (Loan 18 times)

Material type
단행본
Personal Author
Nielson, Flemming, 1955- Nielson, Hanne Riis , 1954- Hankin, Chris.
Title Statement
Principles of program analysis / F. Nielson, Hanne Riis Nielson, Chris Hankin.
Publication, Distribution, etc
Berlin ;   New York :   Springer,   c1999.  
Physical Medium
xxi, 450 p. ; 24 cm.
ISBN
3540654100 (alk. paper)
Bibliography, Etc. Note
Includes bibliographical references and index.
Subject Added Entry-Topical Term
Computer programming. Computer programs. Computer programs. Computer programming. Programmation (Informatique) Logiciels.
000 01175camuu22003614a 4500
001 000000882971
005 20040604114537
008 990914s1999 nyu b 001 0 eng
010 ▼a 99047677
015 ▼a GBA0-29388
020 ▼a 3540654100 (alk. paper)
040 ▼a DLC ▼c DLC ▼d OHX ▼d C#P ▼d UKM ▼d LVB ▼d 211009
042 ▼a pcc
049 1 ▼l 121095031 ▼f 과학
050 0 0 ▼a QA76.6 ▼b .N537 1999
072 7 ▼a QA ▼2 lcco
082 0 0 ▼a 005.1 ▼2 21
090 ▼a 005.1 ▼b N669p
100 1 ▼a Nielson, Flemming, ▼d 1955-
245 1 0 ▼a Principles of program analysis / ▼c F. Nielson, Hanne Riis Nielson, Chris Hankin.
260 ▼a Berlin ; ▼a New York : ▼b Springer, ▼c c1999.
300 ▼a xxi, 450 p. ; ▼c 24 cm.
504 ▼a Includes bibliographical references and index.
650 0 ▼a Computer programming.
650 0 ▼a Computer programs.
650 4 ▼a Computer programs.
650 4 ▼a Computer programming.
650 6 ▼a Programmation (Informatique)
650 6 ▼a Logiciels.
700 1 ▼a Nielson, Hanne Riis , ▼d 1954-
700 1 ▼a Hankin, Chris.
938 ▼a Otto Harrassowitz ▼b HARR ▼n har000742513 ▼c 79.00 DEM

Holdings Information

No. Location Call Number Accession No. Availability Due Date Make a Reservation Service
No. 1 Location Science & Engineering Library/Sci-Info(Stacks2)/ Call Number 005.1 N669p Accession No. 121095031 Availability Available Due Date Make a Reservation Service B M

Contents information

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.


Information Provided By: : Aladin

New Arrivals Books in Related Fields

Zumstein, Felix (2022)