在SMT中对n索引序列进行推理

IF 0.5 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Acta Informatica Pub Date : 2025-08-21 DOI:10.1007/s00236-025-00496-w

Hichem Rami Ait-El-Hara, François Bobot, Guillaume Bury

{"title":"在SMT中对n索引序列进行推理","authors":"Hichem Rami Ait-El-Hara, François Bobot, Guillaume Bury","doi":"10.1007/s00236-025-00496-w","DOIUrl":null,"url":null,"abstract":"<div><p>The SMT (Satisfiability Modulo Theories) theory of arrays is well-established and widely used, with various decision procedures and extensions developed for it. However, recent contributions suggest that developing tailored reasoning for some theories, such as sequences and strings, can be more efficient than reasoning over them through axiomatization over the theory of arrays. In this paper, we are interested in reasoning over <span>\\(n\\)</span>-indexed sequences as they are found in some programming languages, such as Ada. We propose an SMT theory of <span>\\(n\\)</span>-indexed sequences and explore different ways to represent and reason over <span>\\(n\\)</span>-indexed sequences using existing theories, as well as tailored calculi for this theory.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"62 3","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2025-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-025-00496-w.pdf","citationCount":"0","resultStr":"{\"title\":\"Reasoning over n-indexed sequences in SMT\",\"authors\":\"Hichem Rami Ait-El-Hara, François Bobot, Guillaume Bury\",\"doi\":\"10.1007/s00236-025-00496-w\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The SMT (Satisfiability Modulo Theories) theory of arrays is well-established and widely used, with various decision procedures and extensions developed for it. However, recent contributions suggest that developing tailored reasoning for some theories, such as sequences and strings, can be more efficient than reasoning over them through axiomatization over the theory of arrays. In this paper, we are interested in reasoning over <span>\\\\(n\\\\)</span>-indexed sequences as they are found in some programming languages, such as Ada. We propose an SMT theory of <span>\\\\(n\\\\)</span>-indexed sequences and explore different ways to represent and reason over <span>\\\\(n\\\\)</span>-indexed sequences using existing theories, as well as tailored calculi for this theory.</p></div>\",\"PeriodicalId\":7189,\"journal\":{\"name\":\"Acta Informatica\",\"volume\":\"62 3\",\"pages\":\"\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2025-08-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s00236-025-00496-w.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Acta Informatica\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00236-025-00496-w\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Informatica","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s00236-025-00496-w","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

阵列的可满足模理论（SMT）已经建立并得到了广泛的应用，并发展了各种决策程序和扩展。然而，最近的贡献表明，为某些理论（如序列和字符串）开发量身定制的推理，可能比通过对数组理论的公理化进行推理更有效。在本文中，我们感兴趣的是对\(n\)索引序列的推理，因为它们存在于一些编程语言中，比如Ada。我们提出了一个\(n\) -索引序列的SMT理论，并利用现有的理论探索了对\(n\) -索引序列进行表示和推理的不同方法，以及为该理论量身定制的微积分。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Reasoning over n-indexed sequences in SMT

The SMT (Satisfiability Modulo Theories) theory of arrays is well-established and widely used, with various decision procedures and extensions developed for it. However, recent contributions suggest that developing tailored reasoning for some theories, such as sequences and strings, can be more efficient than reasoning over them through axiomatization over the theory of arrays. In this paper, we are interested in reasoning over \(n\)-indexed sequences as they are found in some programming languages, such as Ada. We propose an SMT theory of \(n\)-indexed sequences and explore different ways to represent and reason over \(n\)-indexed sequences using existing theories, as well as tailored calculi for this theory.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Acta Informatica 工程技术-计算机：信息系统

CiteScore

2.40

自引率

16.70%

发文量

审稿时长

>12 weeks

期刊介绍： Acta Informatica provides international dissemination of articles on formal methods for the design and analysis of programs, computing systems and information structures, as well as related fields of Theoretical Computer Science such as Automata Theory, Logic in Computer Science, and Algorithmics. Topics of interest include: • semantics of programming languages • models and modeling languages for concurrent, distributed, reactive and mobile systems • models and modeling languages for timed, hybrid and probabilistic systems • specification, program analysis and verification • model checking and theorem proving • modal, temporal, first- and higher-order logics, and their variants • constraint logic, SAT/SMT-solving techniques • theoretical aspects of databases, semi-structured data and finite model theory • theoretical aspects of artificial intelligence, knowledge representation, description logic • automata theory, formal languages, term and graph rewriting • game-based models, synthesis • type theory, typed calculi • algebraic, coalgebraic and categorical methods • formal aspects of performance, dependability and reliability analysis • foundations of information and network security • parallel, distributed and randomized algorithms • design and analysis of algorithms • foundations of network and communication protocols.