<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05275785</id>
  <dt>a</dt>
  <an>05275785</an>
  <augroup>
    <au>Gotsman, Alexey</au>
    <au>Berdine, Josh</au>
    <au>Cook, Byron</au>
    <au>Rinetzky, Noam</au>
    <au>Sagiv, Mooly</au>
  </augroup>
  <ti>Local reasoning for storable locks and threads.</ti>
  <so>Shao, Zhong (ed.), Programming languages and systems. 5th Asian symposium, APLAS 2007, Singapore, November 29--December 1, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-76636-0/pbk). Lecture Notes in Computer Science 4807, 19-37 (2007).</so>
  <py>2007</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-540-76637-7_3</li>
  </ligroup>
  <abgroup>
    <ab>Summary: We present a resource oriented program logic that is able to reason about concurrent heap-manipulating programs with unbounded numbers of dynamically-allocated locks and threads. The logic is inspired by concurrent separation logic, but handles these more realistic concurrency primitives. We demonstrate that the proposed logic allows local reasoning about programs for which there exists a notion of dynamic ownership of heap parts by locks and threads.</ab>
    <rv></rv>
  </abgroup>
</item>