- Hybrid Partial Order Reduction with Under-Approximate Dynamic Points-To and Determinacy Information2016 | Faculty of Mathematics and Physics
- A Sound Dynamic Partial Order Reduction Engine for Java Pathfinder2019 | Faculty of Mathematics and Physics
- Hybrid Analysis for Partial Order Reduction of Programs with Arrays2016 | Faculty of Mathematics and Physics
- CORES OVER RAMSEY STRUCTURES2021 | Faculty of Mathematics and Physics
- Subspace method for the estimation of large-scale structured real stability radius2022 | Faculty of Mathematics and Physics
- CONSTRAINT SATISFACTION PROBLEMS FOR REDUCTS OF HOMOGENEOUS GRAPHS2019 | Faculty of Mathematics and Physics
- The universal homogeneous binary tree2018 | Faculty of Mathematics and Physics
- Approximating Happens-Before Order: Interplay between Static Analysis and State Space Traversal2014 | Faculty of Mathematics and Physics
- Time discretizations for evolution problems2017 | Faculty of Mathematics and Physics
- Smooth Approximations and Relational Width Collapses2021 | Faculty of Mathematics and Physics
- Model Checking of Concurrent Programs with Static Analysis of Field Accesses2015 | Faculty of Mathematics and Physics
- Hrushovski's Encoding and ω-Categorical CSP Monsters2020 | Faculty of Mathematics and Physics
- WHEN SYMMETRIES ARE NOT ENOUGH: A HIERARCHY OF HARD CONSTRAINT SATISFACTION PROBLEMS2022 | Faculty of Mathematics and Physics
- Computing Approximate Happens-Before Order with Static and Dynamic AnalysisPublication without faculty affiliation