Noam Rinetzky
Noam Rinetzky
Assistant Professor of Computer Science, Tel Aviv University
Verified email at cs.tau.ac.il - Homepage
Title
Cited by
Cited by
Year
Abstraction for concurrent objects
I Filipović, P O’Hearn, N Rinetzky, H Yang
Theoretical Computer Science 411 (51-52), 4379-4398, 2010
1722010
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
1452005
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
1412007
Abstraction for concurrent objects
I Filipović, P O’Hearn, N Rinetzky, H Yang
Theoretical Computer Science 411 (51-52), 4379-4398, 2010
1262010
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
1262007
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
1202003
Interprocedural shape analysis for cutpoint-free programs
N Rinetzky, M Sagiv, E Yahav
International Static Analysis Symposium, 284-302, 2005
932005
Interprocedural shape analysis for recursive programs
N Rinetzky, M Sagiv
International Conference on Compiler Construction, 133-149, 2001
882001
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
832017
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
672010
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
492002
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
462008
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
422017
Verifying concurrent memory reclamation algorithms with grace
A Gotsman, N Rinetzky, H Yang
European Symposium on Programming, 249-269, 2013
362013
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
322007
Chopped symbolic execution
D Trabish, A Mattavelli, N Rinetzky, C Cadar
Proceedings of the 40th International Conference on Software Engineering …, 2018
282018
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
272013
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
242007
Modular verification of concurrency-aware linearizability
N Hemed, N Rinetzky, V Vafeiadis
International Symposium on Distributed Computing, 371-387, 2015
232015
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
232014
The system can't perform the operation now. Try again later.
Articles 1–20