( en | de | ru )

 

Disambiguation of "Rinetzky, Noam"

Author of the publication

copydeleteadd this publication to your clipboard
Local Reasoning for Storable Locks and Threads.

, , , , and . APLAS, volume 4807 of Lecture Notes in Computer Science, page 19-37. Springer, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Noam Pilpel

 

Other publications of authors with the same name

Hypothetical Reasoning via Provenance Abstraction., , and . CoRR, (2020)Online detection of effectively callback free objects with applications to smart contracts., , , , , , and . Proc. ACM Program. Lang., 2 (POPL): 48:1-48:28 (2018)Proving highly-concurrent traversals correct., , , , , , and . Proc. ACM Program. Lang., 4 (OOPSLA): 128:1-128:29 (2020)Hypothetical Reasoning via Provenance Abstraction., , and . SIGMOD Conference, page 537-554. ACM, (2019)Safety of Live Transactions in Transactional Memory: TMS is Necessary and Sufficient., , , and . DISC, volume 8784 of Lecture Notes in Computer Science, page 376-390. Springer, (2014)Modularity in Lattices: A Case Study on the Correspondence Between Top-Down and Bottom-Up Analysis., , , , and . SAS, volume 9291 of Lecture Notes in Computer Science, page 252-274. Springer, (2015)A programming language perspective on transactional memory consistency., , , and . PODC, page 309-318. ACM, (2013)Verifying Concurrent Memory Reclamation Algorithms with Grace., , and . ESOP, volume 7792 of Lecture Notes in Computer Science, page 249-269. Springer, (2013)Safe privatization in transactional memory., , , and . PPoPP, page 233-245. ACM, (2018)Brief announcement: concurrency-aware linearizability., and . PODC, page 209-211. ACM, (2014)