2025W

• Bachelor Thesis / 184.695 / PR
• Doctoral & Master Students Seminar / 181.224 / SE
• Formal Methods in Systems Engineering / 192.164 / VU
• Introduction to Logical Methods in Computer Science / 184.766 / VO
• Program Analysis / 192.168 / VU
• Project in Computer Science 1 / 192.021 / PR
• Project in Computer Science 2 / 192.022 / PR
• Research Seminar LogiCS / 184.767 / SE
• Seminar in Computer Science (Formal Methods in Systems Engineering) / 192.185 / SE
• Seminar in Logic (Formal Methods in Systems Engineering) / 192.184 / SE

2026S

• Bachelor Thesis / 184.695 / PR
• Doctoral & Master Students Seminar / 181.224 / SE
• Introduction to Logical Methods in Computer Science / 184.766 / VO
• Project in Computer Science 1 / 192.021 / PR
• Project in Computer Science 2 / 192.022 / PR
• Research Seminar LogiCS / 184.767 / SE
• Scientific Research and Writing / 193.052 / SE

• Automated Cost Analysis of Data Structures
  2023 – 2024 / Amazon Research Awards
• Automated Program Analysis for Bounds on Resource Consumption
  2013 – 2016 / Vienna Science and Technology Fund (WWTF)
  Publications: 28 / 56097
• Automatic Derivation of Loop Bounds for Worst Case Execution Time Analysis
  2009 – 2015 / MICROSOFT RESEARCH LIMITED

• Regular Grammars for Sets of Graphs of Tree-Width 2 / Bozga, M., Iosif, R., & Zuleger, F. (2025). Regular Grammars for Sets of Graphs of Tree-Width 2. In 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (pp. 704–717). IEEE. https://doi.org/10.1109/LICS65433.2025.00059