Estimating the impact of scalable pointer analysis on optimization

DOI10.1007/3-540-47764-0_15MaRDI QIDQ4779114zbMATH OpenFDO

Authors Manuvir Das, Ben Liblit, Manuel Fähndrich, Jakob Rehof

Publication date 25 February 2003

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

Full work available at URL https://doi.org/10.1007/3-540-47764-0_15

Mathematics Subject Classification ID

Theory of programming languages (68N15) Computing methodologies and applications (68U99)

Recommendations

• Evaluating the effectiveness of pointer alias analyses
• Semi-sparse flow-sensitive pointer analysis
• Compiler Construction
• Static Analysis
• Probabilistic points-to analysis

Cited in

(15)

• Selective context-sensitivity for \(k\)\textit{-CFA} with CFL-reachability
• Polymorphic versus monomorphic flow-insensitive points-to analysis for C
• Partitioned memory models for program analysis
• Optimizing Pointer Analysis Using Bisimilarity
• Speeding up dataflow analysis using flow-insensitive pointer analysis
• Probabilistic points-to analysis
• The impact of alias analysis on VLIW scheduling
• Client-driven pointer analysis
• Semi-sparse flow-sensitive pointer analysis
• Compiler Construction
• Static Analysis
• A Scalable Inclusion Constraint Solver Using Unification
• Evaluating the effectiveness of pointer alias analyses
• Fast and precise handling of positive weight cycles for field-sensitive pointer analysis
• A novel analysis space for pointer analysis and its application for bug finding

This page was built for publication: Estimating the impact of scalable pointer analysis on optimization

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