Dear all, <br><br>I would like to know whether PPL library has built - in way to count the number of integers satisfying an abstract domain in PPL ? Say, a domain of Int64_box has a constraint <br>{x&lt;=2, -x&lt;=0} which has cardinality 3, for {x&gt;=0}, the cardinality would be 2ˆ32 if it is the greatest integer.  <br>
<br>The motivation is to roughly compare the precisions of two groups of analyses. <br><br>Thanks. <br><br>Zell.<br>