Подписаться
Ori Lahav
Ori Lahav
Tel Aviv University
Подтвержден адрес электронной почты в домене tau.ac.il - Главная страница
Название
Процитировано
Процитировано
Год
Repairing sequential consistency in C/C++11
O Lahav, V Vafeiadis, J Kang, CK Hur, D Dreyer
PLDI 2017, 618-632, 2017
2632017
A promising semantics for relaxed-memory concurrency
J Kang, CK Hur, O Lahav, V Vafeiadis, D Dreyer
POPL 2017, 175-189, 2017
2432017
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
1582017
Verifying reachability in networks with mutable datapaths
A Panda, O Lahav, K Argyraki, M Sagiv, S Shenker
NSDI 2017, 2017
156*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
1542017
Taming release-acquire consistency
O Lahav, N Giannarakis, V Vafeiadis
POPL 2016, 649-662, 2016
1532016
Owicki-Gries reasoning for weak memory models
O Lahav, V Vafeiadis
ICALP 2015, 311-323, 2015
1222015
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
1032019
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
702020
A separation logic for a promising semantics
K Svendsen, J Pichon-Pharabod, M Doko, O Lahav, V Vafeiadis
ESOP 2018, 357-384, 2018
642018
From frame properties to hypersequent rules in modal logics
O Lahav
LICS 2013, 408-417, 2013
642013
Explaining relaxed memory models with program transformations
O Lahav, V Vafeiadis
FM 2016, 479-495, 2016
602016
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
502019
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
462014
Finite-valued semantics for canonical labelled calculi
M Baaz, O Lahav, A Zamansky
Journal of Automated Reasoning 51 (4), 401-430, 2013
462013
Decidable verification under a causally consistent shared memory
O Lahav, U Boker
Proceedings of the 41st ACM SIGPLAN Conference on Programming Language …, 2020
402020
Decentralizing SDN policies
O Padon, N Immerman, A Karbyshev, O Lahav, M Sagiv, S Shoham
POPL 2015, 663-676, 2015
392015
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
392013
Robustness against release/acquire semantics
O Lahav, R Margalit
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language …, 2019
382019
Taming x86-TSO persistency
A Khyzha, O Lahav
Proceedings of the ACM on Programming Languages 5 (POPL), 1-29, 2021
372021
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20