Ori Lahav

Ori Lahav

Tel Aviv University

H-index: 21

Asia-Israel

About Ori Lahav

Ori Lahav, With an exceptional h-index of 21 and a recent h-index of 19 (since 2020), a distinguished researcher at Tel Aviv University, specializes in the field of Concurrency, Relaxed Memory Models, Programming Languages, Program Analysis and Verification, Logic.

His recent articles reflect a diverse array of research interests and contributions to the field:

Intel PMDK Transactions: Specification, Validation and Concurrency

Formal Methods for Correct Persistent Programming (Dagstuhl Seminar 23412)

Artifact Report: Intel PMDK Transactions: Specification, Validation and Concurrency

Decidable Verification under Localized Release-Acquire Concurrency

A Denotational Approach to Release/Acquire Concurrency

An Operational Approach to Library Abstraction under Relaxed Memory Concurrency

Kater: Automating Weak Memory Model Metatheory and Consistency Checking

Verification, Model Checking, and Abstract Interpretation: 25th International Conference, VMCAI 2024, London, United Kingdom, January 15–16, 2024, Proceedings, Part I

Ori Lahav Information

University

Position

___

Citations(all)

2004

Citations(since 2020)

1469

Cited By

1139

hIndex(all)

21

hIndex(since 2020)

19

i10Index(all)

36

i10Index(since 2020)

30

Email

University Profile Page

Tel Aviv University

Google Scholar

View Google Scholar Profile

Ori Lahav Skills & Research Interests

Concurrency

Relaxed Memory Models

Programming Languages

Program Analysis and Verification

Logic

Top articles of Ori Lahav

Title

Journal

Author(s)

Publication Date

Intel PMDK Transactions: Specification, Validation and Concurrency

arXiv preprint arXiv:2312.13828

Azalea Raad

Ori Lahav

John Wickerson

Piotr Balcer

Brijesh Dongol

2023/12/21

Formal Methods for Correct Persistent Programming (Dagstuhl Seminar 23412)

Ori Lahav

Azalea Raad

Joseph Tassarotti

Viktor Vafeiadis

Anton Podkopaev

2024

Artifact Report: Intel PMDK Transactions: Specification, Validation and Concurrency

Azalea Raad

Ori Lahav

John Wickerson

Piotr Balcer

Brijesh Dongol

2024/4/5

Decidable Verification under Localized Release-Acquire Concurrency

Abhishek Kr Singh

Ori Lahav

2024/4/5

A Denotational Approach to Release/Acquire Concurrency

Yotam Dvir

Ohad Kammar

Ori Lahav

2024/4/5

An Operational Approach to Library Abstraction under Relaxed Memory Concurrency

Proceedings of the ACM on Programming Languages

Abhishek Kr Singh

Ori Lahav

2023/1/9

Kater: Automating Weak Memory Model Metatheory and Consistency Checking

Proceedings of the ACM on Programming Languages

Michalis Kokologiannakis

Ori Lahav

Viktor Vafeiadis

2023/1/9

Verification, Model Checking, and Abstract Interpretation: 25th International Conference, VMCAI 2024, London, United Kingdom, January 15–16, 2024, Proceedings, Part I

Dirk Beyer

Damien Zufferey

2020/1/14

Rely-guarantee reasoning for causally consistent shared memory

Ori Lahav

Brijesh Dongol

Heike Wehrheim

2023/7/17

Putting Weak Memory in Order via a Promising Intermediate Representation

Proceedings of the ACM on Programming Languages

Sung-Hwan Lee

Minki Cho

Roy Margalit

Chung-Kil Hur

Ori Lahav

2023/6/6

What’s decidable about causally consistent shared memory?

ACM Transactions on Programming Languages and Systems (TOPLAS)

Ori Lahav

Udi Boker

2022/4/6

Abstraction for crash-resilient objects

Artem Khyzha

Ori Lahav

2022/3/29

Foundations of Persistent Programming (Dagstuhl Seminar 21462)

Hans-J Boehm

Ori Lahav

Azalea Raad

2022

An Algebraic Theory for Shared-State Concurrency

Yotam Dvir

Ohad Kammar

Ori Lahav

2022/11/25

View-based Owicki–Gries reasoning for persistent x86-TSO

Eleni Vafeiadi Bila

Brijesh Dongol

Ori Lahav

Azalea Raad

John Wickerson

2022

Effective semantics for the modal logics K and KT via non-deterministic matrices

Ori Lahav

Yoni Zohar

2022/8/1

Sequential reasoning for optimizing compilers under weak memory concurrency

Minki Cho

Sung-Hwan Lee

Dongjae Lee

Chung-Kil Hur

Ori Lahav

2022/6/9

Taming x86-TSO persistency

Proceedings of the ACM on Programming Languages

Artem Khyzha

Ori Lahav

2021/1/4

Verifying observational robustness against a c11-style memory model

Proceedings of the ACM on Programming Languages

Roy Margalit

Ori Lahav

2021/1/4

Making weak memory models fair

Proceedings of the ACM on Programming Languages

Ori Lahav

Egor Namakonov

Jonas Oberhauser

Anton Podkopaev

Viktor Vafeiadis

2021

See List of Professors in Ori Lahav University(Tel Aviv University)

Co-Authors

H-index: 161
Scott Shenker

Scott Shenker

University of California, Berkeley

H-index: 35
Aurojit Panda

Aurojit Panda

New York University

H-index: 31
Katerina Argyraki

Katerina Argyraki

École Polytechnique Fédérale de Lausanne

H-index: 26
Chung-Kil Hur

Chung-Kil Hur

Seoul National University

H-index: 22
Anna Zamansky

Anna Zamansky

University of Haifa

H-index: 17
Brijesh Dongol

Brijesh Dongol

University of Surrey

academic-engine