About Me

Since 2023, I am a tenured associate professor (Maîtresse de Conférences) at Université Paris Cité and a member of the automata and applicatons team of IRIF.

From 2019 to 2023, I was a postdoctoral researcher in the team of Emmanuel Filiot in the Formal Methods and Verification group at Université libre de Bruxelles.

Between 2014 and 2018, I did my PhD in Computer Science under the supervision of Christof Löding in the Logic and Theory of Discrete Systems group at RWTH Aachen University. Before that, I studied Computer Science, also at RWTH Aachen University.

In my free time I enjoy taking 360° and drone photos. Have a look at my Instagram feeds sarah.tinyplanets and drone.and.sea. Or visit my pixelfed account sarah_360 instead.

Publications

See my profiles on DBLP / Scholar / Orcid.

Preprints

• Sarah Winter and Martin Zimmermann.
  Tracy, Traces, and Transducers: Computable Counterexamples and Explanations for HyperLTL Model-Checkings. [arxiv]

Journal Papers

• Emmanuel Filiot and Sarah Winter.
  Synthesizing Computable Functions from Rational Specifications over Infinite Words.
  International Journal of Foundations of Computer Science Vol. 35 (2024). [doi] [arxiv]
• Sarah Winter and Martin Zimmermann.
  Weak Muller Conditions Make Delay Games Hard.
  Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore Vol. 42 (2023). [doi] [arxiv]
• Christof Löding and Sarah Winter.
  Resynchronized Uniformization and Definability Problems for Rational Relations.
  Discrete Mathematics and Theoretical Computer Science Vol. 25 (2023). [doi] [arxiv]
• Sarah Winter and Martin Zimmermann.
  Finite-state Strategies in Delay Games.
  Information and Computation Vol. 272 (2020). [doi] [arxiv]
• Christof Löding and Sarah Winter.
  Synthesis of deterministic top-down tree transducers from automatic tree relations.
  Information and Computation Vol. 253 (2017). [doi] [pdf]

Conference Papers

• Emmanuel Filiot, Ismaël Jecker, Christof Löding, Anca Muscholl, Gabriele Puppis and Sarah Winter.
  Finite-valued Streaming String Transducers..
  LICS 2024. [doi] [arxiv]
• Martin Fränzle, Sarah Winter and Martin Zimmermann.
  Strategies Resilient to Delay: Games under Delayed Control vs. Delay Games.
  GandALF 2023. [doi] [arxiv]
• Oliver Carton, Gaëtan Douéneau-Tabot, Emmanuel Filiot and Sarah Winter.
  Deterministic regular functions of infinite words.
  ICALP 2023. [doi] [arxiv]
• Emmanuel Filiot, Ismaël Jecker, Christof Löding and Sarah Winter.
  A Regular and Complete Notion of Delay for Streaming String Transducers.
  STACS 2023. [doi] [arxiv]
• Emmanuel Filiot and Sarah Winter.
  Synthesizing Computable Functions from Rational Specifications over Infinite Words.
  FSTTCS 2021. [doi] [arxiv]
• Sarah Winter.
  Decision Problems for Origin-Close Top-Down Tree Transducers.
  MFCS 2021. [doi] [arxiv]
• Emmanuel Filiot, Christof Löding and Sarah Winter.
  Synthesis from Weighted Specifications with Partial Domains over Finite Words.
  FSTTCS 2020. [doi] [arxiv]
• Sarah Winter.
  Uniformization Problems for Synchronizations of Automatic Relations on Words.
  ICALP 2018.  Best Student Paper  [doi] [arxiv]
• Emmanuel Filiot, Ismaël Jecker, Christof Löding and Sarah Winter.
  On Equivalence and Uniformisation Problems for Finite Transducers.
  ICALP 2016. [doi] [arxiv]
• Christof Löding and Sarah Winter.
  Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers.
  MFCS 2016. [doi] [full version]
• Christof Löding and Sarah Winter.
  Synthesis of deterministic top-down tree transducers from automatic tree relations.
  GandALF 2014. [doi]

Workshop Papers

• Alex Spelten, Wolfgang Thomas and Sarah Winter.
  Trees over Infinite Structures and Path Logics with Synchronization.
  INFINITY 2011. [doi]

Theses

• Sarah Winter.
  Synthesis of transducers from relations on finite words and trees.
  Doctoral thesis, RWTH Aachen University, 2018. [doi] [errata]
• Sarah Winter.
  Uniformization of Automaton Definable Tree Relations.
  Master’s thesis, RWTH Aachen University, 2013. [pdf] [errata]
• Sarah Winter.
  Finite Automata over Infinite Alphabets.
  Bachelor’s thesis, RWTH Aachen University, 2011. [pdf]

Selected Talks

• Finite-valued Streaming String Transducers. RAMiCS & AiML 2024, August 2024, Prague, Czech Republic. [slides]
• A Regular and Complete Notion of Delay for Streaming String Transducers. [slides]
• Unambiguity in Transducer Theory. Dagstuhl Seminar on Unambiguity in Automata Theory, November 2021, Wadern, Germany. [slides]
• Decision Problems for Origin-Close Top-Down Tree Transducers. Spotlight on Transducers, MFCS, August 2021, online. [slides]
• Synthesis of Computable Functions. Spotlight on Transducers, Highlights Satellite Workshop, March 2021, online. [slides]
• Synthesizing computable functions from synchronous specifications. Online Worldwide Seminar on Logic and Semantics (OWLS), January 2021, online. [slides]
• Synthesis from Weighted Specifications with Partial Domains over Finite Words. FSTTCS 2020, December 2020, online. [slides] [short-slides] [highlights-poster]

Contact

sarah [dot] winter [at] irif [dot] fr

See on my IRIF site.

 

---

Made with Jekyll using the Researcher theme. Last updated on September 3, 2024.