Suha Orhun Mutluergil

E-mail : suha.mutluergilsabanciuniv.edu

Areas of Interest :

software verification and validation, concurrency theory, linearizability, deductive verification, developing testing methods with provable guarantees, proposing reasoning mechanisms for shared-memory and distributed concurrent programs focusing on block-chain platforms

Before SU Publications:

Berk Çirisci, Constantin Enea, Azadeh Farzan, Suha Orhun Mutluergil: Root Causing Linearizability Violations. CAV (1) 2020: 350-375

Bernhard Kragl, Constantin Enea, Thomas A. Henzinger, Suha Orhun Mutluergil, Shaz Qadeer: Inductive sequentialization of asynchronous programs. PLDI 2020: 227-242

Suha Orhun Mutluergil, Serdar Tasiran: A mechanized refinement proof of the Chase-Lev deque using a proof system. Computing 101(1): 59-74 (2019)

Chao Wang, Constantin Enea, Suha Orhun Mutluergil, Gustavo Petri: Replication-aware linearizability. PLDI 2019: 980-993

Ahmed Bouajjani, Constantin Enea, Suha Orhun Mutluergil, Serdar Tasiran: Reasoning About TSO Programs Using Reduction and Abstraction. CAV (2) 2018: 336-353
Ahmed Bouajjani, Michael Emmi, Constantin Enea, Suha Orhun Mutluergil:
Proving Linearizability Using Forward Simulations. CAV (2) 2017: 542-563
Suha Orhun Mutluergil, Serdar Tasiran:
- A Mechanized Refinement Proof of the Chase-Lev Deque Using a Proof System. NETYS 2016: 280-294

Suha Orhun Mutluergil, Serdar Tasiran: A Mechanized Refinement Proof of the Chase-Lev Deque Using a Proof System. NETYS 2016: 280-294