@@ -190,8 +190,8 @@ Then, for proving the weaker specification of $\enqueue$ and $\dequeue$, one sim

Up to now, we ignored the weakly consistent behavior of the semantics of \mocaml{}.

In this section, we lift this restriction, and propose a more precise specification for our concurrent queue implementation, which takes into account this aspect.

We will use the separation logic Cosmo~\cite{TODO}% TODO

: this framework has been designed on top of Iris in order to provide a powerful proof framework for the weak memory model of \mocaml{}.

We will use the separation logic Cosmo~\citecosmo:

this framework has been designed on top of Iris in order to provide a powerful proof framework for the weak memory model of \mocaml{}.

Because Cosmo is based on Iris, logically atomic triples can also be defined in this logic.

In fact, the specification shown in~\fref{fig:queue:specsc} still applies.