The Complexity of Andersen’s Analysis in Practice

DOI10.1007/978-3-642-03237-0_15MaRDI QIDQ3392927zbMATH OpenOpenAlexFDO

Authors Manu Sridharan, Stephen J. Fink

Publication date 18 August 2009

Published in Static Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03237-0_15

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1956463
• Points-to analysis as a system of linear equations
• scientific article; zbMATH DE number 1948396
• Semi-sparse flow-sensitive pointer analysis
• On the complexity analysis of static analyses

Cites work

• scientific article; zbMATH DE number 1251178 (Why is no real title available?)
• scientific article; zbMATH DE number 1956463 (Why is no real title available?)
• On the complexity of set-based analysis
• Projection merging
• Subcubic algorithms for recursive state machines

Cited in

(5)

• Hash consed points-to sets
• New results on the computability and complexity of points-to analysis
• scientific article; zbMATH DE number 1948396 (Why is no real title available?)
• scientific article; zbMATH DE number 1956463 (Why is no real title available?)
• Precise complexity guarantees for pointer analysis via Datalog with extensions

Describes a project that uses

Uses Software

• DaCapo
• Ant
• WALA
• Banshee

This page was built for publication: The Complexity of Andersen’s Analysis in Practice

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