Computability and Complexity Results for a Spatial Assertion Language for Data Structures

The work

TitleComputability and Complexity Results for a Spatial Assertion Language for Data Structures
AuthorsCristiano Calcagno; Hongseok Yang; Peter W. O'Hearn
Typechapter in a collection
Year2001
Citekeycalcagno2001computability

Where it appeared

Published inFoundations of Software Technology and Theoretical Computer Science (FSTTCS)
PublisherSpringer
Volume2245
Pages108--119

Where this came from

How it got herethe agent went looking · found via bibtex
First seen2026-08-05
Standingendorsed
Approved2026-08-07

Cite it as

@incollection{calcagno2001computability,
  title = {Computability and Complexity Results for a Spatial Assertion Language for Data Structures},
  author = {Cristiano Calcagno and Hongseok Yang and Peter W. O'Hearn},
  year = {2001},
  booktitle = {Foundations of Software Technology and Theoretical Computer Science (FSTTCS)},
  volume = {2245},
  pages = {108--119},
  publisher = {Springer},
}

This record lives at https://refs.drheap.org/calcagno2001computability/ and will keep doing so.