Jaroslav Bendík

Counting Minimal Unsatisfiable Subsets

2021 · Lecture notes in computer science

Abstract Given an unsatisfiable Boolean formula F in CNF, an unsatisfiable subset of clauses U of F is called Minimal Unsatisfiable Subset (MUS) if every proper subset of U is satisfiable. Since MUSes serve as …

Finding Regressions in Projects under Version Control Systems

2017 · arXiv (Cornell University)

Version Control Systems (VCS) are frequently used to support development of large-scale software projects. A typical VCS repository of a large project can contain various intertwined branches consisting of a large number of commits. If …