可满足性。Julia中的可满足模理论

arXiv - CS - Mathematical Software Pub Date : 2023-09-15 DOI:arxiv-2309.08778

Emiko Soroka, Mykel J. Kochenderfer, Sanjay Lall

{"title":"可满足性。Julia中的可满足模理论","authors":"Emiko Soroka, Mykel J. Kochenderfer, Sanjay Lall","doi":"arxiv-2309.08778","DOIUrl":null,"url":null,"abstract":"Satisfiability modulo theories (SMT) is a core tool in formal verification.\nWhile the SMT-LIB specification language can be used to interact with theorem\nproving software, a high-level interface allows for faster and easier\nspecifications of complex SMT formulae. In this paper we discuss the design and\nimplementation of a novel publicly-available interface for interacting with\nSMT-LIB compliant solvers in the Julia programming language.","PeriodicalId":501256,"journal":{"name":"arXiv - CS - Mathematical Software","volume":"12 3","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Satisfiability.jl: Satisfiability Modulo Theories in Julia\",\"authors\":\"Emiko Soroka, Mykel J. Kochenderfer, Sanjay Lall\",\"doi\":\"arxiv-2309.08778\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Satisfiability modulo theories (SMT) is a core tool in formal verification.\\nWhile the SMT-LIB specification language can be used to interact with theorem\\nproving software, a high-level interface allows for faster and easier\\nspecifications of complex SMT formulae. In this paper we discuss the design and\\nimplementation of a novel publicly-available interface for interacting with\\nSMT-LIB compliant solvers in the Julia programming language.\",\"PeriodicalId\":501256,\"journal\":{\"name\":\"arXiv - CS - Mathematical Software\",\"volume\":\"12 3\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-09-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Mathematical Software\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2309.08778\",\"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 - Mathematical Software","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2309.08778","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

可满足模理论(SMT)是形式化验证的核心工具。虽然SMT- lib规范语言可用于与定理改进软件交互，但高级接口允许更快、更容易地规范复杂的SMT公式。在本文中，我们讨论了一种新的公共可用接口的设计和实现，用于在Julia编程语言中与smt - lib兼容的求解器进行交互。

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

查看原文本刊更多论文

Satisfiability.jl: Satisfiability Modulo Theories in Julia

Satisfiability modulo theories (SMT) is a core tool in formal verification. While the SMT-LIB specification language can be used to interact with theorem proving software, a high-level interface allows for faster and easier specifications of complex SMT formulae. In this paper we discuss the design and implementation of a novel publicly-available interface for interacting with SMT-LIB compliant solvers in the Julia programming language.

求助全文

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

来源期刊

arXiv - CS - Mathematical Software

自引率

0.00%

发文量