Termination analysis of logic programs through combination of type-based norms

Author:

Bruynooghe Maurice1,Codish Michael2,Gallagher John P.3,Genaim Samir4,Vanhoof Wim5

Affiliation:

1. Katholieke Universiteit Leuven, Heverlee, Belgium

2. Ben-Gurion University of the Negev, Beer-Sheva, Israel

3. Roskilde University, Roskilde, Denmark

4. Universidad Politécnica de Madrid, Madrid, Spain

5. University of Namur, Namur, Belgium

Abstract

This article makes two contributions to the work on semantics-based termination analysis for logic programs. The first involves a novel notion of type - based norm where for a given type, a corresponding norm is defined to count in a term the number of subterms of that type. This provides a collection of candidate norms, one for each type defined in the program. The second enables an analyzer to base termination proofs on the combination of several different norms. This is useful when different norms are better suited to justify the termination of different parts of the program. Application of the two contributions together consists in considering the combination of the type-based candidate norms for a given program. This results in a powerful and practical technique. Both contributions have been introduced into a working termination analyzer. Experimentation indicates that they yield state-of-the-art results in a fully automatic analysis tool, improving with respect to methods that do not use both types and combined norms.

Publisher

Association for Computing Machinery (ACM)

Subject

Software

Cited by 44 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Multiple Query Satisfiability of Constrained Horn Clauses;Practical Aspects of Declarative Languages;2023

2. Constrained Horn Clauses Satisfiability via Catamorphic Abstractions;Logic-Based Program Synthesis and Transformation;2023

3. Verifying Catamorphism-Based Contracts using Constrained Horn Clauses;Theory and Practice of Logic Programming;2022-07

4. Termination Analysis of Programs with Multiphase Control-Flow;Electronic Proceedings in Theoretical Computer Science;2021-09-13

5. Transformational Verification of Quicksort;Electronic Proceedings in Theoretical Computer Science;2020-08-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3