3 citations · 4 across the 6 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2026
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…
cs.LO2018
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…