Anton Varonka
 |
University Assistant, MSc Institute of Logic and Computation Formal Methods in Systems Engineering (FORSYTE) group TU Wien Room: HD0323 |
Research Interests
Automated Verification, Decision Problems, Program Analysis, Algebraic Methods
Current Position
Since November 2021, I am a PhD candidate at the FORSYTE group at TU Wien, under the supervision of Laura Kovács. I am also part of the Doctoral College Logics for Computer Science at TU Wien (LogiCS@TUWien) that is co-funded by the EC H2020 Marie Skłodowska-Curie COFUND.
Education
MSc in Computer Science from Saarland University, 2021
BSc in Computer Science from Belarusian State University, 2019
Publications
For an up-to-date list of publications, please visit TU Wien Informatics | Anton Varonka.
George Kenison, Laura Kovács, Anton Varonka. From Polynomial Invariants to Linear Loops. ISSAC ’23: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation. July 2023
Laura Kovács and Anton Varonka. What Else is Undecidable about Loops? RAMICS ’23: Proceedings of the International Conference on Relational and Algebraic Methods in Computer Science. April 2023
Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, David Purser, Anton Varonka, Markus A. Whiteland, James Worrell. What’s Decidable About Linear Loops? POPL ’22: Proceedings of the 49th ACM SIGPLAN Symposium on Principles of Programming Languages. January 2022
Jarkko Kari, Andrew Ryzhikov, Anton Varonka. Words of Minimum Rank in Deterministic Finite Automata. DLT ’19: Developments in Language Theory, 23rd International Conference. August 2019
