Sarah Winter

Sarah Winter is a tenured Associate Professor (Maîtresse de Conférences) at Université Paris Cité and a member of the Automata and Applications team at IRIF (Institut de Recherche en Informatique Fondamentale). Previously, she was a postdoctoral researcher at Université libre de Bruxelles (2019–2023) in the Formal Methods and Verification group, and she completed her PhD in Computer Science at RWTH Aachen University under Christof Löding (2014–2018).

• Doctoral Degree: Computer Science, RWTH Aachen University, 2018
• Master’s Degree: Computer Science, RWTH Aachen University, 2013
• Bachelor’s Degree: Computer Science, RWTH Aachen University, 2011

Her research lies at the intersection of theoretical computer science, logic, and automata theory. She focuses on transducer synthesis, formal verification, streaming string transducers, delay games, and hyperproperties. Her work explores the computability and definability of functions and relations over infinite words and trees, often using logical and automata-theoretic frameworks. She investigates how systems can be synthesized from specifications, especially under constraints like delay or partial observability.

Her recent publications, appearing in top-tier journals and conferences such as LMCS, TheoretiCS, LICS, and ICALP, show a consistent trend toward formal models of computation involving transducers, games with delay, and logical synthesis. Keywords across her work include reactive synthesis, automata on infinite structures, function uniformization, and model checking for hyperlogics. Her collaborations with researchers like Martin Zimmermann and Emmanuel Filiot reflect a strong network in European formal methods.

• Best Student Paper Award, MFCS 2018

Sarah Winter has advised students at the Master’s and PhD levels, as evidenced by her own academic lineage and supervision roles in publications, though no explicit list of advisees is provided. She has not mentioned specific grants, but her postdoctoral and faculty positions suggest funding support. She is actively involved in the theoretical computer science community, giving talks at international venues and workshops.

She is a core member of the Automata and Applications team at IRIF, contributing to research on automata theory and its applications in verification and programming languages. Her work forms part of a broader effort to develop rigorous foundations for computing systems.