Polymorphic versus monomorphic flow-insensitive points-to analysis for C

DOI10.1007/978-3-540-45099-3_10MaRDI QIDQ2722056zbMATH OpenFDO

Authors Jeffrey S. Foster, Manuel Fähndrich, Alexander M. Aiken

Publication date 11 July 2001

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

Full work available at URL https://doi.org/10.1007/978-3-540-45099-3_10

zbMATH Keywords

constraint-based program analysis

Mathematics Subject Classification ID

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

Recommendations

• Points-to analysis with efficient strong updates
• Probabilistic points-to analysis
• Semi-sparse flow-sensitive pointer analysis
• Estimating the impact of scalable pointer analysis on optimization
• On the non-approximability of points-to analysis

Cited in

(2)

• Formalisation and implementation of an algorithm for bytecode verification of \@NonNull types
• Dynamic state restoration using versioning exceptions

Describes a project that uses

Uses Software

• Lackwit
• MOCHA

This page was built for publication: Polymorphic versus monomorphic flow-insensitive points-to analysis for C

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