Ori Lahav

Cited by

	All	Since 2018
Citations	1971	1635
h-index	21	19
i10-index	36	31

340

170

255

2013201420152016201720182019202020212022202335 31 30 66 146 197 280 181 336 337 301

Public access

View all

30 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Viktor VafeiadisMax Planck Institute for Software Systems (MPI-SWS), Saarland Informatics Campus (SIC)Verified email at mpi-sws.org
Chung-Kil HurSeoul National UniversityVerified email at sf.snu.ac.kr
Anton PodkopaevJetBrains Research, Constructor University BremenVerified email at jetbrains.com
Azalea RaadImperial College LondonVerified email at imperial.ac.uk
Derek DreyerMax Planck Institute for Software Systems (MPI-SWS), Saarland Informatics CampusVerified email at mpi-sws.org
Jeehoon KangAssistant Professor of KAIST School of ComputingVerified email at kaist.ac.kr
Yoni ZoharBar Ilan UniversityVerified email at biu.ac.il
Mooly SagivTel Aviv UniversityVerified email at acm.org
Anna ZamanskyAssociate Professor, Information Systems Dept. University of HaifaVerified email at is.haifa.ac.il
Sung-Hwan LeeRebellions Inc.Verified email at rebellions.ai
Minki ChoPh.D. Student, Seoul National UniversityVerified email at sf.snu.ac.kr
Aurojit PandaNYUVerified email at cs.nyu.edu
Katerina ArgyrakiAssociate Professor at the School of Computer and Communication Sciences, EPFL, SwitzerlandVerified email at epfl.ch
Scott ShenkerProfessor of Computer Science, UC BerkeleyVerified email at icsi.berkeley.edu
Michalis KokologiannakisMax Planck Institute for Software Systems (MPI-SWS)Verified email at mpi-sws.org
Hai DangBedRock Systems. IncVerified email at mpi-sws.org
Brijesh DongolUniversity of SurreyVerified email at surrey.ac.uk
Artem KhyzhaArmVerified email at arm.com
Udi BokerComputer Science, Reichman University, Herzliya, IsraelVerified email at idc.ac.il
Neil ImmermanCollege of Computer and Information Sciences, UMass, AmherstVerified email at cs.umass.edu

Ori Lahav

Tel Aviv University

Verified email at tau.ac.il - Homepage

Concurrency Relaxed Memory Models Programming Languages Program Analysis and Verification Logic


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Repairing sequential consistency in C/C++11 O Lahav, V Vafeiadis, J Kang, CK Hur, D Dreyer PLDI 2017, 618-632, 2017	213	2017
A promising semantics for relaxed-memory concurrency J Kang, CK Hur, O Lahav, V Vafeiadis, D Dreyer POPL 2017, 175-189, 2017	200	2017
Verifying reachability in networks with mutable datapaths A Panda, O Lahav, K Argyraki, M Sagiv, S Shenker NSDI 2017, 2017	142*	2017
Effective stateless model checking for C/C++ concurrency M Kokologiannakis, O Lahav, K Sagonas, V Vafeiadis Proceedings of the ACM on Programming Languages 2 (POPL 2018), 2017	133	2017
Strong logic for weak memory: reasoning about release-acquire consistency in Iris JO Kaiser, HH Dang, D Dreyer, O Lahav, V Vafeiadis ECOOP 2017, 2017	128	2017
Taming release-acquire consistency O Lahav, N Giannarakis, V Vafeiadis POPL 2016, 649-662, 2016	125	2016
Owicki-Gries reasoning for weak memory models O Lahav, V Vafeiadis ICALP 2015, 311-323, 2015	109	2015
Bridging the gap between programming languages and hardware weak memory models A Podkopaev, O Lahav, V Vafeiadis Proceedings of the ACM on Programming Languages 3 (POPL), 1-31, 2019	76	2019
From frame properties to hypersequent rules in modal logics O Lahav LICS 2013, 408-417, 2013	57	2013
A separation logic for a promising semantics K Svendsen, J Pichon-Pharabod, M Doko, O Lahav, V Vafeiadis ESOP 2018, 357-384, 2018	54	2018
Promising 2.0: global optimizations in relaxed memory concurrency SH Lee, M Cho, A Podkopaev, S Chakraborty, CK Hur, O Lahav, ... Proceedings of the 41st ACM SIGPLAN Conference on Programming Language …, 2020	51	2020
Explaining relaxed memory models with program transformations O Lahav, V Vafeiadis FM 2016, 479-495, 2016	47	2016
Modular reasoning about heap paths via effectively propositional formulas S Itzhaky, A Banerjee, N Immerman, O Lahav, A Nanevski, M Sagiv POPL 2014, 385-396, 2014	41	2014
On library correctness under weak memory consistency: Specifying and verifying concurrent libraries under declarative consistency models A Raad, M Doko, L Rožić, O Lahav, V Vafeiadis Proceedings of the ACM on Programming Languages 3 (POPL), 1-31, 2019	39	2019
Finite-valued semantics for canonical labelled calculi M Baaz, O Lahav, A Zamansky Journal of Automated Reasoning 51 (4), 401-430, 2013	38	2013
Decentralizing SDN policies O Padon, N Immerman, A Karbyshev, O Lahav, M Sagiv, S Shoham POPL 2015, 663-676, 2015	36	2015
A unified semantic framework for fully structural propositional sequent systems O Lahav, A Avron ACM Transactions on Computational Logic (TOCL) 14 (4), 1-33, 2013	36	2013
Robustness against release/acquire semantics O Lahav, R Margalit Proceedings of the 40th ACM SIGPLAN Conference on Programming Language …, 2019	29	2019
Decidable verification under a causally consistent shared memory O Lahav, U Boker Proceedings of the 41st ACM SIGPLAN Conference on Programming Language …, 2020	27	2020
Taming x86-TSO persistency A Khyzha, O Lahav Proceedings of the ACM on Programming Languages 5 (POPL), 1-29, 2021	23*	2021

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors