Principles of program analysis:
Program analysis concerns static techniques for computating reliable approximate information about the dynamic behavior of programs. Applications include compilers (for code improvement), software validation (for detecting errors in algorithms or breaches of security) and transformations between dat...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | German |
| Published: |
Berlin [u.a.]
Springer
1999
|
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Summary: | Program analysis concerns static techniques for computating reliable approximate information about the dynamic behavior 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 gives 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. |
| Physical Description: | XXI, 450 S. graph. Darst. |
| ISBN: | 3540654100 |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV012806376 | ||
| 003 | DE-604 | ||
| 005 | 20130619 | ||
| 007 | t | ||
| 008 | 991005s1999 gw d||| |||| 00||| ger d | ||
| 016 | 7 | |a 957339836 |2 DE-101 | |
| 020 | |a 3540654100 |c Gb. : DM 79.00 |9 3-540-65410-0 | ||
| 035 | |a (OCoLC)300204311 | ||
| 035 | |a (DE-599)BVBBV012806376 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-739 |a DE-91G |a DE-29T |a DE-703 |a DE-384 |a DE-634 |a DE-83 |a DE-11 |a DE-188 | ||
| 050 | 0 | |a QA76.6 | |
| 082 | 0 | |a 005.1 |2 21 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a ST 230 |0 (DE-625)143617: |2 rvk | ||
| 100 | 1 | |a Nielson, Flemming |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Principles of program analysis |c Flemming Nielson ; Hanne Riis Nielson ; Chris Hankin |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 1999 | |
| 300 | |a XXI, 450 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a Program analysis concerns static techniques for computating reliable approximate information about the dynamic behavior 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 gives 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. | |
| 650 | 4 | |a Logiciels | |
| 650 | 7 | |a Logiciels |2 ram | |
| 650 | 7 | |a Ordinateurs - Programmation |2 ram | |
| 650 | 4 | |a Programmation (Informatique) | |
| 650 | 7 | |a algorithme |2 inriac | |
| 650 | 7 | |a analyse programme |2 inriac | |
| 650 | 7 | |a flot donnée |2 inriac | |
| 650 | 7 | |a interprétation abstraite |2 inriac | |
| 650 | 7 | |a système base contrainte |2 inriac | |
| 650 | 7 | |a transformation programme |2 inriac | |
| 650 | 7 | |a type |2 inriac | |
| 650 | 4 | |a Computer programs | |
| 650 | 0 | 7 | |a Programmanalyse |0 (DE-588)4175841-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Programmanalyse |0 (DE-588)4175841-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Nielson, Hanne Riis |d 1954- |e Verfasser |0 (DE-588)120458241 |4 aut | |
| 700 | 1 | |a Hankin, Chris |e Verfasser |4 aut | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008710317&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-008710317 | |
Record in the Search Index
| _version_ | 1807504954158481408 |
|---|---|
| adam_text |
CONTENTS
1
INTRODUCTION
1
1.1
THE
NATURE
OF
PROGRAM
ANALYSIS
.
1
1.2
SETTING
THE
SCENE
.
3
1.3
DATA
FLOW
ANALYSIS
.
5
1.3.1
THE
EQUATIONAL
APPROACH
.
5
1.3.2
THE
CONSTRAINT
BASED
APPROACH
.
8
1.4
CONSTRAINT
BASED
ANALYSIS
.
10
1.5
ABSTRACT
INTERPRETATION
.
13
1.6
TYPE
AND
EFFECT
SYSTEMS
.
17
1.6.1
ANNOTATED
TYPE
SYSTEMS
.
18
1.6.2
EFFECT
SYSTEMS
.
22
1.7
ALGORITHMS
.
25
1.8
TRANSFORMATIONS
.
26
CONCLUDING
REMARKS
.
29
MINI
PROJECTS
.
29
EXERCISES
.
31
2
DATA
FLOW
ANALYSIS
33
2.1
INTRAPROCEDURAL
ANALYSIS
.
33
2.1.1
AVAILABLE
EXPRESSIONS
ANALYSIS
.
37
2.1.2
REACHING
DEFINITIONS
ANALYSIS
.
41
2.1.3
VERY
BUSY
EXPRESSIONS
ANALYSIS
.
44
2.1.4
LIVE
VARIABLES
ANALYSIS
.
47
2.1.5
DERIVED
DATA
FLOW
INFORMATION
.
50
XII
CONTENTS
2.2
THEORETICAL
PROPERTIES
.
52
2.2.1
STRUCTURAL
OPERATIONAL
SEMANTICS
.
52
2.2.2
CORRECTNESS
OF
LIVE
VARIABLES
ANALYSIS
.
57
2.3
MONOTONE
FRAMEWORKS
.
63
2.3.1
BASIC
DEFINITIONS
.
65
2.3.2
THE
EXAMPLES
REVISITED
.
68
2.3.3
A
NON-DISTRIBUTIVE
EXAMPLE
.
70
2.4
EQUATION
SOLVING
.
72
2.4.1
THE
MFP
SOLUTION
.
72
2.4.2
THE
MOP
SOLUTION
.
76
2.5
INTERPROCEDURAL
ANALYSIS
.
80
2.5.1
STRUCTURAL
OPERATIONAL
SEMANTICS
.
83
2.5.2
INTRAPROCEDURAL
VERSUS
INTERPROCEDURAL
ANALYSIS
.
86
2.5.3
MAKING
CONTEXT
EXPLICIT
.
88
2.5.4
CALL
STRINGS
AS
CONTEXT
.
93
2.5.5
ASSUMPTION
SETS
AS
CONTEXT
.
97
2.5.6
FLOW-SENSITIVITY
VERSUS
FLOW-INSENSITIVITY
.
99
2.6
SHAPE
ANALYSIS
.
102
2.6.1
STRUCTURAL
OPERATIONAL
SEMANTICS
.
103
2.6.2
SHAPE
GRAPHS
.
107
2.6.3
THE
ANALYSIS
.
113
CONCLUDING
REMARKS
.
126
MINI
PROJECTS
.
130
EXERCISES
.
133
3
CONSTRAINT
BASED
ANALYSIS
139
3.1
ABSTRACT
0-CFA
ANALYSIS
.
139
3.1.1
THE
ANALYSIS
.
141
3.1.2
WELL-DEFINEDNESS
OF
THE
ANALYSIS
.
148
3.2
THEORETICAL
PROPERTIES
.
151
3.2.1
STRUCTURAL
OPERATIONAL
SEMANTICS
.
151
3.2.2
SEMANTIC
CORRECTNESS
.
156
3.2.3
EXISTENCE
OF
SOLUTIONS
.
160
CONTENTS
XIII
3.2.4
COINDUCTION
VERSUS
INDUCTION
.
163
3.3
SYNTAX
DIRECTED
0-CFA
ANALYSIS
.
166
3.3.1
SYNTAX
DIRECTED
SPECIFICATION
.
167
3.3.2
PRESERVATION
OF
SOLUTIONS
.
169
3.4
CONSTRAINT
BASED
0-CFA
ANALYSIS
.
171
3.4.1
PRESERVATION
OF
SOLUTIONS
.
173
3.4.2
SOLVING
THE
CONSTRAINTS
.
174
3.5
ADDING
DATA
FLOW
ANALYSIS
.
180
3.5.1
ABSTRACT
VALUES
AS
POWERSETS
.
180
3.5.2
ABSTRACT
VALUES
AS
COMPLETE
LATTICES
.
183
3.6
ADDING
CONTEXT
INFORMATION
.
187
3.6.1
UNIFORM
FC-CFA
ANALYSIS
.
189
3.6.2
THE
CARTESIAN
PRODUCT
ALGORITHM
.
194
CONCLUDING
REMARKS
.
196
MINI
PROJECTS
.
200
EXERCISES
.
203
4
ABSTRACT
INTERPRETATION
209
4.1 A
MUNDANE
APPROACH
TO
CORRECTNESS
.
209
4.1.1
CORRECTNESS
RELATIONS
.
212
4.1.2
REPRESENTATION
FUNCTIONS
.
214
4.1.3
A
MODEST
GENERALISATION
.
217
4.2
APPROXIMATION
OF
FIXED
POINTS
.
219
4.2.1
WIDENING
OPERATORS
.
222
4.2.2
NARROWING
OPERATORS
.
228
4.3
GALOIS
CONNECTIONS
.
231
4.3.1
PROPERTIES
OF
GALOIS
CONNECTIONS
.
237
4.3.2
GALOIS
INSERTIONS
.
240
4.4
SYSTEMATIC
DESIGN
OF
GALOIS
CONNECTIONS
.
244
4.4.1
COMPONENT-WISE
COMBINATIONS
.
247
4.4.2
OTHER
COMBINATIONS
.
251
4.5
INDUCED
OPERATIONS
.
256
4.5.1
INDUCING
ALONG
THE
ABSTRACTION
FUNCTION
.
256
XIV
CONTENTS
4.5.2
APPLICATION
TO
DATA
FLOW
ANALYSIS
.
260
4.5.3
INDUCING
ALONG
THE
CONCRETISATION
FUNCTION
.
265
CONCLUDING
REMARKS
.
268
MINI
PROJECTS
.
272
EXERCISES
.
274
5
TYPE
AND
EFFECT
SYSTEMS
281
5.1
CONTROL
FLOW
ANALYSIS
.
281
5.1.1
THE
UNDERLYING
TYPE
SYSTEM
.
282
5.1.2
THE
ANALYSIS
.
285
5.2
THEORETICAL
PROPERTIES
.
289
5.2.1
NATURAL
SEMANTICS
.
290
5.2.2
SEMANTIC
CORRECTNESS
.
292
5.2.3
EXISTENCE
OF
SOLUTIONS
.
295
5.3
INFERENCE
ALGORITHMS
.
298
5.3.1
AN
ALGORITHM
FOR
THE
UNDERLYING
TYPE
SYSTEM
.
298
5.3.2
AN
ALGORITHM
FOR
CONTROL
FLOW
ANALYSIS
.
304
5.3.3
SYNTACTIC
SOUNDNESS
AND
COMPLETENESS
.
310
5.3.4
EXISTENCE
OF
SOLUTIONS
.
315
5.4
EFFECTS
.
317
5.4.1
SIDE
EFFECT
ANALYSIS
.
317
5.4.2
EXCEPTION
ANALYSIS
.
323
5.4.3
REGION
INFERENCE
.
328
5.5
BEHAVIOURS
.
337
5.5.1
COMMUNICATION
ANALYSIS
.
337
CONCLUDING
REMARKS
.
347
MINI
PROJECTS
.
351
EXERCISES
.
357
6
ALGORITHMS
363
6.1
WORKLIST
ALGORITHMS
.
363
6.1.1
THE
STRUCTURE
OF
WORKLIST
ALGORITHMS
.
366
6.1.2
ITERATING
IN
LIFO
AND
FIFO
.
370
6.2
ITERATING
IN
REVERSE
POSTORDER
.
372
CONTENTS
XV
6.2.1
THE
ROUND
ROBIN
ALGORITHM
.
376
6.3
ITERATING
THROUGH
STRONG
COMPONENTS
.
379
CONCLUDING
REMARKS
.
382
MINI
PROJECTS
.
385
EXERCISES
.
387
A
PARTIALLY
ORDERED
SETS
391
A.L
BASIC
DEFINITIONS
.
391
A.
2
CONSTRUCTION
OF
COMPLETE
LATTICES
.
395
A.3
CHAINS
.
396
A.4
FIXED
POINTS
.
400
CONCLUDING
REMARKS
.
402
B
INDUCTION
AND
COINDUCTION
403
B.L
PROOF
BY
INDUCTION
.
403
B.2
INTRODUCING
COINDUCTION
.
405
B.3
PROOF
BY
COINDUCTION
.
409
CONCLUDING
REMARKS
.
413
C
GRAPHS
AND
REGULAR
EXPRESSIONS
415
C.L
GRAPHS
AND
FORESTS
.
415
C.2
REVERSE
POSTORDER
.
419
C.3
REGULAR
EXPRESSIONS
.
424
CONCLUDING
REMARKS
.
425
INDEX
OF
NOTATION
427
INDEX
431
BIBLIOGRAPHY
437 |
| any_adam_object | 1 |
| author | Nielson, Flemming Nielson, Hanne Riis 1954- Hankin, Chris |
| author_GND | (DE-588)120458241 |
| author_facet | Nielson, Flemming Nielson, Hanne Riis 1954- Hankin, Chris |
| author_role | aut aut aut |
| author_sort | Nielson, Flemming |
| author_variant | f n fn h r n hr hrn c h ch |
| building | Verbundindex |
| bvnumber | BV012806376 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.6 |
| callnumber-search | QA76.6 |
| callnumber-sort | QA 276.6 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 130 ST 134 ST 230 |
| ctrlnum | (OCoLC)300204311 (DE-599)BVBBV012806376 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV012806376</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20130619</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">991005s1999 gw d||| |||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">957339836</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540654100</subfield><subfield code="c">Gb. : DM 79.00</subfield><subfield code="9">3-540-65410-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)300204311</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012806376</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.6</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 230</subfield><subfield code="0">(DE-625)143617:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nielson, Flemming</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Principles of program analysis</subfield><subfield code="c">Flemming Nielson ; Hanne Riis Nielson ; Chris Hankin</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1999</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXI, 450 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Program analysis concerns static techniques for computating reliable approximate information about the dynamic behavior 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 gives 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.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logiciels</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Logiciels</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Ordinateurs - Programmation</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmation (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">analyse programme</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">flot donnée</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">interprétation abstraite</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">système base contrainte</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">transformation programme</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">type</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programs</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmanalyse</subfield><subfield code="0">(DE-588)4175841-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Programmanalyse</subfield><subfield code="0">(DE-588)4175841-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nielson, Hanne Riis</subfield><subfield code="d">1954-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)120458241</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hankin, Chris</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008710317&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-008710317</subfield></datafield></record></collection> |
| id | DE-604.BV012806376 |
| illustrated | Illustrated |
| indexdate | 2024-08-16T01:17:30Z |
| institution | BVB |
| isbn | 3540654100 |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008710317 |
| oclc_num | 300204311 |
| open_access_boolean | |
| owner | DE-739 DE-91G DE-BY-TUM DE-29T DE-703 DE-384 DE-634 DE-83 DE-11 DE-188 |
| owner_facet | DE-739 DE-91G DE-BY-TUM DE-29T DE-703 DE-384 DE-634 DE-83 DE-11 DE-188 |
| physical | XXI, 450 S. graph. Darst. |
| publishDate | 1999 |
| publishDateSearch | 1999 |
| publishDateSort | 1999 |
| publisher | Springer |
| record_format | marc |
| spelling | Nielson, Flemming Verfasser aut Principles of program analysis Flemming Nielson ; Hanne Riis Nielson ; Chris Hankin Berlin [u.a.] Springer 1999 XXI, 450 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Program analysis concerns static techniques for computating reliable approximate information about the dynamic behavior 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 gives 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. Logiciels Logiciels ram Ordinateurs - Programmation ram Programmation (Informatique) algorithme inriac analyse programme inriac flot donnée inriac interprétation abstraite inriac système base contrainte inriac transformation programme inriac type inriac Computer programs Programmanalyse (DE-588)4175841-9 gnd rswk-swf Programmanalyse (DE-588)4175841-9 s DE-604 Nielson, Hanne Riis 1954- Verfasser (DE-588)120458241 aut Hankin, Chris Verfasser aut DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008710317&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Nielson, Flemming Nielson, Hanne Riis 1954- Hankin, Chris Principles of program analysis Logiciels Logiciels ram Ordinateurs - Programmation ram Programmation (Informatique) algorithme inriac analyse programme inriac flot donnée inriac interprétation abstraite inriac système base contrainte inriac transformation programme inriac type inriac Computer programs Programmanalyse (DE-588)4175841-9 gnd |
| subject_GND | (DE-588)4175841-9 |
| title | Principles of program analysis |
| title_auth | Principles of program analysis |
| title_exact_search | Principles of program analysis |
| title_full | Principles of program analysis Flemming Nielson ; Hanne Riis Nielson ; Chris Hankin |
| title_fullStr | Principles of program analysis Flemming Nielson ; Hanne Riis Nielson ; Chris Hankin |
| title_full_unstemmed | Principles of program analysis Flemming Nielson ; Hanne Riis Nielson ; Chris Hankin |
| title_short | Principles of program analysis |
| title_sort | principles of program analysis |
| topic | Logiciels Logiciels ram Ordinateurs - Programmation ram Programmation (Informatique) algorithme inriac analyse programme inriac flot donnée inriac interprétation abstraite inriac système base contrainte inriac transformation programme inriac type inriac Computer programs Programmanalyse (DE-588)4175841-9 gnd |
| topic_facet | Logiciels Ordinateurs - Programmation Programmation (Informatique) algorithme analyse programme flot donnée interprétation abstraite système base contrainte transformation programme type Computer programs Programmanalyse |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008710317&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT nielsonflemming principlesofprogramanalysis AT nielsonhanneriis principlesofprogramanalysis AT hankinchris principlesofprogramanalysis |