activity
20162024
most citedTimed Automata Robustness Analysis via Model Checking

6 citations · 8 across the 4 of their papers we have counts for

collaborators

5 papers

cs.LO2024★ 2 cited

Overapproximation of Non-Linear Integer Arithmetic for Smart Contract Verification

Petra Hozzová, Jaroslav Bendík, Alexander Nutz +1

The need to solve non-linear arithmetic constraints presents a major obstacle to the automatic verification of smart contracts. In this case study we focus on the two overapproxima…

cs.LO2021★ 6 cited

Timed Automata Robustness Analysis via Model Checking

Jaroslav Bendík, Ahmet Sencan, Ebru Aydin Gol +1

Timed automata (TA) have been widely adopted as a suitable formalism to model time-critical systems. Furthermore, contemporary model-checking tools allow the designer to check whet…

cs.SE2017

Finding Regressions in Projects under Version Control Systems

Jaroslav Bendik, Nikola Benes, Ivana Cerna

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 intertwin…

cs.LO2017

Recursive Online Enumeration of All Minimal Unsatisfiable Subsets

Jaroslav Bendik, Ivana Cerna, Nikola Benes

In various areas of computer science, we deal with a set of constraints to be satisfied. If the constraints cannot be satisfied simultaneously, it is desirable to identify the core…

cs.AI2016

Tunable Online MUS/MSS Enumeration

Jaroslav Bendik, Nikola Benes, Ivana Cerna +1

In various areas of computer science, the problem of dealing with a set of constraints arises. If the set of constraints is unsatisfiable, one may ask for a minimal description of…