default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNoam Rinetzky
Person information
- affiliation: Tel Aviv University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Elvira Albert, Shelly Grossman, Noam Rinetzky, Clara Rodríguez-Núñez
, Albert Rubio, Mooly Sagiv:
Relaxed Effective Callback Freedom: A Parametric Correctness Condition for Sequential Modules With Callbacks. IEEE Trans. Dependable Secur. Comput. 20(3): 2256-2273 (2023)- [c50]David Trabish, Noam Rinetzky, Sharon Shoham, Vaibhav Sharma:
State Merging with Quantifiers in Symbolic Execution. ESEC/SIGSOFT FSE 2023: 1140-1152 - [i10]David Trabish, Noam Rinetzky, Sharon Shoham, Vaibhav Sharma:
State Merging with Quantifiers in Symbolic Execution. CoRR abs/2308.12068 (2023) - 2022
- [j9]Oren Ish-Shalom, Shachar Itzhaky, Noam Rinetzky, Sharon Shoham:
Runtime Complexity Bounds Using Squeezers. ACM Trans. Program. Lang. Syst. 44(3): 17:1-17:36 (2022) - 2021
- [c49]Oren Ish-Shalom, Shachar Itzhaky, Noam Rinetzky, Sharon Shoham:
Run-time Complexity Bounds Using Squeezers. ESOP 2021: 320-347 - [c48]David Trabish, Shachar Itzhaky, Noam Rinetzky:
Address-Aware Query Caching for Symbolic Execution. ICST 2021: 116-126 - [c47]David Trabish, Shachar Itzhaky, Noam Rinetzky:
A bounded symbolic-size model for symbolic execution. ESEC/SIGSOFT FSE 2021: 1190-1201 - [i9]Oren Ish-Shalom, Shachar Itzhaky, Noam Rinetzky, Sharon Shoham:
Putting the Squeeze on Array Programs: Loop Verification via Inductive Rank Reduction. CoRR abs/2106.00937 (2021) - 2020
- [j8]Bor-Yuh Evan Chang, Cezara Dragoi, Roman Manevich, Noam Rinetzky, Xavier Rival:
Shape Analysis. Found. Trends Program. Lang. 6(1-2): 1-158 (2020) - [j7]Yotam M. Y. Feldman, Artem Khyzha, Constantin Enea, Adam Morrison, Aleksandar Nanevski, Noam Rinetzky, Sharon Shoham:
Proving highly-concurrent traversals correct. Proc. ACM Program. Lang. 4(OOPSLA): 128:1-128:29 (2020) - [j6]Elvira Albert, Shelly Grossman, Noam Rinetzky, Clara Rodríguez-Núñez, Albert Rubio, Mooly Sagiv:
Taming callbacks for smart contract modularity. Proc. ACM Program. Lang. 4(OOPSLA): 209:1-209:30 (2020) - [c46]David Trabish, Noam Rinetzky:
Relocatable addressing model for symbolic execution. ISSTA 2020: 51-62 - [c45]David Trabish, Timotej Kapus, Noam Rinetzky, Cristian Cadar:
Past-sensitive pointer analysis for symbolic execution. ESEC/SIGSOFT FSE 2020: 197-208 - [c44]Oren Ish-Shalom, Shachar Itzhaky, Noam Rinetzky, Sharon Shoham:
Putting the Squeeze on Array Programs: Loop Verification via Inductive Rank Reduction. VMCAI 2020: 112-135 - [c43]Oren Ish-Shalom, Shachar Itzhaky, Roman Manevich, Noam Rinetzky:
Harnessing Static Analysis to Help Learn Pseudo-Inverses of String Manipulating Procedures for Automatic Test Generation. VMCAI 2020: 180-201 - [i8]Daniel Deutch, Yuval Moskovitch, Noam Rinetzky:
COBRA: Compression via Abstraction of Provenance for Hypothetical Reasoning. CoRR abs/2007.05389 (2020) - [i7]Daniel Deutch, Yuval Moskovitch, Noam Rinetzky:
Hypothetical Reasoning via Provenance Abstraction. CoRR abs/2007.05400 (2020) - [i6]Suvam Mukherjee, Oded Padon, Sharon Shoham, Deepak D'Souza, Noam Rinetzky:
A Thread-Local Semantics and Efficient Static Analyses for Race Free Programs. CoRR abs/2009.02775 (2020) - [i5]Yotam M. Y. Feldman, Artem Khyzha, Constantin Enea, Adam Morrison, Aleksandar Nanevski, Noam Rinetzky, Sharon Shoham:
Proving Highly-Concurrent Traversals Correct. CoRR abs/2010.00911 (2020)
2010 – 2019
- 2019
- [c42]Daniel Deutch, Yuval Moskovitch, Noam Rinetzky:
COBRA: Compression Via Abstraction of Provenance for Hypothetical Reasoning. ICDE 2019: 2016-2019 - [c41]Timotej Kapus, Oren Ish-Shalom, Shachar Itzhaky, Noam Rinetzky, Cristian Cadar:
Computing summaries of string loops in C for better testing and refactoring. PLDI 2019: 874-888 - [c40]Elazar Gershuni, Nadav Amit, Arie Gurfinkel, Nina Narodytska, Jorge A. Navas, Noam Rinetzky, Leonid Ryzhyk, Mooly Sagiv:
Simple and precise static analysis of untrusted Linux kernel extensions. PLDI 2019: 1069-1084 - [c39]Daniel Deutch, Yuval Moskovitch, Noam Rinetzky:
Hypothetical Reasoning via Provenance Abstraction. SIGMOD Conference 2019: 537-554 - 2018
- [j5]Hagit Attiya, Alexey Gotsman, Sandeep Hans, Noam Rinetzky:
Characterizing Transactional Memory Consistency Conditions Using Observational Refinement. J. ACM 65(1): 2:1-2:44 (2018) - [j4]Shelly Grossman, Ittai Abraham, Guy Golan-Gueta, Yan Michalevsky, Noam Rinetzky, Mooly Sagiv, Yoni Zohar:
Online detection of effectively callback free objects with applications to smart contracts. Proc. ACM Program. Lang. 2(POPL): 48:1-48:28 (2018) - [c38]Omer Katz, Noam Rinetzky, Eran Yahav:
Statistical Reconstruction of Class Hierarchies in Binaries. ASPLOS 2018: 363-376 - [c37]Daniel Deutch, Yuval Moskovitch, Itay Polak, Noam Rinetzky:
Towards Hypothetical Reasoning Using Distributed Provenance. EDBT 2018: 461-464 - [c36]David Trabish, Andrea Mattavelli, Noam Rinetzky, Cristian Cadar:
Chopped symbolic execution. ICSE 2018: 350-360 - [c35]Artem Khyzha, Hagit Attiya, Alexey Gotsman, Noam Rinetzky:
Safe privatization in transactional memory. PPoPP 2018: 233-245 - [c34]Yotam M. Y. Feldman, Constantin Enea, Adam Morrison, Noam Rinetzky, Sharon Shoham:
Order out of Chaos: Proving Linearizability Using Local Views. DISC 2018: 23:1-23:21 - [i4]Shelly Grossman, Ittai Abraham, Guy Golan-Gueta, Yan Michalevsky, Noam Rinetzky, Mooly Sagiv, Yoni Zohar:
Online Detection of Effectively Callback Free Objects with Applications to Smart Contracts. CoRR abs/1801.04032 (2018) - [i3]Artem Khyzha, Hagit Attiya, Alexey Gotsman, Noam Rinetzky:
Safe Privatization in Transactional Memory. CoRR abs/1801.04249 (2018) - [i2]Yotam M. Y. Feldman, Constantin Enea, Adam Morrison, Noam Rinetzky, Sharon Shoham:
Order out of Chaos: Proving Linearizability Using Local Views. CoRR abs/1805.03992 (2018) - 2017
- [j3]Aleksandr Karbyshev, Nikolaj S. Bjørner, Shachar Itzhaky, Noam Rinetzky, Sharon Shoham:
Property-Directed Inference of Universal Invariants or Proving Their Absence. J. ACM 64(1): 7:1-7:33 (2017) - [c33]Shelly Grossman, Sara Cohen, Shachar Itzhaky, Noam Rinetzky, Mooly Sagiv:
Verifying Equivalence of Spark Programs. CAV (2) 2017: 282-300 - [c32]Suvam Mukherjee, Oded Padon, Sharon Shoham, Deepak D'Souza, Noam Rinetzky:
RATCOP: Relational Analysis Tool for Concurrent Programs. Haifa Verification Conference 2017: 229-233 - [c31]Shachar Itzhaky, Tomer Kotek, Noam Rinetzky, Mooly Sagiv, Orr Tamir, Helmut Veith, Florian Zuleger:
On the Automated Verification of Web Applications with Embedded SQL. ICDT 2017: 16:1-16:18 - [c30]Suvam Mukherjee, Oded Padon, Sharon Shoham, Deepak D'Souza, Noam Rinetzky:
Thread-Local Semantics and Its Efficient Sequential Abstractions for Race-Free Programs. SAS 2017: 253-276 - [c29]Or Ozeri, Oded Padon, Noam Rinetzky, Mooly Sagiv:
Conjunctive Abstract Interpretation Using Paramodulation. VMCAI 2017: 442-461 - 2016
- [c28]Roman Manevich, Boris Dogadov, Noam Rinetzky:
From Shape Analysis to Termination Analysis in Linear Time. CAV (1) 2016: 426-446 - [c27]Noam Rinetzky, Sharon Shoham:
Property Directed Abstract Interpretation. VMCAI 2016: 104-123 - [i1]Shachar Itzhaky, Tomer Kotek, Noam Rinetzky, Mooly Sagiv, Orr Tamir, Helmut Veith, Florian Zuleger:
On the automated verification of web applications with embedded SQL. CoRR abs/1610.02101 (2016) - 2015
- [c26]Aleksandr Karbyshev, Nikolaj S. Bjørner, Shachar Itzhaky, Noam Rinetzky, Sharon Shoham:
Property-Directed Inference of Universal Invariants or Proving Their Absence. CAV (1) 2015: 583-602 - [c25]Yuri Meshman, Noam Rinetzky, Eran Yahav:
Pattern-based Synthesis of Synchronization for the C++ Memory Model. FMCAD 2015: 120-127 - [c24]Orr Tamir, Adam Morrison, Noam Rinetzky:
A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms. OPODIS 2015: 15:1-15:16 - [c23]Ghila Castelnuovo, Mayur Naik, Noam Rinetzky, Mooly Sagiv, Hongseok Yang:
Modularity in Lattices: A Case Study on the Correspondence Between Top-Down and Bottom-Up Analysis. SAS 2015: 252-274 - [c22]Nir Hemed, Noam Rinetzky, Viktor Vafeiadis:
Modular Verification of Concurrency-Aware Linearizability. DISC 2015: 371-387 - 2014
- [c21]Nir Hemed, Noam Rinetzky:
Brief announcement: concurrency-aware linearizability. PODC 2014: 209-211 - [c20]Hagit Attiya, Alexey Gotsman, Sandeep Hans, Noam Rinetzky:
Safety of Live Transactions in Transactional Memory: TMS is Necessary and Sufficient. DISC 2014: 376-390 - 2013
- [c19]Jörg Kreiker, Thomas W. Reps, Noam Rinetzky, Mooly Sagiv, Reinhard Wilhelm, Eran Yahav:
Interprocedural Shape Analysis for Effectively Cutpoint-Free Programs. Programming Logics 2013: 414-445 - [c18]Alexey Gotsman, Noam Rinetzky, Hongseok Yang:
Verifying Concurrent Memory Reclamation Algorithms with Grace. ESOP 2013: 249-269 - [c17]Hagit Attiya, Alexey Gotsman, Sandeep Hans, Noam Rinetzky:
A programming language perspective on transactional memory consistency. PODC 2013: 309-318 - [c16]Omer Tripp, Noam Rinetzky:
Tightfit: adaptive parallelization with foresight. ESEC/SIGSOFT FSE 2013: 169-179 - 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
2000 – 2009
- 2009
- [c12]Ivana Filipovic, Peter W. O'Hearn, Noam Rinetzky, Hongseok Yang:
Abstraction for Concurrent Objects. ESOP 2009: 252-266 - 2008
- [b1]Noam Rinetzky:
Interprocedural and modular local heap shape analysis. Tel Aviv University, Israel, 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): 13:1-13:28 (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
Coauthor Index
aka: Mooly Sagiv
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
