有限域的 SMT-LIB 理论

arXiv - CS - Logic in Computer Science Pub Date : 2024-07-30 DOI:arxiv-2407.21169

Thomas Hader, Alex Ozdemir

{"title":"有限域的 SMT-LIB 理论","authors":"Thomas Hader, Alex Ozdemir","doi":"arxiv-2407.21169","DOIUrl":null,"url":null,"abstract":"In the last few years there have been rapid developments in SMT solving for\nfinite fields. These include new decision procedures, new implementations of\nSMT theory solvers, and new software verifiers that rely on SMT solving for\nfinite fields. To support interoperability in this emerging ecosystem, we\npropose the SMT-LIB theory of finite field arithmetic (FFA). The theory defines\na canonical representation of finite field elements as well as definitions of\noperations and predicates on finite field elements.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"70 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An SMT-LIB Theory of Finite Fields\",\"authors\":\"Thomas Hader, Alex Ozdemir\",\"doi\":\"arxiv-2407.21169\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the last few years there have been rapid developments in SMT solving for\\nfinite fields. These include new decision procedures, new implementations of\\nSMT theory solvers, and new software verifiers that rely on SMT solving for\\nfinite fields. To support interoperability in this emerging ecosystem, we\\npropose the SMT-LIB theory of finite field arithmetic (FFA). The theory defines\\na canonical representation of finite field elements as well as definitions of\\noperations and predicates on finite field elements.\",\"PeriodicalId\":501208,\"journal\":{\"name\":\"arXiv - CS - Logic in Computer Science\",\"volume\":\"70 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2407.21169\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2407.21169","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

过去几年，无穷域 SMT 求解技术发展迅速。其中包括新的决策程序、SMT 理论求解器的新实现，以及依赖于有限域 SMT 求解的新软件验证器。为了支持这一新兴生态系统的互操作性，我们提出了有限域算术（FFA）的 SMT-LIB 理论。该理论定义了有限域元素的规范表示以及有限域元素上的操作和谓词定义。

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

查看原文本刊更多论文

An SMT-LIB Theory of Finite Fields

In the last few years there have been rapid developments in SMT solving for finite fields. These include new decision procedures, new implementations of SMT theory solvers, and new software verifiers that rely on SMT solving for finite fields. To support interoperability in this emerging ecosystem, we propose the SMT-LIB theory of finite field arithmetic (FFA). The theory defines a canonical representation of finite field elements as well as definitions of operations and predicates on finite field elements.

求助全文

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

来源期刊

arXiv - CS - Logic in Computer Science

自引率

0.00%

发文量