Skip to content

Ori Lahav

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

48

Venues

23

Active years

2009–2026

Best venue rank

A*

Where they publish

Papers

48 indexed papers, newest first.

YearVenueTitleAuthors
2026ASPLOSA Programming Model for Disaggregated Memory over CXL.Gal Assa, Moritz Lumme, Lucas Brgi, Michal Friedman, Ori Lahav
2026ESOPCausal-Broadcast Memory.Amir Karniel, Ori Lahav
2025ESOPSufficient Conditions for Robustness of RDMA Programs.Guillaume Ambal, Ori Lahav, Azalea Raad
2025FOSSACSTwo-sorted algebraic decompositions of Brookes's shared-state denotational semantics.Yotam Dvir, Ohad Kammar, Ori Lahav, Gordon D. Plotkin
2024CAVMarabou 2.0: A Versatile Formal Analyzer of Neural Networks.Haoze Wu, Omri Isac, Aleksandar Zeljic, Teruhiro Tagomori, Matthew L. Daggitt, Wen Kokke, Idan Refaeli, Guy Amir, Kyle Julian, Shahaf Bassan, Pei Huang, Ori Lahav, Min Wu, Min Zhang, Ekaterina Komendantskaya, Guy Katz, Clark W. Barrett
2024ESOPA Denotational Approach to Release/Acquire Concurrency.Yotam Dvir, Ohad Kammar, Ori Lahav
2024ESOPIntel PMDK Transactions: Specification, Validation and Concurrency.Azalea Raad, Ori Lahav, John Wickerson, Piotr Balcer, Brijesh Dongol
2024ESOPArtifact Report: Intel PMDK Transactions: Specification, Validation and Concurrency.Azalea Raad, Ori Lahav, John Wickerson, Piotr Balcer, Brijesh Dongol
2024TACASDecidable Verification under Localized Release-Acquire Concurrency.Abhishek Kr Singh, Ori Lahav
2023CAVRely-Guarantee Reasoning for Causally Consistent Shared Memory.Ori Lahav, Brijesh Dongol, Heike Wehrheim
2022APLASAn Algebraic Theory for Shared-State Concurrency.Yotam Dvir, Ohad Kammar, Ori Lahav
2022CADEEffective Semantics for the Modal Logics K and KT via Non-deterministic Matrices.Ori Lahav, Yoni Zohar
2022ESOPView-Based Owicki-Gries Reasoning for Persistent x86-TSO.Eleni Vafeiadi Bila, Brijesh Dongol, Ori Lahav, Azalea Raad, John Wickerson
2022ESOPAbstraction for Crash-Resilient Objects.Artem Khyzha, Ori Lahav
2022PLDISequential reasoning for optimizing compilers under weak memory concurrency.Minki Cho, Sung-Hwan Lee, Dongjae Lee, Chung-Kil Hur, Ori Lahav
2021FMCADPruning and Slicing Neural Networks using Formal Verification.Ori Lahav, Guy Katz
2021PLDIModular data-race-freedom guarantees in the promising semantics.Minki Cho, Sung-Hwan Lee, Chung-Kil Hur, Ori Lahav
2020ECOOPReconciling Event Structures with Modern Multiprocessors.Evgenii Moiseenko, Anton Podkopaev, Ori Lahav, Orestis Melkonian, Viktor Vafeiadis
2020PLDIDecidable verification under a causally consistent shared memory.Ori Lahav, Udi Boker
2020PLDIPromising 2.0: global optimizations in relaxed memory concurrency.Sung-Hwan Lee, Minki Cho, Anton Podkopaev, Soham Chakraborty, Chung-Kil Hur, Ori Lahav, Viktor Vafeiadis
2019PLDIRobustness against release/acquire semantics.Ori Lahav, Roy David Margalit
2019VMCAIOn the Semantics of Snapshot Isolation.Azalea Raad, Ori Lahav, Viktor Vafeiadis
2018AiMLA Simple Cut-Free System for a Paraconsistent Logic Equivalent to S5.Arnon Avron, Ori Lahav
2018ESOPOn Parallel Snapshot Isolation and Release/Acquire Consistency.Azalea Raad, Ori Lahav, Viktor Vafeiadis
2018ESOPA Separation Logic for a Promising Semantics.Kasper Svendsen, Jean Pichon-Pharabod, Marko Doko, Ori Lahav, Viktor Vafeiadis
2017ECOOPStrong Logic for Weak Memory: Reasoning About Release-Acquire Consistency in Iris.Jan-Oliver Kaiser, Hoang-Hai Dang, Derek Dreyer, Ori Lahav, Viktor Vafeiadis
2017ECOOPPromising Compilation to ARMv8 POP.Anton Podkopaev, Ori Lahav, Viktor Vafeiadis
2017NSDIVerifying Reachability in Networks with Mutable Datapaths.Aurojit Panda, Ori Lahav, Katerina J. Argyraki, Mooly Sagiv, Scott Shenker
2017PLDIRepairing sequential consistency in C/C++11.Ori Lahav, Viktor Vafeiadis, Jeehoon Kang, Chung-Kil Hur, Derek Dreyer
2017POPLA promising semantics for relaxed-memory concurrency.Jeehoon Kang, Chung-Kil Hur, Ori Lahav, Viktor Vafeiadis, Derek Dreyer
2017TABLEAUXCut-Admissibility as a Corollary of the Subformula Property.Ori Lahav, Yoni Zohar
2016AiMLIt ain't necessarily so: Basic sequent systems for negative modalities.Ori Lahav, Joo Marcos, Yoni Zohar
2016FMExplaining Relaxed Memory Models with Program Transformations.Ori Lahav, Viktor Vafeiadis
2016POPLTaming release-acquire consistency.Ori Lahav, Nick Giannarakis, Viktor Vafeiadis
2015ICALPOwicki-Gries Reasoning for Weak Memory Models.Ori Lahav, Viktor Vafeiadis
2015POPLDecentralizing SDN Policies.Oded Padon, Neil Immerman, Aleksandr Karbyshev, Ori Lahav, Mooly Sagiv, Sharon Shoham
2014CADESAT-Based Decision Procedure for Analytic Pure Sequent Calculi.Ori Lahav, Yoni Zohar
2014POPLModular reasoning about heap paths via effectively propositional formulas.Shachar Itzhaky, Anindya Banerjee, Neil Immerman, Ori Lahav, Aleksandar Nanevski, Mooly Sagiv
2014WoLLICOn the Construction of Analytic Sequent Calculi for Sub-classical Logics.Ori Lahav, Yoni Zohar
2013LFCSAutomated Support for the Investigation of Paraconsistent and Other Logics.Agata Ciabattoni, Ori Lahav, Lara Spendier, Anna Zamansky
2013LICSFrom Frame Properties to Hypersequent Rules in Modal Logics.Ori Lahav
2013LPARInstantiations, Zippers and EPR Interpolation.Nikolaj S. Bjrner, Arie Gurfinkel, Konstantin Korovin, Ori Lahav
2012CADEEffective Finite-Valued Semantics for Labelled Calculi.Matthias Baaz, Ori Lahav, Anna Zamansky
2011CSRA Multiple-Conclusion Calculus for First-Order Gdel Logic.Arnon Avron, Ori Lahav
2011EUSFLATNon-deterministic Connectives in Propositional Godel Logic.Ori Lahav, Arnon Avron
2011TABLEAUXKripke Semantics for Basic Sequent Systems.Arnon Avron, Ori Lahav
2011TABLEAUXBasic Constructive Connectives, Determinism and Matrix-Based Semantics.Agata Ciabattoni, Ori Lahav, Anna Zamansky
2009TABLEAUXCanonical Constructive Systems.Arnon Avron, Ori Lahav