Get Free Shipping on orders over $79
Value-Range Analysis of C Programs : Towards Proving the Absence of Buffer Overflow Vulnerabilities - Axel Simon

Value-Range Analysis of C Programs

Towards Proving the Absence of Buffer Overflow Vulnerabilities

By: Axel Simon

eText | 10 March 2010

At a Glance

eText


$239.00

or 4 interest-free payments of $59.75 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
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.
on
Desktop
Tablet
Mobile

Other Editions and Formats

Paperback

Published: 15th May 2011

More in Software Engineering

The End of Leadership - Barbara Kellerman

eBOOK

The Debugging Handbook - Johannes Kuhlmann

eBOOK

RRP $67.55

$54.99

19%
OFF
API Management with Bruno - Lyria Tharax

eBOOK

Essential n8n Playbook - Leandro Calado

eBOOK