Static Analysis

Volume 5079 of the series Lecture Notes in Computer Science pp 62-77

Pointer Analysis, Conditional Soundness, and Proving the Absence of Errors

  • Christopher L. ConwayAffiliated withDept. of Computer Science, New York University
  • , Dennis DamsAffiliated withBell Laboratories, Alcatel-Lucent
  • , Kedar S. NamjoshiAffiliated withBell Laboratories, Alcatel-Lucent
  • , Clark BarrettAffiliated withDept. of Computer Science, New York University

* Final gross prices may vary according to local VAT.

Get Access


It is well known that the use of points-to information can substantially improve the accuracy of a static program analysis. Commonly used algorithms for computing points-to information are known to be sound only for memory-safe programs. Thus, it appears problematic to utilize points-to information to verify the memory safety property without giving up soundness. We show that a sound combination is possible, even if the points-to information is computed separately and only conditionally sound. This result is based on a refined statement of the soundness conditions of points-to analyses and a general mechanism for composing conditionally sound analyses.