Speeding up dataflow analysis using flow-insensitive pointer analysis

DOI10.1007/3-540-45789-5_18MaRDI QIDQ4411961zbMATH OpenFDO

Authors Stephen C. Adams, Thomas Ball, Manuvir Das, Sorin Lerner, Sriram K. Rajamani, Mark Seigle, Westley Weimer

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/24770230.htm

Mathematics Subject Classification ID

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

Recommendations

• Semi-sparse flow-sensitive pointer analysis
• Structurally defined conditional data-flow static analysis
• Estimating the impact of scalable pointer analysis on optimization
• Accelerated Data-Flow Analysis
• A novel analysis space for pointer analysis and its application for bug finding

Cited in

(6)

• Dead code elimination based pointer analysis for multithreaded programs
• Recognition of logically related regions based heap abstraction
• Structurally defined conditional data-flow static analysis
• Access analysis-based tight localization of abstract memories
• Improving the precision of equality-based dataflow analyses
• Semi-sparse flow-sensitive pointer analysis

Describes a project that uses

Uses Software

• Bandera

This page was built for publication: Speeding up dataflow analysis using flow-insensitive pointer analysis

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