DECIDABILITY

作品数：8被引量：7H指数：1
导出分析报告
相关领域：自动化与计算机技术更多>>
相关作者：殷建平张波云蒿敬波更多>>
相关机构：国防科学技术大学更多>>
相关期刊：《Science China(Information Sciences)》《Journal of Computer Science & Technology》《Science China Mathematics》《Frontiers of Computer Science》更多>>
相关基金：国家自然科学基金国家重点基础研究发展计划更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 期刊=Science China（Information Sciences）x
共 条 记 录，以下是1-2
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Decidability of linearizabilities for relaxed data structures
《Science China(Information Sciences)》2018年第1期109-118,共10页Chao WANG Yi LV Peng WU 
supported by National Natural Science Foundation of China (Grants Nos. 61672504, 60721061, 60833001, 61572478, 61672503, 61100069, 61161130530);National Basic Research Program of China (973 Program) (Grant No. 2014CB340700)
Many recent implementations of concurrent data structures relaxed their linearizability requirements for better performance and scalability. Quasi-linearizability, k-linearizability and regular-relaxed linearizability...
关键词：concurrent data structures quantitative relaxation LINEARIZABILITY DECIDABILITY finite automata 
Decidable subsets of open logic and an algorithm for R-calculus被引量：1
《Science China(Information Sciences)》2015年第1期70-80,共11页ZHANG Wei 
supported by State Key Laboratory of Software Development Environment Open Fund (Grant No. SKLSDE-2012KF-02);Key Construction Program of the National 985 Project (Grant No. 26311005)
Open logic is an attractive logic theory that can describe the growth and evolution of knowledge.However, related studies show that open logic is undecidable in first-order logic and thus is hard to be programmed. Thi...
关键词：open logic DECIDABILITY maximal contraction R-calculus mechanical theorem proving 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部