Maximum satisfiability (MaxSAT) is an optimization version of SAT that is solved by finding
an optimal truth assignment instead of just a satisfying one. In MaxSAT the objective function …

A central challenge in software analysis concerns balancing different competing tradeoffs.
To address this challenge, we propose an approach based on the Maximum Satisfiability …

Boolean satisfiability (SAT) solvers allow for incremental computations, which is key to
efficient employment of SAT solvers iteratively for develo** complex decision and …

Recent advances in solvers for the Boolean satisfiability (SAT) based optimization paradigm
of maximum satisfiability (MaxSAT) have turned MaxSAT into a viable approach to finding …

Conventional program analyses have made great strides by leveraging logical reasoning.
However, they cannot handle uncertain knowledge, and they lack the ability to learn and …

This paper aims to improve the efficiency of unsat core-guided MaxSAT solving on a
sequence of similar problem instances. In particular, we consider the case when the …

This chapter brings a short introduction into the presented research thesis, as well as a brief
discussion regarding the role of optimization and operations research into computational …

Since the widespread adoption of multi-core architectures at the turn of the millennium,
parallel and concurrent programming paradigms, such as multi-threaded programming …

Building a successful program analysis requires solving high-level conceptual issues, such
as finding an abstraction of programs that keeps just enough information for a given …