Simultaneous checking of completeness and ground confluence for algebraic specifications

Author:

Bouhoula Adel1

Affiliation:

1. University of November 7th at Carthage, Ariana, Tunisia

Abstract

Algebraic specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundamental notions for building algebraic specifications in a correct and modular way. Related works for checking ground confluence are based on the completion techniques or on the test that all critical pairs between axioms are valid with respect to a sufficient criterion for ground confluence. It is generally accepted that such techniques may be very inefficient, even for very small specifications. Indeed, the completion procedure often diverges and there often exist many critical pairs of the axioms. In this article, we present a procedure for simultaneously checking completeness and ground confluence for specifications with free/nonfree constructors and parameterized specifications. If the specification is not complete or not ground confluent, then our procedure will output the set of patterns on whose ground instances a function is not defined and it can easily identify the rules that break ground confluence. In contrast to previous work, our method does not rely on completion techniques and does not require the computation of critical pairs of the axioms. The method is entirely implemented and allowed us to prove the completeness and the ground confluence of many specifications in a completely automatic way, where related techniques diverge or generate very complex proofs. Our system offers two main components: (i) a completeness and ground confluence analyzer that computes pattern trees of defined functions and may generate some proof obligations; and (ii) a procedure to prove (joinable) inductive conjectures which is used to discharge these proof obligations.

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science

Reference42 articles.

1. Becker K. 1996. How to prove ground confluence. SEKI-rep. SR-96-02 Universität Kaiserslautern. Becker K. 1996. How to prove ground confluence. SEKI-rep. SR-96-02 Universität Kaiserslautern.

2. Automated Theorem Proving by Test Set Induction

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

1. On Ground Convergence and Completeness of Conditional Equational Program Hierarchies;Rewriting Logic and Its Applications;2022

2. Checking Sufficient Completeness by Inductive Theorem Proving;Rewriting Logic and Its Applications;2022

3. SPIKE, an automatic theorem prover — revisited;2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2020-09

4. Ground confluence of order-sorted conditional specifications modulo axioms;Journal of Logical and Algebraic Methods in Programming;2020-02

5. Inductive Theorem Proving in Non-terminating Rewriting Systems and Its Application to Program Transformation;Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages 2019;2019-10-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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