- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c16 |      | Alexey Gotsman, Noam Rinetzky, Hongseok Yang: Verifying Concurrent Memory Reclamation Algorithms with Grace. ESOP 2013: 249-269 |
| 2010 | ||
| j2 | | Ivana Filipovic, Peter W. O'Hearn, Noam Rinetzky, Hongseok Yang: Abstraction for concurrent objects. Theor. Comput. Sci. 411(51-52): 4379-4398 (2010) |
| c15 | | Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev, Eran Yahav, Greta Yorsh: Verifying linearizability with hindsight. PODC 2010: 85-94 |
| c14 | | Hagit Attiya, G. Ramalingam, Noam Rinetzky: Sequential verification of serializability. POPL 2010: 31-42 |
| c13 | | Shay Litvak, Nurit Dor, Rastislav Bodík, Noam Rinetzky, Mooly Sagiv: Field-sensitive program dependence analysis. SIGSOFT FSE 2010: 287-296 |
| 2009 | ||
| c12 | | Ivana Filipovic, Peter W. O'Hearn, Noam Rinetzky, Hongseok Yang: Abstraction for Concurrent Objects. ESOP 2009: 252-266 |
| 2008 | ||
| j1 | | Noam Rinetzky, G. Ramalingam, Shmuel Sagiv, Eran Yahav: On the complexity of partially-flow-sensitive alias analysis. ACM Trans. Program. Lang. Syst. 30(3) (2008) |
| c11 | | Alexey Loginov, Eran Yahav, Satish Chandra, Stephen Fink, Noam Rinetzky, Mangala Gowri Nanda: Verifying dereference safety via expanding-scope analysis. ISSTA 2008: 213-224 |
| 2007 | ||
| c10 | | Alexey Gotsman, Josh Berdine, Byron Cook, Noam Rinetzky, Mooly Sagiv: Local Reasoning for Storable Locks and Threads. APLAS 2007: 19-37 |
| c9 | | Daphna Amit, Noam Rinetzky, Thomas W. Reps, Mooly Sagiv, Eran Yahav: Comparison Under Abstraction for Verifying Linearizability. CAV 2007: 477-490 |
| c8 | | Noam Rinetzky, Arnd Poetzsch-Heffter, Ganesan Ramalingam, Mooly Sagiv, Eran Yahav: Modular Shape Analysis for Dynamically Encapsulated Programs. ESOP 2007: 220-236 |
| c7 | | Martin T. Vechev, Eran Yahav, David F. Bacon, Noam Rinetzky: CGCExplorer: a semi-automated search procedure for provably correct concurrent collectors. PLDI 2007: 456-467 |
| 2005 | ||
| c6 | | Noam Rinetzky, Jörg Bauer, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm: A semantics for procedure local heaps and its abstractions. POPL 2005: 296-309 |
| c5 | | Noam Rinetzky, Mooly Sagiv, Eran Yahav: Interprocedural Shape Analysis for Cutpoint-Free Programs. SAS 2005: 284-302 |
| c4 | | Nurit Dor, John Field, Denis Gopan, Tal Lev-Ami, Alexey Loginov, Roman Manevich, G. Ramalingam, Thomas W. Reps, Noam Rinetzky, Mooly Sagiv, Reinhard Wilhelm, Eran Yahav, Greta Yorsh: Automatic Verification of Strongly Dynamic Software Systems. VSTTE 2005: 82-92 |
| 2003 | ||
| c3 | | Alain Azagury, Vladimir Dreizin, Michael Factor, Ealan Henis, Dalit Naor, Noam Rinetzky, Ohad Rodeh, Julian Satran, Ami Tavory, Lena Yerushalmi: Towards an Object Stor. IEEE Symposium on Mass Storage Systems 2003: 165- |
| 2002 | ||
| c2 | | Alain Azagury, Ran Canetti, Michael Factor, Shai Halevi, Ealan Henis, Dalit Naor, Noam Rinetzky, Ohad Rodeh, Julian Satran: A Two Layered Approach for Securing an Object Store Network. IEEE Security in Storage Workshop 2002: 10-23 |
| 2001 | ||
| c1 | | Noam Rinetzky, Shmuel Sagiv: Interprocedural Shape Analysis for Recursive Programs. CC 2001: 133-149 |
Colors in the list of coauthors
Last update Sun May 19 05:51:55 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page