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

  • Christopher L. Conway
  • Dennis Dams
  • Kedar S. Namjoshi
  • Clark Barrett
Conference paper

DOI: 10.1007/978-3-540-69166-2_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5079)
Cite this paper as:
Conway C.L., Dams D., Namjoshi K.S., Barrett C. (2008) Pointer Analysis, Conditional Soundness, and Proving the Absence of Errors. In: Alpuente M., Vidal G. (eds) Static Analysis. SAS 2008. Lecture Notes in Computer Science, vol 5079. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Christopher L. Conway
    • 1
  • Dennis Dams
    • 2
  • Kedar S. Namjoshi
    • 2
  • Clark Barrett
    • 1
  1. 1.Dept. of Computer ScienceNew York University 
  2. 2.Bell Laboratories, Alcatel-Lucent 

Personalised recommendations