Cristiano Calcagno, Hongseok Yang, Peter W. O Hearn. Computability and Complexity Results for a Spatial Assertion Language for Data Structures. In Ramesh Hariharan, Madhavan Mukund, V. Vinay, editors, FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings. Volume 2245 of Lecture Notes in Computer Science, pages 108-119, Springer, 2001. [doi]
@inproceedings{CalcagnoYO01:0,
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},
url = {http://link.springer.de/link/service/series/0558/bibs/2245/22450108.htm},
tags = {data-flow language, data-flow},
researchr = {https://researchr.org/publication/CalcagnoYO01%3A0},
cites = {0},
citedby = {0},
pages = {108-119},
booktitle = {FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings},
editor = {Ramesh Hariharan and Madhavan Mukund and V. Vinay},
volume = {2245},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-43002-4},
}