A Local Shape Analysis Based on Separation Logic

  • Dino Distefano
  • Peter W. O’Hearn
  • Hongseok Yang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3920)

Abstract

We describe a program analysis for linked list programs where the abstract domain uses formulae from separation logic.

References

  1. 1.
    Amtoft, T., Bandhakavi, S., Banerjee, A.: A logic for information flow analysis of pointer programs. In: 33rd POPL (2006) (to apppear)Google Scholar
  2. 2.
    Amtoft, T., Banerjee, A.: Information flow analysis in logical form. In: 11th Static Analysis Symposium. LNCS, vol. 3184, pp. 100–115 (2004)Google Scholar
  3. 3.
    Ball, T., Podelski, A., Rajamani, S.K.: Boolean and Cartesian abstraction for model checking C programs. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 268–283. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    Berdine, J., Calcagno, C., O’Hearn, P.: A decidable fragment of separation logic. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 97–109. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  5. 5.
    Berdine, J., Calcagno, C., O’Hearn, P.W.: Symbolic execution with separation logic. In: Yi, K. (ed.) APLAS 2005. LNCS, vol. 3780, pp. 52–68. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  6. 6.
    Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: 4th ACM Symposium on Principles of Programming Languages, pp. 238–252 (1977)Google Scholar
  7. 7.
    Distefano, D.: On model checking the dynamics of object-based software: a foundational approach. PhD thesis, University of Twente (2003)Google Scholar
  8. 8.
    Distefano, D., Rensink, A., Katoen, J.-P.: Who is pointing when to whom: on model-checking pointer structures. CTIT Technical Report TR-CTIT-03-12, Faculty of Informatics, University of Twente (March 2003)Google Scholar
  9. 9.
    Magill, S., Nanevski, A., Clarke, E., Lee, P.: Inferring invariants in Separation Logic for imperative list-processing programs. Draft (2005)Google Scholar
  10. 10.
    Manevich, R., Yahav, E., Ramalingam, G., Sagiv, S.: Predicate abstraction and canonical abstraction for singly-linked lists. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 181–198. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  11. 11.
    O’Hearn, P.: Resources, concurrency and local reasoning. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 49–67. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  12. 12.
    O’Hearn, P., Reynolds, J., Yang, H.: Local reasoning about programs that alter data structures. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, pp. 1–19. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  13. 13.
    O’Hearn, P.W., Yang, H., Reynolds, J.C.: Separation and information hiding. In: 31st POPL, pp. 268–280 (2004)Google Scholar
  14. 14.
    Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: 17th LICS, pp. 55–74 (2002)Google Scholar
  15. 15.
    Rinetzky, N., Bauer, J., Reps, T., Sagiv, S., Wilhelm, R.: A semantics for procedure local heaps and its abstractions. In: 32nd POPL, pp. 296–309 (2005)Google Scholar
  16. 16.
    Rinetzky, N., Sagiv, M., Yahav, E.: Interprocedural shape analysis for cutpoint-free programs. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol. 3672, pp. 284–302. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  17. 17.
    Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3valued logic. ACM Trans. Program. Lang. Syst. 24(3), 217–298 (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Dino Distefano
    • 1
  • Peter W. O’Hearn
    • 1
  • Hongseok Yang
    • 2
  1. 1.Queen MaryUniversity of LondonUK
  2. 2.Seoul National UniversitySouth Korea

Personalised recommendations