As a technology ML is oblivious to societal good or bad, and thus, the field of fair machine
learning has stepped up to propose multiple mathematical definitions, algorithms, and …

Hyperproperties are properties of sets of computation traces. In this paper, we study
quantitative hyperproperties, which we define as hyperproperties that express a bound on …

Characterization of bugs and attack vectors is in many practical scenarios as important as
their finding. Recently, Girol et. al. have introduced the concept of robust reachability, which …

Quantitative information flow measurement techniques have been proven to be successful in
detecting leakage of confidential information from programs. Modern approaches are based …

Power side-channel attacks, capable of deducing secret using statistical analysis
techniques, have become a serious threat to devices in cyber-physical systems and the …

Recent work in weighted model counting proposed a unifying framework for dynamic-
programming algorithms. The core of this framework is a project-join tree: an execution plan …

Abstract Model counting, or counting solutions of a set of constraints, is a fundamental
problem in Computer Science with diverse applications. Since exact counting is …

Most software analysis techniques focus on bug reachability. However, this approach is not
ideal for security evaluation as it does not take into account the difficulty of triggering said …

Power side-channel attacks, capable of deducing secret data using statistical analysis, have
become a serious threat. Random masking is a widely used countermeasure for removing …

Abstract Stochastic Boolean Satisfiability (SSAT) is a powerful representation for the concise
encoding of quantified decision problems with uncertainty. While it shares commonalities …