Publications | Jaroslav Bendík

Jaroslav Bendík (2021). On Decomposition of Maximal Satisfiable Subsets. In FMCAD'21.

Jaroslav Bendík, Kuldeep S. Meel (2021). Counting Minimal Unsatisfiable Subsets. In CAV'21.

Jaroslav Bendík, Ahmet Sencan, Ebru Aydin Gol, Ivana Černá (2021). Timed Automata Relaxation for Reachability. In TACAS'21.

Jaroslav Bendík (2021). Minimal Sets over a Monotone Predicate: Enumeration and Counting. Dissertation thesis, Masaryk University.

Jaroslav Bendík, Kuldeep S. Meel (2021). Counting Maximal Satisfiable Subsets. In AAAI'21.

Jaroslav Bendík, Ivana Černá (2020). Replication-Guided Enumeration of Minimal Unsatisfiable Subsets. In CP'20.

Jaroslav Bendík, Kuldeep S. Meel (2020). Approximate Counting of Minimal Unsatisfiable Subsets. In CAV'20.

Jaroslav Bendík, Ivana Černá (2020). Rotation Based MSS/MCS Enumeration. In LPAR'20.

Jaroslav Bendík, Ivana Černá (2020). MUST: Minimal Unsatisfiable Subsets Enumeration Tool. In TACAS'20.

Jaroslav Bendík, Ivana Černá, Nikola Beneš (2018). Recursive Online Enumeration of All Minimal Unsatisfiable Subsets. In ATVA'18.

Jaroslav Bendík, Elaheh Ghassabani, Michael W. Whalen, Ivana Černá (2018). Online Enumeration of All Minimal Inductive Validity Cores. In SEFM'18.

Jaroslav Bendík, Nikola Beneš, Ivana Černá (2018). Finding Regressions in Projects under Version Control Systems. In ICSOFT'18.

Jaroslav Bendík, Ivana Černá (2018). Evaluation of Domain Agnostic Approaches for Enumeration of Minimal Unsatisfiable Subsets. In LPAR'18.

Jaroslav Bendík (2017). Consistency checking in requirements analysis. In ISSTA'17.

Jaroslav Bendík, Nikola Beneš, Ivana Černá, Jiří Barnat (2016). Tunable Online MUS/MSS Enumeration. In FSTTCS'16.

Jaroslav Bendík, Nikola Beneš, Jiří Barnat, Ivana Černá (2016). Finding Boundary Elements in Ordered Sets with Application to Safety and Requirements Analysis. In SEFM'16.