Points-to analysis with efficient strong updates

DOI10.1145/1926385.1926389MaRDI QIDQ5408527zbMATH OpenOpenAlexFDO

Authors Ondřej Lhoták, Kwok-Chiang Andrew Chung

Publication date 10 April 2014

Published in Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1926385.1926389

zbMATH Keywords

Andersen's analysisflow sensitivityLLVMpoints-to analysisstrong updates

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• New results on the computability and complexity of points-to analysis
• On the non-approximability of points-to analysis
• scientific article; zbMATH DE number 1948396

Cited in

(11)

• Hash consed points-to sets
• A flow-insensitive-complete program representation
• scientific article; zbMATH DE number 1617323 (Why is no real title available?)
• scientific article; zbMATH DE number 1693486 (Why is no real title available?)
• Fluid updates: beyond strong vs. weak updates
• scientific article; zbMATH DE number 1948396 (Why is no real title available?)
• scientific article; zbMATH DE number 1956463 (Why is no real title available?)
• Points-to analysis as a system of linear equations
• Ownership guided C to Rust translation
• Fast and precise handling of positive weight cycles for field-sensitive pointer analysis
• Per-dereference verification of temporal heap safety via adaptive context-sensitive analysis

This page was built for publication: Points-to analysis with efficient strong updates

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