Nitpicking c++ concurrency

PPDP(2011)

引用 29|浏览57
暂无评分
摘要
Previous work formalized the C++ memory model in Isabelle/HOL in an effort to clarify the proposed standard's semantics. Here we employ the model finder Nitpick to check litmus test programs that exercise the memory model, including a simple locking algorithm. Nitpick is built on Kodkod (Alloy's backend) but understands Isabelle's richer logic; hence it can be applied directly to the C++ memory model. We only need to give it a few hints, and thanks to the underlying SAT solver it scales much better than the Cppmem explicit-state model checker. This case study inspired optimizations in Nitpick from which other formalizations can now benefit.
更多
查看译文
关键词
proposed standard,model finder nitpick,underlying sat solver,memory model,cppmem explicit-state model checker,previous work,richer logic,case study,litmus test program,computer programming,sat solver,higher order logic,concurrency
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要