Verifying Optimistic Algorithms Should be Easy (Position Paper)

Noam Rinetzky,T. Vechev,Eran Yahav,Greta Yorsh

msra

引用 21|浏览8

暂无评分

摘要

In this paper, we call to bridge the gap between what makes highly-concurrent optimistic algorithms work and current approaches for proving their correctness.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要