Lia Schütze
Scholar

Lia Schütze

Google Scholar ID: v8L7IhEAAAAJ
PhD Student, Max-Planck-Institute for Software Systems
formal methodsinfinite state systems
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
66
 
H-index
4
 
i10-index
3
 
Publications
8
 
Co-authors
0
 
Contact
Emaillschuetze@mpi-sws.orgGitHubOpen ↗
Publications
2 items
Bounded treewidth, multiple context-free grammars, and downward closures
2025
Cited
0
Well-Quasi-Orderings on Word Languages
2025
Cited
0
Resume (English only)
Academic Achievements
  • Publications:
  • - [PREPRINT/LICS 2024] VERIFYING UNBOUNDEDNESS VIA AMALGAMATION
  • - [PREPRINT/ICALP 2024] ON THE LENGTH OF STRONGLY MONOTONE DESCENDING CHAINS OVER ℕ^D
Research Experience
  • Conducting research in the field of models of computation, particularly in vector addition systems (VAS), pushdown automata (PDS), and valence systems.
Education
  • Pursuing a PhD at MPI-SWS, under the supervision of Georg Zetzsche.
Background
  • She is a PhD student in the MPI-SWS’s Models of Computation group, headed by Georg Zetzsche. She is interested in the theoretical aspects of different models and computation, their connection to logic and language theory, and the complexity and decidability of problems for these models. She is also interested in the application of these theoretical results to improve the safety and reliability of programs via program verification and synthesis.
Co-authors
0 total
Co-authors: 0 (list not available)