Skip to main content
Conference ProceedingsOPEN ACCESS

Reasoning about lock placements

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7211 LNCS 336-356
DOI: 10.1007/978-3-642-28869-2_17
5Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A lock placement describes, for each heap location, which lock guards the location, and under what circumstances. We formalize methods for reasoning about lock placements, making precise the interactions between the program, the heap structure, and the lock placement. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Hawkins, P., Aiken, A., Fisher, K., Rinard, M., & Sagiv, M. (2012). Reasoning about lock placements. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7211 LNCS, pp. 336–356). https://doi.org/10.1007/978-3-642-28869-2_17

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