期刊文献+

基于DTRC的形式自动证明平台及其应用

An automated formal proving platform based on dynamicterm rewriting calculus and its application
在线阅读 下载PDF
导出
摘要 动态项重写计算(DTRC)是项重写系统(TRS)的元计算模型,具有层次化结构和动态重写等特征,可应用于归纳定理的形式自动证明以及项重写系统弱终止性的形式自动证明等方面.文中介绍了一个基于DTRC的形式自动证明平台及其在TRS弱终止性自动证明上的应用. The dynamic term rewriting calculus is a formal computation model for meta-computation of term rewriting systems, which has characteristic features as the hierarchical declaration and dynamic rewriting, and is applied to the automated formal proving for the inductive theorems and weak termination of term rewriting systems. The paper describes an automated formal proving platform based on the dynamic term rewriting calculus and its application to the automated proving for the weak termination of term rewriting systems.
出处 《海军工程大学学报》 CAS 2004年第5期60-64,共5页 Journal of Naval University of Engineering
基金 国家自然科学基金资助项目(60273015)
关键词 动态项重写计算 项重写系统 运行平台 形式自动证明 重写策略 dynamic term rewriting calculus term rewriting systems computing platform automated formal proving rewriting strategy
  • 相关文献

参考文献7

  • 1[1]Huet G. Confluent reductions: abstract properties and application to term rewriting systems[J].J. ACM,1980,27:797-821.
  • 2[2]Middeldrop A, Zantema H. Simple termination of rewrite systems [J]. Theoretical Computer Science,1997,175:127-158.
  • 3冯速.动态项重写计算[J].计算机科学,2002,29(8):13-14. 被引量:2
  • 4[4]Feng S, Sakabe T, Inagaki Y. Mechanizing explicit inductive equational reasoning by DTRC[J]. IEICE Transaction on Information and Systems, 1995, E78_D(2): 113 - 121.
  • 5[5]Feng S, Cao S, Liu S X. Mechanizing weak termination proving of term rewriting systems by induction [A]. Proceedings of the Sixth International Conference for Young Computer Scientists[C].北京:万国学术出版社,2001.
  • 6[7]Prosise J.MFC Windows程序设计(第二版)[M].北京博彦科技发展有限责任公司译.北京:清华大学出版社,2001.
  • 7[8]Toyama Y. How to prove equivalence of term rewriting systems without induction [J]. Theoretical Computer Science, 1991,90 : 369- 390.

二级参考文献7

  • 1Dershowitz N. Termination of Rewriting. J. Symb. Comput. 1987,3:69~115
  • 2Feng S,et al. Mechanizing Weak Termination Proving of Term Rewriting Systems by Induction. In: Proc. ICYCS' 2001. 2001. 15 ~19
  • 3Huet G. Confluent Reductions:Abstract Properties and Applica tions to Term Rewriting Systems. J. ACM, 1980,27:797~821
  • 4Knuth D E,Bendix P. Simple Word Problems in Universal Alge bra. In :J. Leech,eds. Computational Problems in Abstract Alge bra :Oxford,Pergamon Press, 1970. 263~297
  • 5Feng S,et al. Mechanizing Explicit Inductive Equational Reason ing by DTRC. IEICE Trans. Inf. & System. 1995 ,E78-D(2): 113~121
  • 6Feng S,et al. Confluence Property of Simple Frames in Dynamic Term Rewriting Calculus. IEICE Trans. Inf. & Syst , 1997, E80- D(6) :625~645
  • 7冯速.项重写系统弱基终止性的归纳证明[J].计算机科学,2001,28(7):105-108. 被引量:4

共引文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部