Writing concurrent code that is both correct and efficient notoriously difficult. Thus, programmers often prefer to use synchronization abstractions, which render simpler easier reason about. Despite a wealth of work on this topic, there still gap between the rich semantics provided by abstractions in modern programming languages—specifically, fair FIFO ordering requests support for abortable o...

It is well known in the Constraint Programming community that any non-binary constraint satisfaction problem (with finite domains) can be transformed into an equivalent binary one. One of most well-known translations Hidden Variable Encoding. In this paper we formalize encoding proof assistant Coq and prove solution makes it possible to build a original vice-versa. This formal development used ...