Fully Bounded Polyhedral Analysis of Integers with Wrapping

DOI10.1016/j.entcs.2012.10.003zbMath1294.68052OpenAlexW1973022923WikidataQ113318053 ScholiaQ113318053MaRDI QIDQ5170176

Björn Lisper, Niklas Holsti, Stefan Bygde

Publication date: 22 July 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2012.10.003

zbMATH Keywords

wideningconvex polyhedraabstract interpretationabstract domainsoverflowsnumerical domains

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Relational abstract interpretation of arrays in assembly code ⋮ Sound Bit-Precise Numerical Domains

Uses Software

• Octagon

Cites Work

• Unnamed Item
• The octagon abstract domain
• Taming the Wrapping of Integer Arithmetic
• Static analysis of arithmetical congruences
• Transfer Function Synthesis without Quantifier Elimination

This page was built for publication: Fully Bounded Polyhedral Analysis of Integers with Wrapping