VLDB 2026 Research / reviewers in the wild / expert
Mihály Dobos-Kovács
dblp:311/9992
· DBLP profile ↗
5ranked-venue papers
0as first author
5since 2021 · last 2026
0000-0002-0064-2965ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 5 · 5 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Unified Timing-Aware Program Verification
Dóra Cziborová, Mihály Dobos-Kovács, Kristóf Marussy, András Vörös 0001 |
FASE | 2 |
| 2026 | EmergenTheta: Experimental Analyses within the Theta Framework (Competition Contribution)
Milán Mondok, Csanád Telbisz, Levente Bajczi, Dániel Kovács, Mihály Dobos-Kovács, Vince Molnár |
TACAS (2) | 5 |
| 2024 | EmergenTheta: Verification Beyond Abstraction Refinement (Competition Contribution)abstractAbstract Thetais a model checking framework conventionally based on abstraction refinement techniques. While abstraction is useful for a large number of verification problems, the over-reliance on the technique led toThetabeing unable to meaningfully adapt. Identifying this problem in previous years of SV-COMP has led us to createEmergenTheta, a sandbox for the new approaches we wantThetato support. By differentiating between mature and emerging techniques, we can experiment more freely without hurting the reliability of the overall framework. In this paper we detail the development route toEmergenTheta, and its first debut on SV-COMP’24 in the ReachSafety category. Levente Bajczi, Dániel Szekeres, Milán Mondok, Zsófia Ádám, Márk Somorjai, Csanád Telbisz, Mihály Dobos-Kovács, Vince Molnár |
TACAS (3) | 7 |
| 2024 | Theta: Abstraction Based Techniques for Verifying Concurrency (Competition Contribution)abstractAbstract Thetais a model checking framework, with a strong emphasis on effectively handling concurrency in software using abstraction refinement algorithms. In SV-COMP 2024, we use 1) an abstraction-aware partial order reduction; 2) a dynamic statement reduction technique; and 3) enhanced support for call stacks to handle recursive programs. We integrate these techniques in an improved architecture with inherent support for portfolio-based verification using dynamic algorithm selection, with a diverse selection of supported SMT solvers as well. In this paper we detail the advances ofThetaregarding concurrent and recursive software support. Levente Bajczi, Csanád Telbisz, Márk Somorjai, Zsófia Ádám, Mihály Dobos-Kovács, Dániel Szekeres, Milán Mondok, Vince Molnár |
TACAS (3) | 5 |
| 2022 | Theta: portfolio of CEGAR-based analyses with dynamic algorithm selection (Competition Contribution)abstractAbstract Theta is a model checking framework based on abstraction refinement algorithms. In SV-COMP 2022, we introduce: 1) reasoning at the source-level via a direct translation from C programs; 2) support for concurrent programs with interleaving semantics; 3) mitigation for non-progressing refinement loops; 4) support for SMT-LIB-compliant solvers. We combine all of the aforementioned techniques into a portfolio with dynamic algorithm selection. Zsófia Ádám, Levente Bajczi, Mihály Dobos-Kovács, Ákos Hajdu, Vince Molnár |
TACAS (2) | 3 |