Verification Tools for Transactional Programs. - Adrián Cristal; Burcu Kulahcioglu Ozkan; Ernie Cohen; Gokcen Kestor; Ismail Kuru 001; Osman S. Unsal; Serdar Tasiran; Suha Orhun Mutluergil; Tayfun Elmas (Transactional Memory, 2015)

Proving Linearizability Using Forward Simulations. - Ahmed Bouajjani; Michael Emmi; Constantin Enea; Suha Orhun Mutluergil (CAV (2), 2017)

Reasoning About TSO Programs Using Reduction and Abstraction. - Ahmed Bouajjani; Constantin Enea; Suha Orhun Mutluergil; Serdar Tasiran (CAV (2), 2018)

Verification of concurrent programs via refinement proofs (İyileştirme ispatları ile koşut-zamanlı programların doğrulanması) - Suha Orhun Mutluergil (2018)

Replication-aware linearizability. - Chao Wang 069; Constantin Enea; Suha Orhun Mutluergil; Gustavo Petri (PLDI, 2019)

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

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

Inductive sequentialization of asynchronous programs. - Bernhard Kragl; Constantin Enea; Thomas A. Henzinger; Suha Orhun Mutluergil; Shaz Qadeer (PLDI, 2020)

Inductive Sequentialization of Asynchronous Programs (Evaluated Artifact). - Bernhard Kragl; Constantin Enea; Thomas A. Henzinger; Suha Orhun Mutluergil; Shaz Qadeer (Zenodo, 2020)

Quorum Tree Abstractions of Consensus Protocols. - Berk Çirisci; Constantin Enea; Suha Orhun Mutluergil (ESOP, 2023)

A Pragmatic Approach to Stateful Partial Order Reduction. - Berk Çirisci; Constantin Enea; Azadeh Farzan; Suha Orhun Mutluergil (VMCAI, 2023)

Going Forward-Forward in Distributed Deep Learning. - Ege Aktemur; Ege Zorlutuna; Kaan Bilgili; Tacettin Emre Bok; Berrin Yanikoglu; Suha Orhun Mutluergil (CoRR, 2024)