Yannick Stade

Yannick Stade, M.Sc.

Technische Universität München

Informatik 2 - Lehrstuhl für Sprachen und Beschreibungsstrukturen in der Informatik (Prof. Seidl)

Postadresse

Postal:
Boltzmannstr. 3
85748 Garching b. München

Doctoral Representatives' Elections

I am looking forward to representing all of you again at the School of Computation, Information and Technology for one more year. I am an open and reliable person. I like the inspiration coming from getting to know new people. We are all totally different—I will try to represent the diversity of our department.

I studied to become a high school teacher in math and computer science at Julius-Maximilians-University Würzburg. I finished my teaching degree successfully in 2021. Afterwards, I continued with my master's degree in computer science. During my study time, I spent one and a half years abroad at Umeå University in northern Sweden, where I gained many life experiences.

Then, I decided to do my PhD and found an exciting position at Technical University of Munich at Prof. Seidl's chair (I2). Here, I am working mainly on formalising fix point algorithms that are a crucial part of the static analysis of programs.

We, as the computer science department, should have a strong voice in developing the school. My incentive is to represent all your interests such that everyone has the feeling that we are part of the school and can actively influence our surroundings. I am very much looking forward to contributing the experience I gained in my first year as a PhD representative.

The elections will take place via evasys.

Forschung

Interessen

Verifikation von Fixpunkt-Algorithmen mit Beweisassistenten wie Isabelle
Sprachtheoretische Eigenschaften von Graphenerweiterungsgrammatiken, die Hyperkanten-Ersetzungsgrammatiken ähnlich sind
Optimierung von Compilerstrukturen und Entwurf von Programmiersprachen für das Quantencomputing

Publikationen

Y. Stade, ‘Language Theoretic Properties of Graph Extension Languages: An Investigation of Graph Extension Grammars with Context Matching and Logic’, Thesis, 2022. [pdf]
S. Tilscher, Y. Stade, M. Schwarz, R. Vogler, and H. Seidl, ‘The Top-Down Solver—An Exercise in A²I’, in Challenges of Software Verification, V. Arceri, A. Cortesi, P. Ferrara, and M. Olliaro, Eds., in Intelligent Systems Reference Library, vol. 238. Singapore: Springer Nature Singapore, 2023, pp. 157–179. doi: 10.1007/978-981-19-9601-6_9.

Lehre

Abschlussarbeiten

Wenn du dich für eines meiner Forschungsgebiete interessierst, kannst du dich gerne an mich wenden. Meiner Meinung nach ist es wichtig, dass das Thema zu dir als Student*in passt und für unsere Forschung von Bedeutung ist. Daher gibt es keine Liste mit verfügbaren Themen. Stattdessen werden wir gemeinsam in einem kurzen Gespräch ein passendes Thema finden.

Abgeschlossene Abschlussarbeiten

L. Bao, 'Implementing an Intermediate Representation for Quantum Computing based on MLIR', BA Thesis, 2023. [pdf]
J. Marin, 'Adaptation of Classical Optimizations to Hybrid Quantum-Classical Programs', MA Thesis, 2023. [pdf]
J. Zuchna, 'Efficient Implementation of Constant Propagation for Quantum Circuits', BA Thesis, 2023. [pdf]
D. Fouzri, 'Hardware-Dependent Visualization of Quantum Circuits', BA Thesis, 2023. [pdf]
A. Manucharyan, 'Demand-driven Entangling Weighted Decision Diagrams for Quantum Simulation', BA Thesis, 2023. [pdf]