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 solvi...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.展开更多
基金supported by the National Natural Science Foundation of China(Grant No.62202218)is sponsored by CCF-Huawei Populus Grove Fund(CCF-HuaweiFM202309).
摘要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.