The Complexity of Andersen’s Analysis in Practice

DOI10.1007/978-3-642-03237-0_15zbMath1248.68154OpenAlexW1650097949MaRDI QIDQ3392927

Stephen J. Fink, Manu Sridharan

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

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

Related Items (2)

Hash consed points-to sets ⋮ Precise complexity guarantees for pointer analysis via Datalog with extensions

Uses Software

• WALA
• DaCapo
• Banshee
• Ant

Cites Work

• Unnamed Item
• Unnamed Item
• Subcubic algorithms for recursive state machines
• Projection merging
• On the complexity of set-based analysis

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