Ori Lahav

Cited by

	All	Since 2019
Citations	2381	1837
h-index	24	22
i10-index	43	37

400

200

100

300

20132014201520162017201820192020202120222023202425 41 30 66 148 196 288 190 332 353 290 381

Public access

View all

39 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
Azalea RaadImperial College LondonVerified email at imperial.ac.uk
Anton PodkopaevJetBrains Research, Constructor University BremenVerified email at jetbrains.com
Chung-Kil HurSeoul National UniversityVerified email at sf.snu.ac.kr
Arnon AvronProfessor of Computer Science, Tel Aviv universityVerified email at cs.tau.ac.il
Derek DreyerMax Planck Institute for Software Systems (MPI-SWS), Saarland Informatics CampusVerified email at mpi-sws.org
Yoni ZoharBar Ilan UniversityVerified email at biu.ac.il
Jeehoon KangKAIST School of ComputingVerified email at kaist.ac.kr
Mooly SagivTel Aviv UniversityVerified email at acm.org
Brijesh DongolUniversity of SurreyVerified email at surrey.ac.uk
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 ChoCompiler Engineer, FuriosaAIVerified email at furiosa.ai
John WickersonImperial College LondonVerified email at imperial.ac.uk
Michalis KokologiannakisETH ZurichVerified email at inf.ethz.ch
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
Hai DangBlueRock Security IncVerified email at mpi-sws.org
Artem KhyzhaArmVerified email at arm.com

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	251	2017
A promising semantics for relaxed-memory concurrency J Kang, CK Hur, O Lahav, V Vafeiadis, D Dreyer POPL 2017, 175-189, 2017	237	2017
Verifying reachability in networks with mutable datapaths A Panda, O Lahav, K Argyraki, M Sagiv, S Shenker NSDI 2017, 2017	154*	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	153	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	148	2017
Taming release-acquire consistency O Lahav, N Giannarakis, V Vafeiadis POPL 2016, 649-662, 2016	148	2016
Owicki-Gries reasoning for weak memory models O Lahav, V Vafeiadis ICALP 2015, 311-323, 2015	119	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	94	2019
A separation logic for a promising semantics K Svendsen, J Pichon-Pharabod, M Doko, O Lahav, V Vafeiadis ESOP 2018, 357-384, 2018	63	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	62	2020
From frame properties to hypersequent rules in modal logics O Lahav LICS 2013, 408-417, 2013	62	2013
Explaining relaxed memory models with program transformations O Lahav, V Vafeiadis FM 2016, 479-495, 2016	58	2016
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	47	2019
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	46	2014
Finite-valued semantics for canonical labelled calculi M Baaz, O Lahav, A Zamansky Journal of Automated Reasoning 51 (4), 401-430, 2013	44	2013
Decidable verification under a causally consistent shared memory O Lahav, U Boker Proceedings of the 41st ACM SIGPLAN Conference on Programming Language …, 2020	40	2020
Decentralizing SDN policies O Padon, N Immerman, A Karbyshev, O Lahav, M Sagiv, S Shoham POPL 2015, 663-676, 2015	39	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	38	2013
Taming x86-TSO persistency A Khyzha, O Lahav Proceedings of the ACM on Programming Languages 5 (POPL), 1-29, 2021	36	2021
Robustness against release/acquire semantics O Lahav, R Margalit Proceedings of the 40th ACM SIGPLAN Conference on Programming Language …, 2019	36	2019

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