Footprint Analysis: A Shape Analysis That Discovers Preconditions

  • Cristiano Calcagno
  • Dino Distefano
  • Peter W. O’Hearn
  • Hongseok Yang
Conference paper

DOI: 10.1007/978-3-540-74061-2_25

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4634)
Cite this paper as:
Calcagno C., Distefano D., O’Hearn P.W., Yang H. (2007) Footprint Analysis: A Shape Analysis That Discovers Preconditions. In: Nielson H.R., Filé G. (eds) Static Analysis. SAS 2007. Lecture Notes in Computer Science, vol 4634. Springer, Berlin, Heidelberg

Abstract

Existing shape analysis algorithms infer descriptions of data structures at program points, starting from a given precondition. We describe an analysis that does not require any preconditions. It works by attempting to infer a description of only the cells that might be accessed, following the footprint idea in separation logic. The analysis allows us to establish a true Hoare triple for a piece of code, independently of the context in which it occurs and without a whole-program analysis. We present experimental results for a range of typical list-processing algorithms, as well as for code fragments from a Windows device driver.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Cristiano Calcagno
    • 1
  • Dino Distefano
    • 2
  • Peter W. O’Hearn
    • 2
  • Hongseok Yang
    • 2
  1. 1.Imperial College, London 
  2. 2.Queen Mary, University of London 

Personalised recommendations