Value-range analysis of C programs: towards proving the absence of buffer overflow vulnerabilities
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
London
Springer
2008
|
| Schlagworte: | |
| Online-Zugang: | kostenfrei Zentralblatt MATH Inhaltsverzeichnis |
| Beschreibung: | Literaturverz. S. [285] - 296 |
| Beschreibung: | XXII, 300 S. graph. Darst. 235 mm x 155 mm |
| ISBN: | 1848000162 9781848000162 9781849967020 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV036650176 | ||
| 003 | DE-604 | ||
| 005 | 20160421 | ||
| 007 | t | ||
| 008 | 100902s2008 d||| |||| 00||| eng d | ||
| 010 | |a 2008930099 | ||
| 015 | |a 07N300080 |2 dnb | ||
| 016 | 7 | |a 984829520 |2 DE-101 | |
| 020 | |a 1848000162 |c Gb. : ca. sfr 139.50 (freier Pr.) |9 1-8480-0016-2 | ||
| 020 | |a 9781848000162 |c Gb. : ca. sfr 139.50 (freier Pr.) |9 978-1-84800-016-2 | ||
| 020 | |a 9781849967020 |c softcover |9 978-1-84996-702-0 | ||
| 035 | |a (OCoLC)255908308 | ||
| 035 | |a (DE-599)DNB984829520 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-83 | ||
| 082 | 0 | |a 005.435 | |
| 084 | |a ST 250 |0 (DE-625)143626: |2 rvk | ||
| 084 | |a DAT 358f |2 stub | ||
| 084 | |a 004 |2 sdnb | ||
| 084 | |a DAT 406f |2 stub | ||
| 100 | 1 | |a Simon, Axel |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Value-range analysis of C programs |b towards proving the absence of buffer overflow vulnerabilities |c Axel Simon |
| 264 | 1 | |a London |b Springer |c 2008 | |
| 300 | |a XXII, 300 S. |b graph. Darst. |c 235 mm x 155 mm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Literaturverz. S. [285] - 296 | ||
| 650 | 0 | |a C (Computer program language) | |
| 650 | 0 | |a Memory management (Computer science) | |
| 650 | 0 | 7 | |a Speicherverwaltung |0 (DE-588)4182146-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a C |g Programmiersprache |0 (DE-588)4113195-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Pufferüberlauf |0 (DE-588)4752450-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a C |g Programmiersprache |0 (DE-588)4113195-2 |D s |
| 689 | 0 | 1 | |a Pufferüberlauf |0 (DE-588)4752450-9 |D s |
| 689 | 0 | 2 | |a Speicherverwaltung |0 (DE-588)4182146-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-1-84800-017-9 |
| 856 | 4 | |u http://www.gbv.de/dms/ilmenau/toc/537461477.PDF |z kostenfrei |3 Inhaltsverzeichnis | |
| 856 | 4 | |m DE-601 |q pdf/application |u http://www.zentralblatt-math.org/zmath/en/search/?an=1155.68002 |y Zentralblatt MATH |z kostenfrei |3 Inhaltstext | |
| 856 | 4 | 2 | |m GBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020569693&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-020569693 | ||
Datensatz im Suchindex
| _version_ | 1804143265073594368 |
|---|---|
| adam_text | IMAGE 1
AXEL SIMON
VALUE-RANGE ANALYSIS
OF C PROGRAMS
TOWARDS PROVING THE ABSENCE OF BUFFER OVERFLOW VULNERABILITIES
4UE SPRI NGER
IMAGE 2
CONTENTS
PREFACE VII
CONTRIBUTIONS XVII
LIST OF FIGURES XIX
1 INTRODUCTION , 1
1.1 TECHNICAL BACKGROUND , 2
1.2 VALUE-RANGE ANALYSIS 4
1.3 ANALYSING C 6
1.4 SOUNDNESS 7
1.4.1 AN ABSTRACTION OF C 7
1.4.2 COMBINING VALUE AND CONTENT ABSTRACTION 8
1.4.3 COMBINING POINTER AND VALUE-RANGE ANALYSIS 9
1.5 EMCIENCY 11
1.6 COMPLETENESS 15
1.6.1 ANALYSING STRING BUFFERS 16
1.6.2 WIDENING WITH LANDMARKS 16
1.6.3 REFINING POINTS-TO ANALYSIS 17
1.6.4 FURTHER REFINEMENTS 17
1.7 RELATED TOOLS 18
1.7.1 THE ASTREE ANALYSER 18
1.7.2 SLAM AND ESPX 19
1.7.3 CCURED 20
1.7.4 OTHER APPROACHES 20
2 A SEMANTICS FOR C 23
2.1 CORE C 23
2.2 PRELIMINARIES 28
2.3 THE ENVIRONMENT 28
2.4 CONCRETE SEMANTICS 32
IMAGE 3
XII CONTENTS
2.5 COLLECTING SEMANTICS 37
2.6 RELATED WORK 42
PART I ABSTRACTING SOUNDLY
3 ABSTRACT STATE SPACE 47
3.1 AN INTRODUCTORY EXAMPLE 48
3.2 POINTS-TO ANALYSIS 51
3.2.1 THE POINTS-TO ABSTRACT DOMAIN 54
3.2.2 RELATED WORK 55
3.3 NUMERIC DOMAINS 56
3.3.1 THE DOMAIN OF CONVEX POLYHEDRA 56
3.3.2 OPERATIONS ON POLYHEDRA 59
3.3.3 MULTIPLICITY DOMAIN 62
3.3.4 COMBINING THE POLYHEDRAL AND MULTIPLICITY DOMAINS .. 65 3.3.5
RELATED WORK 68
4 TAMING CASTING AND WRAPPING 71
4.1 MODELLING THE WRAPPING OF INTEGERS 72
4.2 A LANGUAGE FEATURING FINITE INTEGER ARITHMETIC 74
4.2.1 THE SYNTAX OF SUB C 74
4.2.2 THE SEMANTICS OF SUB C 75
4.3 POLYHEDRAL ANALYSIS OF FINITE INTEGERS 76
4.4 IMPLICIT WRAPPING OF POLYHEDRAL VARIABLES 77
4.5 EXPLICIT WRAPPING OF POLYHEDRAL VARIABLES 78
4.5.1 WRAPPING VARIABLES WITH A FINITE RANGE 78
4.5.2 WRAPPING VARIABLES WITH INFINITE RANGES 80
4.5.3 WRAPPING SEVERAL VARIABLES 80
4.5.4 AN ALGORITHM FOR EXPLICIT WRAPPING .. 82
4.6 AN ABSTRACT SEMANTICS FOR SUB C 83
4.7 DISCUSSION 86
4.7.1 RELATED WORK 87
5 OVERLAPPING MEMORY ACCESSES AND POINTERS 89
5.1 MEMORY AS A SET OF FIELDS 89
5.1.1 MEMORY LAYOUT FOR CORE C 90
5.2 ACCESS TREES 93
5.2.1 RELATED WORK 99
5.3 MIXING VALUES AND POINTERS 100
5.4 ABSTRACTION RELATION 106
5.4.1 ON CHOOSING AN ABSTRACTION FRAMEWORK 108
IMAGE 4
CONTENTS XIII
6 ABSTRACT SEMANTICS 111
6.1 EXPRESSIONS AND SIMPLE ASSIGNMENTS 116
6.2 ASSIGNING STRUCTURES 118
6.3 CASTING, &-OPERATIONS, AND DYNAMIC MEMORY 121
6.4 INFERRING FIELDS AUTOMATICALLY 123
PART II ENSURING EFFICIENCY
7 PLANAR POLYHEDRA 127
7.1 OPERATIONS ON INEQUALITIES 129
7.1.1 ENTAILMENT BETWEEN SINGLE INEQUALITIES 130
7.2 OPERATIONS ON SETS OF INEQUALITIES 131
7.2.1 ENTAILMENT CHECK 131
7.2.2 REMOVING REDUNDANCIES 132
7.2.3 CONVEX HUELL 134
7.2.4 LINEAR PROGRAMMING AND PLANAR POLYHEDRA 144
7.2.5 WIDENING PLANAR POLYHEDRA 145
8 THE T V PI ABSTRACT DOMAIN 147
8.1 PRINCIPLES OF THE TVPI DOMAIN 148
8.1.1 ENTAILMENT CHECK 150
8.1.2 CONVEX HUELL 150
8.1.3 PROJECTION 151
8.2 REDUCED PRODUCT BETWEEN BOEUENDS AND INEQUALITIES 152
8.2.1 REDUNDANCY REMOVAL IN THE REDUCED PRODUCT 155
8.2.2 INCREMENTAL CLOSURE 156
8.2.3 APPROXIMATING GENERAL INEQUALITIES 160
8.2.4 LINEAR PROGRAMMING IN THE TVPI DOMAIN 160
8.2.5 WIDENING OF TVPI POLYHEDRA 161
8.3 RELATED WORK 163
9 THE INTEGRAL T V PI DOMAIN 165
9.1 THE MERIT OF Z-POLYHEDRA 166
9.1.1 IMPROVING PRECISION 166
9.1.2 LIMITING THE GROWTH OF COEFFICIENTS 167
9.2 HARVEY S INTEGRAL HUELL ALGORITHM 168
9.2.1 CALCULATING CUTS BETWEEN TWO INEQUALITIES 169
9.2.2 INTEGER HUELL IN THE REDUCED PRODUCT DOMAIN 172
9.3 PLANAR Z-POLYHEDRA AND CLOSURE 177
9.3.1 POSSIBLE IMPLEMENTATIONS OF A Z-TVPI DOMAIN 177
9.3.2 TIGHTENING BOUNDS ACROSS PROJECTIONS 179
9.3.3 DISCUSSION AND IMPLEMENTATION 180
9.4 RELATED WORK 182
IMAGE 5
XIV CONTENTS
10 INTERFACING ANALYSIS AND NUMERIC DOMAIN 185
10.1 SEPARATING INTERVAL FROM RELATIONAL INFORMATION 185
10.2 INFERRING RELEVANT FIELDS AND ADDRESSES 187
10.2.1 TYPED ABSTRACT VARIABLES 189
10.2.2 POPULATING THE FIELD MAP 190
10.3 APPLYING WIDENING IN FIXPOINT CALCULATIONS 192
PART III IMPROVING PRECISION
11 TRACKING STRING LENGTHS 197
11.1 MANIPULATING IMPLICITLY TERMINATED STRINGS 198
11.1.1 ANALYSING THE STRING LOOP 199
11.1.2 CALCULATING A FIXPOINT OF THE LOOP 203
11.1.3 PREREQUISITES FOR STRING BUFFER ANALYSIS 209
11.2 INCORPORATING STRING BUFFER ANALYSIS 209
11.2.1 EXTENDING THE ABSTRACTION RELATION 212
11.3 RELATED WORK 213
12 WIDENING WITH LANDMARKS 217
12.1 AN INTRODUCTION TO WIDENING/NARROWING 217
12.1.1 THE LIMITATIONS OF NARROWING 218
12.1.2 IMPROVING WIDENING AND REMOVING NARROWING 220
12.2 REVISITING THE ANALYSIS OF STRING BUFFERS 220
12.2.1 APPLYING THE WIDENING/NARROWING APPROACH 222
12.2.2 THE RATIONALE BEHIND LANDMARKS 222
12.2.3 CREATING LANDMARKS FOR WIDENING 225
12.2.4 USING LANDMARKS IN WIDENING 225
12.3 ACQUIRING LANDMARKS 226
12.4 USING LANDMARKS AT A WIDENING POINT 227
12.5 EXTRAPOLATION OPERATOR FOR POLYHEDRA 229
12.6 RELATED WORK 231
13 COMBINING POINTS-TO AND NUMERIC ANALYSES 235
13.1 BOOLEAN FLAGS IN THE NUMERIC DOMAIN 237
13.1.1 BOOLEAN FLAGS AND UNBOUNDED POLYHEDRA 238
13.1.2 INTEGRALITY OF THE SOLUTION SPACE 239
13.1.3 APPLICATIONS OF BOOLEAN FLAGS 240
13.2 INCORPORATING BOOLEAN FLAGS INTO POINTS-TO SETS 241
13.2.1 REVISING ACCESS TREES AND ACCESS FUNCTIONS 241
13.2.2 THE SEMANTICS OF EXPRESSIONS AND ASSIGNMENTS 244
13.2.3 CONDITIONALS AND POINTS-TO FLAGS 246
13.2.4 INCORPORATING BOOLEAN FLAGS INTO THE ABSTRACTION RELATION 249
IMAGE 6
CONTENTS XV
13.3 PRACTICAL IMPLEMENTATION 250
13.3.1 INFERRING POINTS-TO FLAGS ON DEMAND 251
13.3.2 POPULATING THE ADDRESS MAP ON DEMAND 251
13.3.3 INDEX-SENSITIVE MEMORY ACCESS FUNCTIONS 253
13.3.4 RELATED WORK 255
14 IMPLEMENTATION 259
14.1 TECHNICAL OVERVIEW OF THE ANALYSER 260
14.2 MANAGING ABSTRACT DOMAINS 262
14.3 CALCULATING FIXPOINTS 264
14.3.1 SCHEDULING OF CODE WITHOUT LOOPS 265
14.3.2 SCHEDULING IN THE PRESENCE OF LOOPS AND FUNCTION CALLS 267
14.3.3 DERIVING AN ITERATION STRATEGY FROM TOPOLOGY 268
14.3.4 RELATED WORK 269
14.4 LIMITATIONS OF THE STRING BUFFER ANALYSIS 271
14.4.1 WEAKNESSES OF TRACKING FIRST NUL POSITIONS 271
14.4.2 HANDLING SYMBOLIC NUL POSITIONS 272
14.5 PROPOSED FUTURE REFINEMENTS 276
15 CONCLUSION AND OUTLOOK 277
A CORE C EXAMPLE 281
REFERENCES 285
INDEX 297
|
| any_adam_object | 1 |
| author | Simon, Axel |
| author_facet | Simon, Axel |
| author_role | aut |
| author_sort | Simon, Axel |
| author_variant | a s as |
| building | Verbundindex |
| bvnumber | BV036650176 |
| classification_rvk | ST 250 |
| classification_tum | DAT 358f DAT 406f |
| ctrlnum | (OCoLC)255908308 (DE-599)DNB984829520 |
| dewey-full | 005.435 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.435 |
| dewey-search | 005.435 |
| dewey-sort | 15.435 |
| 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>02312nam a2200541 c 4500</leader><controlfield tag="001">BV036650176</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20160421 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">100902s2008 d||| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2008930099</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">07N300080</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">984829520</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1848000162</subfield><subfield code="c">Gb. : ca. sfr 139.50 (freier Pr.)</subfield><subfield code="9">1-8480-0016-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781848000162</subfield><subfield code="c">Gb. : ca. sfr 139.50 (freier Pr.)</subfield><subfield code="9">978-1-84800-016-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781849967020</subfield><subfield code="c">softcover</subfield><subfield code="9">978-1-84996-702-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)255908308</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB984829520</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">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.435</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 250</subfield><subfield code="0">(DE-625)143626:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 358f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 406f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Simon, Axel</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Value-range analysis of C programs</subfield><subfield code="b">towards proving the absence of buffer overflow vulnerabilities</subfield><subfield code="c">Axel Simon</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London</subfield><subfield code="b">Springer</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXII, 300 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">235 mm x 155 mm</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="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. [285] - 296</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">C (Computer program language)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Memory management (Computer science)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Speicherverwaltung</subfield><subfield code="0">(DE-588)4182146-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">C</subfield><subfield code="g">Programmiersprache</subfield><subfield code="0">(DE-588)4113195-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Pufferüberlauf</subfield><subfield code="0">(DE-588)4752450-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">C</subfield><subfield code="g">Programmiersprache</subfield><subfield code="0">(DE-588)4113195-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Pufferüberlauf</subfield><subfield code="0">(DE-588)4752450-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Speicherverwaltung</subfield><subfield code="0">(DE-588)4182146-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-1-84800-017-9</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.gbv.de/dms/ilmenau/toc/537461477.PDF</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="m">DE-601</subfield><subfield code="q">pdf/application</subfield><subfield code="u">http://www.zentralblatt-math.org/zmath/en/search/?an=1155.68002</subfield><subfield code="y">Zentralblatt MATH</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">GBV 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=020569693&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-020569693</subfield></datafield></record></collection> |
| id | DE-604.BV036650176 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T22:44:54Z |
| institution | BVB |
| isbn | 1848000162 9781848000162 9781849967020 |
| language | English |
| lccn | 2008930099 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-020569693 |
| oclc_num | 255908308 |
| open_access_boolean | 1 |
| owner | DE-91G DE-BY-TUM DE-83 |
| owner_facet | DE-91G DE-BY-TUM DE-83 |
| physical | XXII, 300 S. graph. Darst. 235 mm x 155 mm |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Springer |
| record_format | marc |
| spelling | Simon, Axel Verfasser aut Value-range analysis of C programs towards proving the absence of buffer overflow vulnerabilities Axel Simon London Springer 2008 XXII, 300 S. graph. Darst. 235 mm x 155 mm txt rdacontent n rdamedia nc rdacarrier Literaturverz. S. [285] - 296 C (Computer program language) Memory management (Computer science) Speicherverwaltung (DE-588)4182146-4 gnd rswk-swf C Programmiersprache (DE-588)4113195-2 gnd rswk-swf Pufferüberlauf (DE-588)4752450-9 gnd rswk-swf C Programmiersprache (DE-588)4113195-2 s Pufferüberlauf (DE-588)4752450-9 s Speicherverwaltung (DE-588)4182146-4 s DE-604 Erscheint auch als Online-Ausgabe 978-1-84800-017-9 http://www.gbv.de/dms/ilmenau/toc/537461477.PDF kostenfrei Inhaltsverzeichnis DE-601 pdf/application http://www.zentralblatt-math.org/zmath/en/search/?an=1155.68002 Zentralblatt MATH kostenfrei Inhaltstext GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020569693&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Simon, Axel Value-range analysis of C programs towards proving the absence of buffer overflow vulnerabilities C (Computer program language) Memory management (Computer science) Speicherverwaltung (DE-588)4182146-4 gnd C Programmiersprache (DE-588)4113195-2 gnd Pufferüberlauf (DE-588)4752450-9 gnd |
| subject_GND | (DE-588)4182146-4 (DE-588)4113195-2 (DE-588)4752450-9 |
| title | Value-range analysis of C programs towards proving the absence of buffer overflow vulnerabilities |
| title_auth | Value-range analysis of C programs towards proving the absence of buffer overflow vulnerabilities |
| title_exact_search | Value-range analysis of C programs towards proving the absence of buffer overflow vulnerabilities |
| title_full | Value-range analysis of C programs towards proving the absence of buffer overflow vulnerabilities Axel Simon |
| title_fullStr | Value-range analysis of C programs towards proving the absence of buffer overflow vulnerabilities Axel Simon |
| title_full_unstemmed | Value-range analysis of C programs towards proving the absence of buffer overflow vulnerabilities Axel Simon |
| title_short | Value-range analysis of C programs |
| title_sort | value range analysis of c programs towards proving the absence of buffer overflow vulnerabilities |
| title_sub | towards proving the absence of buffer overflow vulnerabilities |
| topic | C (Computer program language) Memory management (Computer science) Speicherverwaltung (DE-588)4182146-4 gnd C Programmiersprache (DE-588)4113195-2 gnd Pufferüberlauf (DE-588)4752450-9 gnd |
| topic_facet | C (Computer program language) Memory management (Computer science) Speicherverwaltung C Programmiersprache Pufferüberlauf |
| url | http://www.gbv.de/dms/ilmenau/toc/537461477.PDF http://www.zentralblatt-math.org/zmath/en/search/?an=1155.68002 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020569693&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT simonaxel valuerangeanalysisofcprogramstowardsprovingtheabsenceofbufferoverflowvulnerabilities |