Jaroslav Bendík

According to our database, Jaroslav Bendík authored at least 18 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Hashing-based approximate counting of minimal unsatisfiable subsets.

Jaroslav Bendík, Kuldeep S. Meel

Formal Methods Syst. Des., October, 2024

2023

Overapproximation of Non-Linear Integer Arithmetic for Smart Contract Verification.

Petra Hozzová, Jaroslav Bendík, Alexander Nutz, Yoav Rodeh

Proceedings of the LPAR 2023: Proceedings of 24th International Conference on Logic for Programming, 2023

2022

Timed Automata Robustness Analysis via Model Checking.

Jaroslav Bendík, Ahmet Sencan, Ebru Aydin Gol, Ivana Cerná

Log. Methods Comput. Sci., 2022

2021

Timed Automata Relaxation for Reachability.

Jaroslav Bendík, Ahmet Sencan, Ebru Aydin Gol, Ivana Cerná

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2021

On Decomposition of Maximal Satisfiable Subsets.

Jaroslav Bendík

Proceedings of the Formal Methods in Computer Aided Design, 2021

Counting Minimal Unsatisfiable Subsets.

Jaroslav Bendík, Kuldeep S. Meel

Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

Counting Maximal Satisfiable Subsets.

Jaroslav Bendík, Kuldeep S. Meel

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

MUST: Minimal Unsatisfiable Subsets Enumeration Tool.

Jaroslav Bendík, Ivana Cerná

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2020

Rotation Based MSS/MCS Enumeration.

Jaroslav Bendík, Ivana Cerna

Proceedings of the LPAR 2020: 23rd International Conference on Logic for Programming, 2020

Replication-Guided Enumeration of Minimal Unsatisfiable Subsets.

Jaroslav Bendík, Ivana Cerná

Proceedings of the Principles and Practice of Constraint Programming, 2020

Approximate Counting of Minimal Unsatisfiable Subsets.

Jaroslav Bendík, Kuldeep S. Meel

Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

2018

Online Enumeration of All Minimal Inductive Validity Cores.

Jaroslav Bendík, Elaheh Ghassabani, Michael W. Whalen, Ivana Cerná

Proceedings of the Software Engineering and Formal Methods - 16th International Conference, 2018

Evaluation of Domain Agnostic Approaches for Enumeration of Minimal Unsatisfiable Subsets.

Jaroslav Bendík, Ivana Cerna

Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

Finding Regressions in Projects under Version Control Systems.

Jaroslav Bendík, Nikola Benes, Ivana Cerná

Proceedings of the 13th International Conference on Software Technologies, 2018

Recursive Online Enumeration of All Minimal Unsatisfiable Subsets.

Jaroslav Bendík, Ivana Cerná, Nikola Benes

Proceedings of the Automated Technology for Verification and Analysis, 2018

2017

Consistency checking in requirements analysis.

Jaroslav Bendík

Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, Santa Barbara, CA, USA, July 10, 2017

2016

Finding Boundary Elements in Ordered Sets with Application to Safety and Requirements Analysis.

Jaroslav Bendík, Nikola Benes, Jiri Barnat, Ivana Cerná

Proceedings of the Software Engineering and Formal Methods - 14th International Conference, 2016

Tunable Online MUS/MSS Enumeration.

Jaroslav Bendík, Nikola Benes, Ivana Cerná, Jiri Barnat

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016