Noam Rinetzky
Noam Rinetzky
Assistant Professor of Computer Science, Tel Aviv University
Verified email at - Homepage
Cited by
Cited by
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
Abstraction for concurrent objects
I Filipović, P O’Hearn, N Rinetzky, H Yang
Theoretical Computer Science 411 (51-52), 4379-4398, 2010
Local reasoning for storable locks and threads
A Gotsman, J Berdine, B Cook, N Rinetzky, M Sagiv
Programming Languages and Systems: 5th Asian Symposium, APLAS 2007 …, 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
Comparison under abstraction for verifying linearizability
D Amit, N Rinetzky, T Reps, M Sagiv, E Yahav
Computer Aided Verification: 19th International Conference, CAV 2007, Berlin …, 2007
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
Chopped symbolic execution
D Trabish, A Mattavelli, N Rinetzky, C Cadar
Proceedings of the 40th International Conference on Software Engineering …, 2018
Interprocedural shape analysis for recursive programs
N Rinetzky, M Sagiv
International Conference on Compiler Construction, 133-149, 2001
Interprocedural shape analysis for cutpoint-free programs
N Rinetzky, M Sagiv, E Yahav
Static Analysis: 12th International Symposium, SAS 2005, London, UK …, 2005
Simple and precise static analysis of untrusted linux kernel extensions
E Gershuni, N Amit, A Gurfinkel, N Narodytska, JA Navas, N Rinetzky, ...
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language …, 2019
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
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
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
Verifying concurrent memory reclamation algorithms with grace
A Gotsman, N Rinetzky, H Yang
Programming Languages and Systems: 22nd European Symposium on Programming …, 2013
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
Modular verification of concurrency-aware linearizability
N Hemed, N Rinetzky, V Vafeiadis
Distributed Computing: 29th International Symposium, DISC 2015, Tokyo, Japan …, 2015
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
Taming callbacks for smart contract modularity
E Albert, S Grossman, N Rinetzky, C Rodríguez-Núñez, A Rubio, M Sagiv
Proceedings of the ACM on Programming Languages 4 (OOPSLA), 1-30, 2020
Verifying equivalence of spark programs
S Grossman, S Cohen, S Itzhaky, N Rinetzky, M Sagiv
Computer Aided Verification: 29th International Conference, CAV 2017 …, 2017
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
The system can't perform the operation now. Try again later.
Articles 1–20