3 citations · 4 across the 6 of their papers we have counts for
7 papers
Combining Axiomatic Models for Refinement Proofs
Suha Orhun Mutluergil, Alperen Dogan
Refinement proofs verify an implementation by showing that its behaviours are subsumed by a simpler specification, on which safety properties are easier to establish. We study how…
Going Forward-Forward in Distributed Deep Learning
Ege Aktemur, Ege Zorlutuna, Kaan Bilgili +3
We introduce a new approach in distributed deep learning, utilizing Geoffrey Hinton's Forward-Forward (FF) algorithm to speed up the training of neural networks in distributed comp…
Quorum Tree Abstractions of Consensus Protocols
Berk Cirisci, Constantin Enea, Suha Orhun Mutluergil
Distributed algorithms solving agreement problems like consensus or state machine replication are essential components of modern fault-tolerant distributed services. They are also…
A Pragmatic Approach to Stateful Partial Order Reduction
Berk Cirisci, Constantin Enea, Azadeh Farzan +1
Partial order reduction (POR) is a classic technique for dealing with the state explosion problem in model checking of concurrent programs. Theoretical optimality, i.e., avoiding e…
Replication-Aware Linearizability
Constantin Enea, Suha Orhun Mutluergil, Gustavo Petri +1
Geo-distributed systems often replicate data at multiple locations to achieve availability and performance despite network partitions. These systems must accept updates at any repl…
Reasoning About TSO Programs Using Reduction and Abstraction
Ahmed Bouajjani, Constantin Enea, Suha Orhun Mutluergil +1
We present a method for proving that a program running under the Total Store Ordering (TSO) memory model is robust, i.e., all its TSO computations are equivalent to computations un…
Proving linearizability using forward simulations
Ahmed Bouajjani, Michael Emmi, Constantin Enea +1
Linearizability is the standard correctness criterion concurrent data structures such as stacks and queues. It allows to establish observational refinement between a concurrent imp…