Skip to main content
Conference ProceedingsOPEN ACCESS

A local shape analysis based on separation logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 3920 LNCS 287-302
DOI: 10.1007/11691372_19
213Citations
Citations of this article
87Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We describe a program analysis for linked list programs where the abstract domain uses formulae from separation logic. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Distefano, D., O’Hearn, P. W., & Yang, H. (2006). A local shape analysis based on separation logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3920 LNCS, pp. 287–302). https://doi.org/10.1007/11691372_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free