Scholarlink

<p>In this paper, we present S<span>harp</span>SMT, a toolkit for measuring solution spaces of SMT(LA) formulas which are Boolean combinations of linear arithmetic constraints, i.e., #SMT(LA) problems. It integrates SMT satisfiability solving algorithm with various polytope subroutines: volume computation, volume estimation, lattice counting, and approximate lattice counting. We propose a series of new polytope preprocessing techniques which have been implemented in S<span>harp</span>SMT. Experimental results show that the new polytope preprocessing techniques are very effective, especially on application instances. We believe that S<span>harp</span>SMT will be useful in a number of areas.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

SharpSMT: a scalable toolkit for measuring solution spaces of SMT(LA) formulas

  • 期刊论文

  • 发表日期：

    2025年1月13日

查看全文
  • Cunjing Ge

摘要

In this paper, we present SharpSMT, a toolkit for measuring solution spaces of SMT(LA) formulas which are Boolean combinations of linear arithmetic constraints, i.e., #SMT(LA) problems. It integrates SMT satisfiability solving algorithm with various polytope subroutines: volume computation, volume estimation, lattice counting, and approximate lattice counting. We propose a series of new polytope preprocessing techniques which have been implemented in SharpSMT. Experimental results show that the new polytope preprocessing techniques are very effective, especially on application instances. We believe that SharpSMT will be useful in a number of areas.