Interval Analysis and Machine Arithmetic: Why Signedness Ignorance Is Bliss
Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Søndergaard, Peter J. Stuckey
The University of Melbourne
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
The most commonly used integer types have fixed bit-width, making it possible for computations to “wrap around,” and many programs depend on this behaviour. Yet much work to date on program analysis and verification of integer computations treats integers as having infinite precision, and most analyses that do respect fixed width lose precision when overflow is possible. We present a novel integer interval abstract domain that correctly handles wrap-around. The analysis is signedness agnostic. By treating integers as strings of bits, only considering signedness for operations that treat them differently, we produce precise, correct results at a modest cost in execution time.
逐年被引趋势
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
计算机 / AILogic, programming, and type systems
Numerical Methods and Algorithms · Formal Methods in Verification
参考文献 47
此处列出前 3 条
引用本文 34
按被引量排序,此处列出前 3 条