Optimizing Pointer Analysis Using Bisimilarity

DOI10.1007/978-3-642-03237-0_16MaRDI QIDQ3392929zbMATH OpenOpenAlexFDO

Authors Luke Simon

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_16

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• scientific article; zbMATH DE number 1834572
• Semi-sparse flow-sensitive pointer analysis
• A new approach to pointer analysis for assignments
• scientific article; zbMATH DE number 1975596
• Hash consed points-to sets

Cites work

• An efficient algorithm for computing bisimulation equivalence
• scientific article; zbMATH DE number 2087570 (Why is no real title available?)
• scientific article; zbMATH DE number 5254145 (Why is no real title available?)
• On finding the strongly connected components in a directed graph
• Three Partition Refinement Algorithms

Cited in

(3)

• Hash consed points-to sets
• scientific article; zbMATH DE number 1975596 (Why is no real title available?)
• A new approach to pointer analysis for assignments

Describes a project that uses

Uses Software

• CIL

This page was built for publication: Optimizing Pointer Analysis Using Bisimilarity

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