The problem of model counting, also known as, is to compute the number of models or
satisfying assignments of a given Boolean formula F. Model counting is a fundamental …

The problem of model counting, ie, counting satisfying assignments of a Boolean formula, is
a fundamental problem in computer science, with diverse applications. Given# P-hardness …

This work presents insights gained by investigating the relationship between algorithmic
fairness and the concept of secure information flow. The problem of enforcing secure …

Given a system of constraints over a set X of variables, projected model counting asks us to
count satisfying assignments of the constraint system projected on a subset P of X. A key …

Context: More often than not, the algorithms implemented by software systems continue to
operate correctly when executed on different platforms or with different inputs, and can be …

Most formal methods see the correctness of a software system as a binary decision.
However, proving the correctness of complex systems completely is difficult because they …

This work presents results on the use of Information-Flow tools for the formal verification of
algorithmic fairness properties. The problem of enforcing secure information-flow was …

Abstract Satisfiability Modulo Theory (SMT) solvers have significantly advanced automated
reasoning due to their effectiveness in solving problems across various fields. With the …

Abstract Satisfiability Modulo Theory (SMT) solvers have transformed the field of automated
reasoning owing to their established efficiency in handling problems arising from diverse …

I'm working on building algorithms and software for counting over SMT constraints with Dr.
Kuldeep S. Meel, assistant professor at National University of Singapore. In simple terms …