{"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.