| 書(shū)目名稱(chēng) | Value-Range Analysis of C Programs |
| 副標(biāo)題 | Towards Proving the |
| 編輯 | Axel Simon |
| 視頻video | http://file.papertrans.cn/981/980388/980388.mp4 |
| 概述 | Complete formal specification of a static analysis of a real-world programming language.New techniques to soundly handle the wrapping of integers, overlapping memory accesses and pointer arithmetic, t |
| 圖書(shū)封面 |  |
| 描述 | 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 b |
| 出版日期 | Book 2008 |
| 關(guān)鍵詞 | C programming language; D programming language; Rack; Turing; Variable; abstract interpretation; algorithm |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-1-84800-017-9 |
| isbn_softcover | 978-1-84996-702-0 |
| isbn_ebook | 978-1-84800-017-9 |
| copyright | Springer-Verlag London 2008 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-5 08:19
發(fā)表于 2025-3-21 17:07:44
