On the non-approximability of points-to analysis

DOI10.1007/S00236-002-0081-8zbMath1034.68042OpenAlexW1991810412MaRDI QIDQ1403322

Susan Horwitz, Venkatesan T. Chakaravarthy

Publication date: 1 September 2003

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-002-0081-8

zbMATH Keywords

pointer analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of compilers and interpreters (68N20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Dynamic state restoration using versioning exceptions

This page was built for publication: On the non-approximability of points-to analysis