Publications

Franziska Alber · Theoretical Computer Science, University of Regensburg

ORCID · dblp

Conference Papers

Universality of 1-Variable Automata is Decidable

F. Alber, P. Rümmer

24th International Symposium on Automated Technology for Verification and Analysis (ATVA 2026), Hong Kong SAR, China, December 1–5, 2026To appear

Complementable Normal Form of Parametrized Automata

F. Alber, P. Rümmer

29th International Conference on Implementation and Application of Automata (CIAA 2025), Palermo, Italy, September 22–25, 2025 · Lecture Notes in Computer Science, Springer, pp. 1–14

Preprints

Verification of E-Voting Algorithms in Dafny

R. Büttner, F. F. Dießl, P. Janoschek, I. Kostadinovic, H. Oback, K. Voß, F. Alber, R. Herrmann, S. Möhle, P. Rümmer

arXiv:2512.21084, 2025

Thesis

Parametrized Automata over Infinite Alphabets: Properties and Complementation

Master's thesis, University of Regensburg, October 2024