DefunT: A Tool for Automating Termination Proofs by Using the Community Books (Extended Abstract)

CoRR Pub Date : 2018-10-10 DOI:10.4204/EPTCS.280.12
Matt Kaufmann
{"title":"DefunT: A Tool for Automating Termination Proofs by Using the Community Books (Extended Abstract)","authors":"Matt Kaufmann","doi":"10.4204/EPTCS.280.12","DOIUrl":null,"url":null,"abstract":"We present a tool that automates termination proofs for recursive definitions by mining existing termination theorems.","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"2 1","pages":"161-163"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"CoRR","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.280.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

We present a tool that automates termination proofs for recursive definitions by mining existing termination theorems.
DefunT:一个使用社区图书自动终止证明的工具(扩展摘要)
我们提出了一个工具,通过挖掘现有的终止定理来自动化递归定义的终止证明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信