2 research outputs found
A Tool for Computing and Estimating the Volume of the Solution Space of SMT(LA)
There are already quite a few tools for solving the Satisfiability Modulo
Theories (SMT) problems. In this paper, we present \texttt{VolCE}, a tool for
counting the solutions of SMT constraints, or in other words, for computing the
volume of the solution space. Its input is essentially a set of Boolean
combinations of linear constraints, where the numeric variables are either all
integers or all reals, and each variable is bounded. The tool extends SMT
solving with integer solution counting and volume computation/estimation for
convex polytopes. Effective heuristics are adopted, which enable the tool to
deal with high-dimensional problem instances efficiently and accurately
Counting the Number of Solutions to Constraints
Compared with constraint satisfaction problems, counting problems have
received less attention. In this paper, we survey research works on the
problems of counting the number of solutions to constraints. The constraints
may take various forms, including, formulas in the propositional logic, linear
inequalities over the reals or integers, Boolean combination of linear
constraints. We describe some techniques and tools for solving the counting
problems, as well as some applications (e.g., applications to automated
reasoning, program analysis, formal verification and information security)