Tensor-based reliability analysis of complex static fault trees. - Dániel Szekeres; Kristóf Marussy; István Majzik (EDCC, 2021)

Towards Abstraction-based Probabilistic Program Analysis. - Dániel Szekeres; István Majzik (Acta Cybern., 2023)

A Lazy Abstraction Algorithm for Markov Decision Processes - Theory and Initial Evaluation. - Dániel Szekeres; Kristóf Marussy; István Majzik (ASMTA, 2024)

EmergenTheta: Verification Beyond Abstraction Refinement (Competition Contribution). - 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), 2024)

Theta: Abstraction Based Techniques for Verifying Concurrency (Competition Contribution). - 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), 2024)

Enhancing MBSE Education with Version Control and Automated Feedback. - Levente Bajczi; Dániel Szekeres; Daniel Siegl; Vince Molnár (CoRR, 2024)

Reasoning with Happens-Before Relations About Concurrent Programs in the THETA Framework. - Csanád Telbisz; Levente Bajczi; Dániel Szekeres; András Vörös 001; István Majzik (DSN-W, 2025)

On Stability in a Happens-Before Propagator for Concurrent Programs (Reproducibility Study). - Levente Bajczi; Csanád Telbisz; Dániel Szekeres; András Vörös 001 (TACAS (1), 2025)

EmergenTheta: Variations on Symbolic Transition Systems (Competition Contribution). - Milán Mondok; Levente Bajczi; Dániel Szekeres; Vince Molnár (TACAS (3), 2025)

Theta: Various Approaches for Concurrent Program Verification (Competition Contribution). - Csanád Telbisz; Levente Bajczi; Dániel Szekeres; András Vörös 001 (TACAS (3), 2025)