Faster linearizability checking via $P$-compositionality · HackerPapers discussions

Faster linearizability checking via $P$-compositionality — mentioned by cube2222

Sun, 09 Sep 2018 11:52:32 GMT

It seems like he/she's attributing the speedup to the paper cited in the readme[1]. Go shouldn't be much faster than clojure, the jvm is fast. [1]:https://arxiv.org/pdf/1504.00204.pdf

Paper and discussion history. A mention is not an endorsement.

Faster linearizability checking via $P$-compositionality — mentioned by jinqueeny

Fri, 07 Sep 2018 06:12:10 GMT

It implements the algorithm in "Faster linearizability checking via P-compositionality": https://arxiv.org/pdf/1504.00204.pdf

Paper and discussion history. A mention is not an endorsement.