Nonuniform alias analysis of recursive data structures and arrays

DOI10.1007/3-540-45789-5_6MaRDI QIDQ4411949zbMATH OpenFDO

Authors Arnaud J. Venet

Publication date 13 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2477/24770036.htm

Mathematics Subject Classification ID

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

Recommendations

• Automatic analysis of pointer aliasing for untyped programs
• A scalable nonuniform pointer analysis for embedded programs
• Data dependence analysis in programs with pointers
• Alias types for recursive data structures
• Experiences in analyzing data dependences for programs with pointers and structures

Cited in

(8)

• A logical analysis of aliasing in imperative higher-order functions
• Alias types for recursive data structures
• A logical analysis of aliasing in imperative higher-order functions
• Compiler Construction
• A scalable nonuniform pointer analysis for embedded programs
• Transformational derivation of an improved alias analysis algorithm
• The octagon abstract domain
• Pentagons: a weakly relational abstract domain for the efficient validation of array accesses

This page was built for publication: Nonuniform alias analysis of recursive data structures and arrays

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