Skip to main content
Conference ProceedingsOPEN ACCESS

Types for hierarchic shapes (summary)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 3924 LNCS 1-6
DOI: 10.1007/11693024_1
5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Heap entities tend to contain complex references to each other. To manage this complexity, types which express shapes and hierarchies have been suggested. We survey type systems which describe such hierarchic shapes, how these types are used for reasoning about programs, and applications in concurrent programming. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Drossopoulou, S., Clarke, D., & Noble, J. (2006). Types for hierarchic shapes (summary). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3924 LNCS, pp. 1–6). https://doi.org/10.1007/11693024_1

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