Embedded Files
I am currently a postdoc working with Stefan Dziembowski at University of Warsaw. My current work focuses on formal verification of cryptographic protocols. My other research intrests include logic, transducers, and automata.
I am currently a postdoc working with Stefan Dziembowski at University of Warsaw. My current work focuses on formal verification of cryptographic protocols. My other research intrests include logic, transducers, and automata.
Projects:
Projects:
Structure and power
Structure and power
My part in this larger project, led by Samson Abramsky, focuses on two areas:
Investigating the connections between transducers and comonads.
Applying game semantics to describe the class of single-use functions (see section single-use registers for more details).
Talks:
Single-use registers
Single-use registers
In this project, together with Mikołaj Bojańczyk and Nathan Lhote, we have studied single-use register automata (and transducers). The model is very similar to standard register automata introduced by Kaminski and Francez, with the modification that every read access to a register deletes its contents.
Articles:
Single-use automata and transducers for infinite alphabets. By Bojańczyk, S. (ICALP 2020)
An Automaton model for orbit-finite monoids (my master thesis)
Talks:
Resources and Co-Resources 2023 — Single-Use Restriction vs. Associativity (slides)
Regular Transformations 2023 — An Algebraic Theory For Single-Use Transdcuers Over Data Words (slides)
Highlights 2021 – Single-use register automata and orbit-finite semigroups for total-order atoms (slides, poster)
Spotlights on Transducers 2021 -- Single-use transducers for data words (slides)
Highlights 2020 – Single-use automata and transducers for infinite alphabets (slides, poster)
ICALP 2020 - Single-use automata and transducers for infinite alphabets (slides)
Trends in Transformations 2019 — Transducers with atoms (slides)
Highlights 2019 — Single-use register automata for data words (slides)
Papers
Papers
Monads, comonads, and transducers. S. (Preprint 2024)
Function spaces for orbit finite sets. Bojańczyk, Nguyên, S. (ICALP 2024)
The single-use restriction for register automata and transducers. S. (My PhD Thesis 2023. Supervised by M. Bojańczyk).
Single-use automata and transducers for infinite alphabets. Bojańczyk, S. (ICALP 2020)
Extensions of ω-Regular Languages. Bojańczyk, Kelmendi, S. , Zetzsche (LICS 2020)
An Automaton model for orbit-finite monoids (My master's thesis 2018. Supervised by M. Bojańczyk).
Contact: rafal.stefanski@mimuw.edu.pl
Page updated
Google Sites
Report abuse