ScalaSMT: satisfiability modulo theory in Scala (tool paper)

Proceedings of the 8th ACM SIGPLAN International Symposium on Scala Pub Date : 2017-10-22 DOI:10.1145/3136000.3136004

F. Cassez, A. Sloane

{"title":"ScalaSMT: satisfiability modulo theory in Scala (tool paper)","authors":"F. Cassez, A. Sloane","doi":"10.1145/3136000.3136004","DOIUrl":null,"url":null,"abstract":"Satisfiability modulo theory (SMT) consists of determining the satisfiability of logical formulas. It can reason in various formal theories, e.g., in linear integer or real arithmetic, first-order logic, or logics of arrays. An SMT solver is a program that implements the corresponding algorithms to automatically determine whether a logical formula is satisfiable. The SMTLIB initiative provides a common input and output format based on S-expressions for interacting with SMT solvers. We present ScalaSMT, a Scala library that provides an abstraction over the SMTLIB format. The library brings consistency and type safety to the textual and dynamically typed world of SMTLIB solver interaction. ScalaSMT relies on the SMTLIB input/output capabilities of the solvers and consequently provides access to numerous popular SMTLIB-compliant solvers such as Z3, CVC4, Yices, MathSat5 or SMTinterpol. ScalaSMT is easily extendable (SMTLIB commands and theories can be added) and configurable (SMTLIB-compliant solvers can be added). ScalaSMT fills a gap in the Scala library landscape by providing support for powerful logical reasoning algorithms.","PeriodicalId":158126,"journal":{"name":"Proceedings of the 8th ACM SIGPLAN International Symposium on Scala","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 8th ACM SIGPLAN International Symposium on Scala","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3136000.3136004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

Abstract

Satisfiability modulo theory (SMT) consists of determining the satisfiability of logical formulas. It can reason in various formal theories, e.g., in linear integer or real arithmetic, first-order logic, or logics of arrays. An SMT solver is a program that implements the corresponding algorithms to automatically determine whether a logical formula is satisfiable. The SMTLIB initiative provides a common input and output format based on S-expressions for interacting with SMT solvers. We present ScalaSMT, a Scala library that provides an abstraction over the SMTLIB format. The library brings consistency and type safety to the textual and dynamically typed world of SMTLIB solver interaction. ScalaSMT relies on the SMTLIB input/output capabilities of the solvers and consequently provides access to numerous popular SMTLIB-compliant solvers such as Z3, CVC4, Yices, MathSat5 or SMTinterpol. ScalaSMT is easily extendable (SMTLIB commands and theories can be added) and configurable (SMTLIB-compliant solvers can be added). ScalaSMT fills a gap in the Scala library landscape by providing support for powerful logical reasoning algorithms.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Scala中的可满足模理论(工具论文)

可满足模理论(SMT)包括确定逻辑公式的可满足性。它可以在各种形式理论中进行推理，例如线性整数或实算术，一阶逻辑或数组逻辑。SMT求解器是实现相应算法来自动确定逻辑公式是否可满足的程序。SMTLIB计划提供了一种基于s表达式的通用输入和输出格式，用于与SMT求解器交互。我们介绍ScalaSMT，这是一个Scala库，它提供了SMTLIB格式的抽象。该库为文本和动态类型的SMTLIB求解器交互世界带来了一致性和类型安全性。ScalaSMT依赖于求解器的SMTLIB输入/输出功能，因此可以访问许多流行的符合SMTLIB的求解器，如Z3、CVC4、Yices、MathSat5或SMTinterpol。ScalaSMT易于扩展(可以添加SMTLIB命令和理论)和配置(可以添加SMTLIB兼容的求解器)。ScalaSMT通过提供对强大逻辑推理算法的支持，填补了Scala库领域的空白。

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

求助全文

约1分钟内获得全文去求助

来源期刊

Proceedings of the 8th ACM SIGPLAN International Symposium on Scala

自引率

0.00%

发文量

期刊最新文献

Interactive development using the Dotty compiler (tool paper) Effekt: extensible algebraic effects in Scala (short paper) Spark and Scala (keynote) Squid: type-safe, hygienic, and reusable quasiquotes Kompics Scala: narrowing the gap between algorithmic specification and executable code (short paper)