Semi-sparse flow-sensitive pointer analysis
From MaRDI portal
Publication:5261519
DOI10.1145/1480881.1480911zbMATH Open1315.68074OpenAlexW2154847114MaRDI QIDQ5261519FDOQ5261519
Publication date: 3 July 2015
Published in: Proceedings of the 36th 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/1480881.1480911
Recommendations
Nonnumerical algorithms (68W05) Theory of compilers and interpreters (68N20) Semantics in the theory of computing (68Q55)
Cited In (19)
- Error checking with client-driven pointer analysis
- Static Analysis
- Title not available (Why is that?)
- A sparse evaluation technique for detailed semantic analyses
- Verifying pointer and string analyses with region type systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hash consed points-to sets
- Title not available (Why is that?)
- A new approach to pointer analysis for assignments
- Dead code elimination based pointer analysis for multithreaded programs
- Recognition of logically related regions based heap abstraction
- The Complexity of Andersen’s Analysis in Practice
- Static Analysis
- Optimizing Pointer Analysis Using Bisimilarity
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
This page was built for publication: Semi-sparse flow-sensitive pointer analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261519)