Probabilistic points-to analysis

DOI10.1007/3-540-35767-X_19MaRDI QIDQ4424837zbMATH OpenFDO

Authors Yuan-Shin Hwang, Peng-Sheng Chen, Jenq Kuen Lee, Roy Dz-Ching Ju

Publication date 7 September 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/2624/26240290.htm

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Computing methodologies and applications (68U99)

Recommendations

• A Systematic Approach to Probabilistic Pointer Analysis
• Estimating the impact of scalable pointer analysis on optimization
• A novel probabilistic data flow framework
• Optimizing Pointer Analysis Using Bisimilarity
• Points-to analysis as a system of linear equations

Cited in

(12)

• On the non-approximability of points-to analysis
• Probabilistic analysis of vantage point trees
• Polymorphic versus monomorphic flow-insensitive points-to analysis for C
• Points-to and side-effect analyses for programs built with precompiled libraries
• A novel probabilistic data flow framework
• Optimizing Pointer Analysis Using Bisimilarity
• A Systematic Approach to Probabilistic Pointer Analysis
• Pointer Analysis, Conditional Soundness, and Proving the Absence of Errors
• Estimating the impact of scalable pointer analysis on optimization
• Points-to analysis as a system of linear equations
• Probabilistic data flow analysis: a linear equational approach
• High Performance Computing for Computational Science - VECPAR 2004

This page was built for publication: Probabilistic points-to analysis

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