000 04197nam a22005055i 4500
001 978-1-84800-017-9
003 DE-He213
005 20201213200637.0
007 cr nn 008mamaa
008 100309s2008 xxk| s |||| 0|eng d
020 _a9781848000179
_9978-1-84800-017-9
024 7 _a10.1007/978-1-84800-017-9
_2doi
050 4 _aQA76.9.L63
050 4 _aQA76.5913
050 4 _aQA76.63
072 7 _aUM
_2bicssc
072 7 _aUYF
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aCOM036000
_2bisacsh
082 0 4 _a005.1015113
_223
100 1 _aSimon, Axel.
_eeditor.
245 1 0 _aValue-Range Analysis of C Programs
_h[electronic resource] :
_bTowards Proving the Absence of Buffer Overflow Vulnerabilities /
_cedited by Axel Simon.
264 1 _aLondon :
_bSpringer London,
_c2008.
300 _bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
505 0 _aFrom the Contents: Preface -- Introduction.-Value Range Analysis -- Analysing C -- A Semantics for C -- Core C -- Related Work -- Part 1 Abstracting Soundly -- Abstract State Space -- Points-To Analysis -- Numeric Domains -- Taming Casting and Wrapping -- A Language Featuring Finite Integer Arithmetic -- Implicit Wrapping of Polyhedral Variables -- Explicit Wrapping of Polyhedral Variables -- An Abstract Semantics for SubC -- Discussion -- Overlapping Memory Accesses and Pointers -- Memory as a Set of Fields -- Mixing Values and Pointers -- Abstraction Relation -- Abstract Semantics -- Part II Ensuring Efficiency -- Planar Polyhedra -- Operations on Inequalities -- Operations on Sets of Inequalities -- The TVPI Abstract Domain -- The Integral TVPI Domain -- Interfacing Analysis and Numeric Domain -- Inferring Relevant Fields and Addresses -- Applying Widening in Fixpoint Calculations -- Part III Improving Precision -- Tracking String Lengths -- Widening with Landmarks -- Combining Points-To and Numeric Analysis -- Conclusion and Outlook.
520 _aThe use of static analysis techniques to prove the partial correctness of C code has recently attracted much attention due to the high cost of software errors - particularly with respect to security vulnerabilities. However, research into new analysis techniques is often hampered by the technical difficulties of analysing accesses through pointers, pointer arithmetic, coercion between types, integer wrap-around and other low-level behaviour. Axel Simon provides a concise, yet formal description of a value-range analysis that soundly approximates the semantics of C programs using systems of linear inequalities (polyhedra). The analysis is formally specified down to the bit-level while providing a precise approximation of all low-level aspects of C using polyhedral operations and, as such, it provides a basis for implementing new analyses that are aimed at verifying higher-level program properties precisely. One example of such an analysis is the tracking of the NUL position in C string buffers, which is shown as an extension to the basic analysis and which thereby demonstrates the modularity of the approach. While the book focuses on a sound analysis of C, it will be useful to any researcher and student with an interest in static analysis of real-world programming languages. In fact, many concepts presented here carry over to other languages such as Java or assembler, to other applications such as taint analysis, array and shape analysis and possibly even to other approaches such as run-time verification and test data generation.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aLogic design.
650 0 _aElectronic data processing.
650 1 4 _aComputer Science.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aSoftware Engineering.
650 2 4 _aNumeric Computing.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9781848000162
856 4 0 _uhttp://dx.doi.org/10.1007/978-1-84800-017-9
912 _aZDB-2-SCS
950 _aComputer Science (Springer-11645)
999 _c13192
_d13192