Travelled to:1 × France
1 × Germany
1 × Portugal
1 × Russia
1 × Spain
2 × Italy
2 × United Kingdom
4 × USA
Collaborated with:M.Sagiv E.Yahav H.Yang S.Sagiv O.Tripp T.W.Reps S.Itzhaky S.Grossman A.Gotsman H.Attiya G.Ramalingam R.Manevich B.Dogadov Omer Katz I.Filipovic P.W.O'Hearn M.T.Vechev D.F.Bacon G.Castelnuovo M.Naik S.Litvak N.Dor R.Bodík D.Amit A.Poetzsch-Heffter G.Ramalingam J.Bauer R.Wilhelm S.Cohen T.Kapus Oren Ish-Shalom C.Cadar A.Loginov S.Chandra S.Fink M.G.Nanda I.Abraham G.Golan-Gueta Yan Michalevsky Y.Zohar Elazar Gershuni N.Amit A.Gurfinkel N.Narodytska J.A.Navas L.Ryzhyk
Talks about:analysi (9) program (5) verifi (4) shape (4) abstract (3) concurr (3) interprocedur (2) procedur (2) modular (2) object (2)
Person: Noam Rinetzky
DBLP: Rinetzky:Noam
Contributed to:
2015
2013
2013
2010
20102009
2008
20072007
200720052005
20012016201720182019
2018Wrote 19 papers:
- SAS-2015-CastelnuovoNRSY #analysis #bottom-up #case study #composition #top-down
- Modularity in Lattices: A Case Study on the Correspondence Between Top-Down and Bottom-Up Analysis (GC, MN, NR, MS, HY), pp. 252–274.
- ESEC-FSE-2013-TrippR #adaptation #named #parallel
- Tightfit: adaptive parallelization with foresight (OT, NR), pp. 169–179.
- ESOP-2013-GotsmanRY #algorithm #concurrent #memory management #verification
- Verifying Concurrent Memory Reclamation Algorithms with Grace (AG, NR, HY), pp. 249–269.
- FSE-2010-LitvakDBRS #analysis #dependence
- Field-sensitive program dependence analysis (SL, ND, RB, NR, MS), pp. 287–296.
- POPL-2010-AttiyaRR #verification
- Sequential verification of serializability (HA, GR, NR), pp. 31–42.
- ESOP-2009-FilipovicORY #abstraction #concurrent
- Abstraction for Concurrent Objects (IF, PWO, NR, HY), pp. 252–266.
- ISSTA-2008-LoginovYCFRN #analysis #safety #verification
- Verifying dereference safety via expanding-scope analysis (AL, EY, SC, SF, NR, MGN), pp. 213–224.
- CAV-2007-AmitRRSY #abstraction #comparison #verification
- Comparison Under Abstraction for Verifying Linearizability (DA, NR, TWR, MS, EY), pp. 477–490.
- ESOP-2007-RinetzkyPRSY #analysis #composition #encapsulation #source code
- Modular Shape Analysis for Dynamically Encapsulated Programs (NR, APH, GR, MS, EY), pp. 220–236.
- PLDI-2007-VechevYBR #automation #concurrent #named
- CGCExplorer: a semi-automated search procedure for provably correct concurrent collectors (MTV, EY, DFB, NR), pp. 456–467.
- POPL-2005-RinetzkyBRSW #abstraction #semantics
- A semantics for procedure local heaps and its abstractions (NR, JB, TWR, SS, RW), pp. 296–309.
- SAS-2005-RinetzkySY #analysis #interprocedural #source code
- Interprocedural Shape Analysis for Cutpoint-Free Programs (NR, MS, EY), pp. 284–302.
- CC-2001-RinetzkyS #analysis #interprocedural #recursion #source code
- Interprocedural Shape Analysis for Recursive Programs (NR, SS), pp. 133–149.
- CAV-2016-ManevichDR #analysis #linear #termination
- From Shape Analysis to Termination Analysis in Linear Time (RM, BD, NR), pp. 426–446.
- CAV-2017-GrossmanCIRS #equivalence #source code #verification
- Verifying Equivalence of Spark Programs (SG, SC, SI, NR, MS), pp. 282–300.
- POPL-2018-GrossmanAGMRSZ #contract #detection #effectiveness #online
- Online detection of effectively callback free objects with applications to smart contracts (SG, IA, GGG, YM, NR, MS, YZ), p. 28.
- PLDI-2019-GershuniAGNNRRS #kernel #linux #precise #static analysis
- Simple and precise static analysis of untrusted Linux kernel extensions (EG, NA, AG, NN, JAN, NR, LR, MS), pp. 1069–1084.
- PLDI-2019-KapusIIRC #c #refactoring #string #summary #testing
- Computing summaries of string loops in C for better testing and refactoring (TK, OIS, SI, NR, CC), pp. 874–888.
- ASPLOS-2018-KatzRY #re-engineering #statistics
- Statistical Reconstruction of Class Hierarchies in Binaries (OK, NR, EY), pp. 363–376.