New results on the computability and complexity of points--to analysis

DOI10.1145/604131.604142zbMath1321.68178OpenAlexW2025514726MaRDI QIDQ2942917

Venkatesan T. Chakaravarthy

Publication date: 11 September 2015

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

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

zbMATH Keywords

complexityundecidabilitypointer analysisflow-sensitiveflow-insensitive

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of compilers and interpreters (68N20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Finding disjoint paths in networks with star shared risk link groups ⋮ Intensional Kleene and Rice theorems for abstract program semantics

Uses Software

• TREX

Cites Work

• Regular expression pattern matching for XML
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New results on the computability and complexity of points--to analysis