2016/10/26 by Vladimir Klebanov, Alexander Weigl, Jörg Weisbarth
Computer Science · #cs.LO #cs.CR
paper · pdf · doi:10.4204/eptcs.227.2
published as EPTCS 227, 2016, pp. 15-29 · In Proceedings QAPL'16, arXiv:1610.07696
arxiv created 2016/10/26 · arxiv updated 2016/10/27
We present an improved method for a sound probabilistic estimation of the model count of a boolean formula under projection. The problem solved can be used to encode a variety of quantitative program analyses, such as concerning security of resource consumption. We implement the technique and discuss its application to quantifying information flow in programs.