{"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}
引用次数: 0
Abstract
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
