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

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]

Authors

Cristiano Calcagno

This author has not been identified. Look up 'Cristiano Calcagno' in Google

Hongseok Yang

This author has not been identified. Look up 'Hongseok Yang' in Google

Peter W. O Hearn

This author has not been identified. Look up 'Peter W. O Hearn' in Google