| Abstraction for concurrent objects I Filipović, P O’Hearn, N Rinetzky, H Yang Theoretical Computer Science 411 (51-52), 4379-4398, 2010 | 175 | 2010 |
| Local reasoning for storable locks and threads A Gotsman, J Berdine, B Cook, N Rinetzky, M Sagiv Asian Symposium on Programming Languages And Systems, 19-37, 2007 | 148 | 2007 |
| A semantics for procedure local heaps and its abstractions N Rinetzky, J Bauer, T Reps, M Sagiv, R Wilhelm ACM SIGPLAN Notices 40 (1), 296-309, 2005 | 148 | 2005 |
| Towards an object store A Azagury, V Dreizin, M Factor, E Henis, D Naor, N Rinetzky, O Rodeh, ... 20th IEEE/11th NASA Goddard Conference on Mass Storage Systems and …, 2003 | 134 | 2003 |
| Comparison under abstraction for verifying linearizability D Amit, N Rinetzky, T Reps, M Sagiv, E Yahav International Conference on Computer Aided Verification, 477-490, 2007 | 129 | 2007 |
| Abstraction for concurrent objects I Filipović, P O’Hearn, N Rinetzky, H Yang Theoretical Computer Science 411 (51-52), 4379-4398, 2010 | 128 | 2010 |
| Online detection of effectively callback free objects with applications to smart contracts S Grossman, I Abraham, G Golan-Gueta, Y Michalevsky, N Rinetzky, ... Proceedings of the ACM on Programming Languages 2 (POPL), 1-28, 2017 | 102 | 2017 |
| Interprocedural shape analysis for cutpoint-free programs N Rinetzky, M Sagiv, E Yahav International Static Analysis Symposium, 284-302, 2005 | 98 | 2005 |
| Interprocedural shape analysis for recursive programs N Rinetzky, M Sagiv International Conference on Compiler Construction, 133-149, 2001 | 88 | 2001 |
| Verifying linearizability with hindsight PW O'Hearn, N Rinetzky, MT Vechev, E Yahav, G Yorsh Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of …, 2010 | 69 | 2010 |
| A two layered approach for securing an object store network A Azagury, R Canetti, M Factor, S Halevi, E Henis, D Naor, N Rinetzky, ... First International IEEE Security in Storage Workshop, 2002. Proceedings., 10-23, 2002 | 52 | 2002 |
| Verifying dereference safety via expanding-scope analysis A Loginov, E Yahav, S Chandra, S Fink, N Rinetzky, M Nanda Proceedings of the 2008 international symposium on Software testing and …, 2008 | 50 | 2008 |
| Property-directed inference of universal invariants or proving their absence A Karbyshev, N Bjørner, S Itzhaky, N Rinetzky, S Shoham Journal of the ACM (JACM) 64 (1), 1-33, 2017 | 48 | 2017 |
| Chopped symbolic execution D Trabish, A Mattavelli, N Rinetzky, C Cadar Proceedings of the 40th International Conference on Software Engineering …, 2018 | 39 | 2018 |
| Verifying concurrent memory reclamation algorithms with grace A Gotsman, N Rinetzky, H Yang European Symposium on Programming, 249-269, 2013 | 37 | 2013 |
| Cgcexplorer: a semi-automated search procedure for provably correct concurrent collectors MT Vechev, E Yahav, DF Bacon, N Rinetzky Proceedings of the 28th ACM SIGPLAN Conference on Programming Language …, 2007 | 31 | 2007 |
| A programming language perspective on transactional memory consistency H Attiya, A Gotsman, S Hans, N Rinetzky Proceedings of the 2013 ACM symposium on Principles of distributed computing …, 2013 | 28 | 2013 |
| Safety of live transactions in transactional memory: TMS is necessary and sufficient H Attiya, A Gotsman, S Hans, N Rinetzky International Symposium on Distributed Computing, 376-390, 2014 | 24 | 2014 |
| Sequential verification of serializability H Attiya, G Ramalingam, N Rinetzky ACM Sigplan Notices 45 (1), 31-42, 2010 | 23 | 2010 |
| Modular shape analysis for dynamically encapsulated programs N Rinetzky, A Poetzsch-Heffter, G Ramalingam, M Sagiv, E Yahav European Symposium on Programming, 220-236, 2007 | 23 | 2007 |
