Value-Range Analysis of C Programs: Towards Proving the Absence of Buffer Overflow Vulnerabilities

Springer Science & Business Media
3
Free sample

Abu?erover?owoccurswheninputiswrittenintoamemorybu?erthatisnot large enough to hold the input. Bu?er over?ows may allow a malicious person to gain control over a computer system in that a crafted input can trick the defectiveprogramintoexecutingcodethatisencodedintheinputitself.They are recognised as one of the most widespread forms of security vulnerability, and many workarounds, including new processor features, have been proposed to contain the threat. This book describes a static analysis that aims to prove the absence of bu?er over?ows in C programs. The analysis is conservative in the sense that it locates every possible over?ow. Furthermore, it is fully automatic in that it requires no user annotations in the input program. Thekeyideaoftheanalysisistoinferasymbolicstateforeachp- gram point that describes the possible variable valuations that can arise at that point. The program is correct if the inferred values for array indices and pointer o?sets lie within the bounds of the accessed bu?er. The symbolic state consists of a ?nite set of linear inequalities whose feasible points induce a convex polyhedron that represents an approximation to possible variable valuations. The book formally describes how program operations are mapped to operations on polyhedra and details how to limit the analysis to those p- tionsofstructuresandarraysthatarerelevantforveri?cation.Withrespectto operations on string bu?ers, we demonstrate how to analyse C strings whose length is determined by anul character within the string.
Read more

About the author

Axel Simon is a Swiss architecture critic and the editor "Hochparterre" magazine in Zurich.

Read more
4.3
3 total
Loading...

Additional Information

Publisher
Springer Science & Business Media
Read more
Published on
Mar 10, 2010
Read more
Pages
302
Read more
ISBN
9781848000179
Read more
Read more
Best For
Read more
Language
English
Read more
Genres
Computers / Programming / Algorithms
Computers / Programming / General
Computers / Programming Languages / General
Computers / Software Development & Engineering / General
Mathematics / Discrete Mathematics
Read more
Content Protection
This content is DRM protected.
Read more

Reading information

Smartphones and Tablets

Install the Google Play Books app for Android and iPad/iPhone. It syncs automatically with your account and allows you to read online or offline wherever you are.

Laptops and Computers

You can read books purchased on Google Play using your computer's web browser.

eReaders and other devices

To read on e-ink devices like the Sony eReader or Barnes & Noble Nook, you'll need to download a file and transfer it to your device. Please follow the detailed Help center instructions to transfer the files to supported eReaders.
This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. Mathematics educators consider it vital that their students be exposed to a course in discrete methods that introduces them to combinatorial mathematics and to algebraic and logical structures focusing on the interplay between computer science and mathematics. The present volume emphasizes combinatorics, graph theory with applications to some stand network optimization problems, and algorithms to solve these problems.
Chapters 0–3 cover fundamental operations involving sets and the principle of mathematical induction, and standard combinatorial topics: basic counting principles, permutations, combinations, the inclusion-exclusion principle, generating functions, recurrence relations, and an introduction to the analysis of algorithms. Applications are emphasized wherever possible and more than 200 exercises at the ends of these chapters help students test their grasp of the material.
Chapters 4 and 5 survey graphs and digraphs, including their connectedness properties, applications of graph coloring, and more, with stress on applications to coding and other related problems. Two important problems in network optimization ― the minimal spanning tree problem and the shortest distance problem ― are covered in the last two chapters. A very brief nontechnical exposition of the theory of computational complexity and NP-completeness is outlined in the appendix.
wer kämpft, kann verlieren. Wer nicht kämpft hat schon verloren." bert brecht Presse über mein Leben: DieTaz vom 4 9..84 zitiert einen meiner Bewacher:"Uff ene Art is det'n Held, ooch wenn er`n Spinner ist, weil der nich uffgibt, bei nüscht." "...er ist ein Michael Kohlhaas, einer, der den Schmerz nicht erträgt, die Welt in einer so ungeheuren Unordnung zu erblicken..." bemerkt Die Zeit im Oktober 1984 "Jemand, der durch seine beharrliche politische Arbeit die Staatsgewalt zur wutschnaubenden Raserei provoziert, der zwei Jahre Knast überstanden und sich durch Schach geistig am Leben gehalten hat, verkörpert für mich einen Mythos, wie direkt aus Stefan Zweigs berühmter 'Schachnovelle' entsprungen." Burghard Schröder in seinem Rowolt Taschenbuch "Unter Männern" "Über ihn wurde schon viel geschrieben, geredet und gerichtet." schreibt die Taz im Dezember 1987 Am 29. 7. 1990 schreibt Der Tagesspiegel: "...während Ralf-Axel Simons Gedichte in ihrer ironischen Kühle und poetischen Prägnanz sowohl an Gedichte Erich Frieds als auch an einen häufig in Ingeborg Drewitz`Erzählungen anzutreffenden Tenor erinnern." "Wurde die Welt um ihn herum zu schlimm, spielte er Schach Schach ist für Ralf-Axel Simon kein bloßes Hobby. Schach ist sein Leben - ...Er war alles:König und Läufer, Turm und Bauer , ein "Leibeigener hinter Gittern" dazu." schreibt der märkische Markt am 24.Oktober 2007 "Als Ralf-Axel Simon in den 80er Jahren ins Gefängnis musste, half ihm das Schachspiel, seine Einzelhaft zu überwinden. Vor 17 Jahren richtete der geborene Berliner einen Schachladen ein und hat heute bundesweit die wohl umfangreichste Sammlung an Schachspielen und -literatur." schreibt die MOZ am 30.9.2009 Ich über mich:RALF-AXEL SIMON:"IN DEN AUGEN DES STAATES BIN ICH EIN TERRORIST - IN DEN AUGEN MEINER FREUNDE EIN NARR UMGEKEHRT WÄRE ES MIR MANCHMAL LIEBER!" "in einer Welt, in der die Waren mehr Wert sind, als unser Leben, bewirkt die öffentliche Negation des Bestehenden manchmal mehr, als die Argumente in unseren Texten" aus dem Flugblatt :"für jede Räumung eine passende Antwort: 1 Mio. Sachschaden" von den autonomen Gruppen (gefunden in Kreuzberg im Juni 2011)
©2018 GoogleSite Terms of ServicePrivacyDevelopersArtistsAbout Google
By purchasing this item, you are transacting with Google Payments and agreeing to the Google Payments Terms of Service and Privacy Notice.