TU Wien Informatics

Overview Professors Scientific Staff Administrative Staff Student Staff External Lecturers By Responsibilities By Committee By Name
Related
Guest Professors Honoraries Alumni (LinkedIn) #5qw

Anton Varonka

Univ.Ass. / MSc

Research Areas

  • program analysis, computer algebra, Automated Reasoning, Formal Methods, logic in computer science
Anton Varonka

Role

Contact

  • Determination Problems for Orbit Closures and Matrix Groups / El Manssour, R. A., Kenison, G., Shirmohammadi, M., Varonka, A., & Worrell, J. B. (2026). Determination Problems for Orbit Closures and Matrix Groups. In M. Hicks (Ed.), Proceedings of the ACM on Programming Languages (pp. 1615–1640). Association for Computing Machinery. https://doi.org/10.1145/3776698
    Projects: ARTIST (2021–2026) / LCS (2017–2025)
  • On Piecewise Affine Reachability with Bellman Operators / Varonka, A., & Watanabe, K. (2025). On Piecewise Affine Reachability with Bellman Operators. In 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025) (pp. 92:1-92:18). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2025.92
    Projects: ARTIST (2021–2026) / LCS (2017–2025)
  • Simple Linear Loops: Algebraic Invariants and Applications / Ait El Manssour, R., Kenison, G., Shirmohammadi, M., & Varonka, A. (2025). Simple Linear Loops: Algebraic Invariants and Applications. In M. Hicks (Ed.), Proceedings of the ACM on Programming Languages (pp. 745–771). Association for Computing Machinery. https://doi.org/10.1145/3704862
    Download: PDF (842 KB)
    Projects: ARTIST (2021–2026) / LCS (2017–2025) / ProbInG (2020–2025)
  • Simple Linear Loops: Algebraic Invariants and Synthesis / Ait El Manssour, R., Kenison, G. J., Shirmohammadi, M., & Varonka, A. (2024, September 19). Simple Linear Loops: Algebraic Invariants and Synthesis [Presentation]. 18th International Conference on Reachability Problems (RP 2024), Wien, Austria. https://doi.org/10.1007/978-3-031-72621-7
    Projects: ARTIST (2021–2026) / LCS (2017–2025) / ProbInG (2020–2025)
  • Linear Loop Synthesis for Quadratic Invariants / Hitarth, S., Kenison, G. J., Kovacs, L., & Varonka, A. (2024). Linear Loop Synthesis for Quadratic Invariants. In O. Beyersdorff, M. M. Kanté, O. Kupferman, & D. Lokshtanov (Eds.), 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2024.41
    Download: PDF (780 KB)
    Projects: ARTIST (2021–2026) / LCS (2017–2025) / ProbInG (2020–2025)
  • From Polynomial Invariants to Linear Loops / Kenison, G. J., Kovacs, L., & Varonka, A. (2023). From Polynomial Invariants to Linear Loops. In A. Dickenstein, E. Tsigaridas, & G. Jeronimo (Eds.), ISSAC ’23: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (pp. 398–406). Association for Computing Machinery. https://doi.org/10.1145/3597066.3597109
    Projects: ARTIST (2021–2026) / LCS (2017–2025) / ProbInG (2020–2025)
  • What Else is Undecidable About Loops? / Kovács, L., & Varonka, A. (2023). What Else is Undecidable About Loops? In R. Glück, L. Santocanale, & M. Winter (Eds.), Relational and Algebraic Methods in Computer Science. RAMiCS 2023 (pp. 176–193). Springer. https://doi.org/10.1007/978-3-031-28083-2_11
    Projects: ARTIST (2021–2026) / ProbInG (2020–2025)
  • On the Undecidability of Loop Analysis / Varonka, A., & Kovacs, L. (2022, October 12). On the Undecidability of Loop Analysis [Conference Presentation]. Reachability Problems, Kaiserslautern, Germany. https://doi.org/10.1007/978-3-031-19135-0
  • Best MFCS student paper
    2025 / European Association for Theoretical Computer Science / Poland / Website

Soon, this page will include additional information such as reference projects, activities as journal reviewer and editor, memberships in councils and committees, and other research activities.

Until then, please visit Anton Varonka’s research profile in TISS .