| Recursive online enumeration of all minimal unsatisfiable subsets J Bendík, I Černá, N Beneš Automated Technology for Verification and Analysis: 16th International …, 2018 | 30 | 2018 |
| MUST: Minimal Unsatisfiable Subsets Enumeration Tool J Bendík, I Černá International Conference on Tools and Algorithms for the Construction and …, 2020 | 28 | 2020 |
| Tunable online MUS/MSS enumeration J Bendík, N Benes, I Cerná, J Barnat 36th IARCS Annual Conference on Foundations of Software Technology and …, 2016 | 21 | 2016 |
| Consistency checking in requirements analysis J Bendík Proceedings of the 26th ACM SIGSOFT international symposium on software …, 2017 | 17 | 2017 |
| Approximate counting of minimal unsatisfiable subsets J Bendík, KS Meel Computer Aided Verification: 32nd International Conference, CAV 2020, Los …, 2020 | 16 | 2020 |
| Replication-guided enumeration of minimal unsatisfiable subsets J Bendík, I Černá Principles and Practice of Constraint Programming: 26th International …, 2020 | 16 | 2020 |
| Online enumeration of all minimal inductive validity cores J Bendík, E Ghassabani, M Whalen, I Černá Software Engineering and Formal Methods: 16th International Conference, SEFM …, 2018 | 16 | 2018 |
| Rotation Based MSS/MCS Enumeration J Bendık, I Cerná LPAR. EPiC Series in Computing 73, 120-137, 2020 | 14 | 2020 |
| Evaluation of Domain Agnostic Approaches for Enumeration of Minimal Unsatisfiable Subsets. J Bendík, I Cerná LPAR, 131-142, 2018 | 13 | 2018 |
| Counting Maximal Satisfiable Subsets J Bendık, KS Meel | 7 | 2021 |
| Timed Automata Robustness Analysis via Model Checking J Bendík, A Sencan, EA Gol, I Černá Logical Methods in Computer Science 18, 2022 | 6 | 2022 |
| Timed Automata Relaxation for Reachability J Bendík, A Sencan, EA Gol, I Černá International Conference on Tools and Algorithms for the Construction and …, 2021 | 6 | 2021 |
| Overapproximation of Non-Linear Integer Arithmetic for Smart Contract Verification P Hozzová, J Bendík, A Nutz, Y Rodeh arXiv preprint arXiv:2402.10174, 2024 | 5 | 2024 |
| Counting minimal unsatisfiable subsets J Bendík, KS Meel Computer Aided Verification: 33rd International Conference, CAV 2021 …, 2021 | 5 | 2021 |
| Finding boundary elements in ordered sets with application to safety and requirements analysis J Bendík, N Beneš, J Barnat, I Černá Software Engineering and Formal Methods: 14th International Conference, SEFM …, 2016 | 5 | 2016 |
| Finding Regressions in Projects under Version Control Systems J Bendik, N Benes, I Cerna 13th International Conference on Software Technologies, ICSOFT 2018, 186--197, 2017 | 4 | 2017 |
| MINIMAL SETS OVER A MONOTONE PREDICATE: Enumeration and Counting J Bendík https://is.muni.cz/auth/th/y4v8m/dissertationRevised.pdf, 0 | 3* | |
| On Decomposition of Maximal Satisfiable Subsets J Bendík 2021 Formal Methods in Computer Aided Design (FMCAD), 212-221, 2021 | 2 | 2021 |
| Hashing-based approximate counting of minimal unsatisfiable subsets J Bendík, KS Meel Formal Methods in System Design, 1-35, 2023 | | 2023 |
| Timed Automata Robustness Analysis via Model Checking J Bendík, A Sencan, EA Gol, I Černá arXiv preprint arXiv:2108.08018, 2021 | | 2021 |
Ivana CernaMasaryk University, Brno, Czech RepublicVerified email at fi.muni.cz
