Program Analysis Using Symbolic Ranges

DOI10.1007/978-3-540-74061-2_23MaRDI QIDQ3612010zbMATH OpenOpenAlexFDO

Authors Sriram Sankaranarayanan, Franjo Ivančić, Aarti Gupta

Publication date 3 March 2009

Published in Static Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74061-2_23

Mathematics Subject Classification ID

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

Recommendations

• An abstract domain to infer symbolic ranges over nonnegative parameters
• A class of polynomially solvable range constraints for interval analysis without widenings
• Value-range analysis of C programs. Towards proving the absence of buffer overflow vulnerabilities
• Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(12)

• Advanced symbolic analysis for compilers. New techniques and algorithms for symbolic program analysis and optimization.
• Checking array bounds by abstract interpretation and symbolic expressions
• An abstract domain to infer symbolic ranges over nonnegative parameters
• Generalizing the template polyhedral domain
• Static contract checking with abstract interpretation
• Value-range analysis of C programs. Towards proving the absence of buffer overflow vulnerabilities
• Taming the Wrapping of Integer Arithmetic
• Discovering invariants via simple component analysis
• The two variable per inequality abstract domain
• Fixing code that explodes under symbolic evaluation
• Interprocedural and flow-sensitive type analysis for memory and type safety of C code
• Efficient SAT-based bounded model checking for software verification

Describes a project that uses

Uses Software

• PPL
• CSSV
• Octagon

This page was built for publication: Program Analysis Using Symbolic Ranges

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