Satisfiability of constrained Horn clauses on algebraic data types: A transformation-based approach

Author:

De Angelis Emanuele1,Fioravanti Fabio2,Pettorossi Alberto3,Proietti Maurizio1

Affiliation:

1. IASI-CNR, Rome, 00185, Italy

2. DEC, University of Chieti-Pescara, Pescara, 65127, Italy

3. DICII, University of Rome Tor Vergata, Rome, 00133, Italy

Abstract

Abstract We address the problem of checking the satisfiability of constrained Horn clauses (CHCs) defined on algebraic data types (ADTs), such as lists and trees. We propose a new technique for transforming CHCs defined on ADTs into CHCs where the arguments of the predicates have only basic types, such as integers and booleans. Thus, our technique avoids, during satisfiability checking, the explicit use of proof rules based on induction over the ADTs. The main extension over previous techniques for ADT removal is a new transformation rule, called differential replacement, which allows us to introduce auxiliary predicates, whose definitions correspond to lemmas that are used when making inductive proofs. We present an algorithm that performs the automatic removal of ADTs by applying the new rule, together with the traditional folding/unfolding rules. We prove that, under suitable hypotheses, the set of the transformed clauses is satisfiable if and only if so is the set of the original clauses. By an experimental evaluation, we show that the use of the new rule significantly improves the effectiveness of ADT removal. We also show that our approach is competitive with respect to tools that extend CHC solvers with the use of inductive rules.

Publisher

Oxford University Press (OUP)

Subject

Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science

Reference54 articles.

1. Syntax-guided synthesis;Alur,2013

2. Logic programming;Apt,1990

3. CVC4;Barrett,2011

4. Satisfiability Modulo Theories

5. Horn clause solvers for program verification;Bjørner,2015

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

1. CHC-COMP 2023: Competition Report;Electronic Proceedings in Theoretical Computer Science;2024-04-23

2. CHC-COMP 2022: Competition Report;Electronic Proceedings in Theoretical Computer Science;2022-11-22

3. Contract Strengthening through Constrained Horn Clause Verification;Electronic Proceedings in Theoretical Computer Science;2022-11-22

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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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