Searching for authors named "Noam Rinetzky" – sorted by Relevance.
-
Interprocedural Shape Analysis for Recursive Programs
- Interprocedural Shape Analysis for Recursive Programs Noam Rinetzky ?1 and Mooly Sagiv 2 1
- Cited by 24 (6 self) – Add To MetaCart
-
Abstraction for Concurrent Objects ⋆
- Abstraction for Concurrent Objects ⋆ Ivana Filipović, Peter O’Hearn, Noam Rinetzky, and Hongseok
- Add To MetaCart
-
Interprocedural shape analysis for cutpoint-free programs
- Interprocedural Shape Analysis for Cutpoint-Free Programs Noam Rinetzky 1⋆ , Mooly Sagiv 1
- Cited by 24 (5 self) – Add To MetaCart
-
Comparison under abstraction for verifying linearizability
- Comparison Under Abstraction for Verifying Linearizability Daphna Amit 1,⋆ , Noam Rinetzky 1
- Cited by 8 (4 self) – Add To MetaCart
-
Interprocedural functional shape analysis using local heaps
- Interprocedural Functional Shape Analysis using Local Heaps Noam Rinetzky Tel Aviv University maon
- Cited by 4 (0 self) – Add To MetaCart
-
A semantics for procedure local heaps and its abstractions
- A Semantics for Procedure Local Heaps and its Abstractions Noam Rinetzky ∗ Jörg Bauer † Thomas
- Cited by 35 (9 self) – Add To MetaCart
-
Local reasoning for storable locks and threads
- , Noam Rinetzky 3,⋆ , and Mooly Sagiv 2,3 1 University of Cambridge 2 Microsoft Research 3 Tel
- Cited by 7 (1 self) – Add To MetaCart
-
Interprocedural Shape Analysis
- for the degree of Master of Science in Computer Science Noam Rinetzky Submitted to the Senate of the Technion
- Cited by 6 (2 self) – Add To MetaCart
-
Verifying Optimistic Algorithms Should be Easy (Position Paper)
- Verifying Optimistic Algorithms Should be Easy (Position Paper) Noam Rinetzky Martin T. Vechev
- Add To MetaCart
-
A Semantics for Procedure Local Heaps
- A Semantics for Procedure Local Heaps and its Abstractions Noam Rinetzky ∗ Jörg Bauer † Thomas
- Add To MetaCart

