Simon, Axel and King, Andy (2007) Taming the Wrapping of Integer Arithmetic. In: File, Gilberto and Nielson, Hanne Riis, eds. Static Analysis Symposium 14th International Symposium. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 182-196. ISBN 978-3-540-74060-5. E-ISBN 978-3-540-74061-2. (doi:10.1007/978-3-540-74061-2_8) (KAR id:37594)
PDF
Language: English |
|
Download this file (PDF/383kB) |
|
Request a format suitable for use with assistive technology e.g. a screenreader | |
Official URL: http://dx.doi.org/10.1007/978-3-540-74061-2_8 |
Abstract
Variables in programs are usually confined to a fixed number of bits and results that require more bits are truncated. Due to the use of 32-bit and 64-bit variables, inadvertent overflows are rare. However, a sound static analysis must reason about overflowing calculations and conversions between unsigned and signed integers; the latter remaining a common source of subtle programming errors. Rather than polluting an analysis with the low-level details of modelling two’s complement wrapping behaviour, this paper presents a computationally light-weight solution based on polyhedral analysis which eliminates the need to check for wrapping when evaluating most (particularly linear) assignments.
Item Type: | Book section |
---|---|
DOI/Identification number: | 10.1007/978-3-540-74061-2_8 |
Uncontrolled keywords: | basic block; linear expression; integer arithmetic; abstract semantic; polyhedral domain |
Subjects: | Q Science > QA Mathematics (inc Computing science) |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Andy King |
Date Deposited: | 12 Dec 2013 22:02 UTC |
Last Modified: | 05 Nov 2024 10:21 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/37594 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):