Taming the Wrapping of Integer Arithmetic

DOI10.1007/978-3-540-74061-2_8MaRDI QIDQ3611998zbMATH OpenOpenAlexFDO

Authors Axel Simon, Andy King

Publication date 3 March 2009

Published in Static Analysis (Search for Journal in Brave)

Full work available at URL https://kar.kent.ac.uk/37594/1/content.pdf

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Fully Bounded Polyhedral Analysis of Integers with Wrapping
• Automatic repair of overflowing expressions with abstract interpretation
• A class of polynomially solvable range constraints for interval analysis without widenings
• Program Analysis Using Symbolic Ranges
• CONCUR 2005 – Concurrency Theory

Cited in

(14)

• Incremental closure for systems of two variables per inequality
• A new abstraction framework for affine transformers
• Incrementally closing octagons
• Abstract interpretation of microcontroller code: intervals meet congruences
• Sound bit-precise numerical domains
• Splitting the Control Flow with Boolean Flags
• A safe variant of the unsafe integer arithmetic of Java™
• Automatic repair of overflowing expressions with abstract interpretation
• Mind the gap: bit-vector interpolation recast over linear integer arithmetic
• Rewrite systems for integer arithmetic
• Fully Bounded Polyhedral Analysis of Integers with Wrapping
• Compiler Construction
• Transfer function synthesis without quantifier elimination
• On converting character strings to integers

Describes a project that uses

Uses Software

• CSSV
• ASTREE

This page was built for publication: Taming the Wrapping of Integer Arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611998)