# Sergey Goncharov

FAU Erlangen-Nürnberg | Room: |
11.156 | |

Chair for Theoretical Computer Science | Phone: |
+49-91-3185-64031 | |

Martenstraße 3 | Fax: |
+49-91-3185-64055 | |

D-91058 Erlangen | E-Mail: |
Sergey.Goncharov@fau.de |

# About me

I am a researcher at Chair for Theoretical Computer Science of Friedrich-Alexander University of Erlangen and Nürnberg. My research interests include (but not limited to):

- computational monads and side-effects
- program logics (with side-effects)
- semantics and foundations of computations
- (universal) algebra, coalgebra, and category theory
- hybrid systems

# Committees

- Combined 30th International Workshop on Expressiveness in Concurrency and 20th Workshop on Structural Operational Semantics (EXPRESS/SOS 2023), PC member
- Mathematical Foundations of Programming Semantics (MFPS 2023), PC member
- 18th International Colloquium on Theoretical Aspects of Computing (ICTAC 2021), PC member
- 8th ACM SIGPLAN Workshop on Higher-Order Programming with Effects (HOPE 2020), PC member
- 3rd IFIP Conference on Topics in Theoretical Computer Science (TTCS 2020), PC member
- 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019), PC member
- Foundations of Software Science and Computation Structures (FoSSaCS 2019), PC member
- Mathematical Foundations of Programming Semantics (MFPS 2018), PC member
- Coalgebraic Methods in Computer Science (CMCS 2018), PC member

# Mission

I am concerned with the basic research in the area of formal semantics of specification and programming languages. My work is thus oriented towards identification of the general idioms and principles pervasively appearing in these areas, to allow for a conceptual unification of various approaches to ensure both a high level of generality and practical meaningfulness.

With this in mind, I am studying and contributing *process algebra*, *computational monads*, *fixpoint calculi*, *Kleene algebra*, *formal languages* and *automata theory*.

In more detail, my view is recently summarized in the abstract to my habilitation thesis. My recent work revolves around the notion of *guarded traced monoidal category*.

# News

*Bialgebraic Reasoning on Higher-order Program Equivalence*accepted at LICS 2024- I will be an invited speaker at RAMiCS 2024
*Logical Predicates in Higher-Order Mathematical Operational Semantics*accepted at FOSSACS 2024- DFG-Funded Project `Abstract Techniques for Programming Languages and Secure Compilation (ATLaS)` (jointly with Stelios Tsampas) granted
*Representing Guardedness in Call-by-Value*accepted at FSCD 2023*Weak Similarity in Higher-Order Mathematical Operational Semantics*(Henning Urbat, Stelios Tsampas, Sergey Goncharov, Stefan Milius, Lutz Schröder) accepted at LICS 2023*Kantorovich Functors and Characteristic Logics for Behavioural Distances*accepted at FOSSACS 2023- Towards a Higher-Order Mathematical Operational Semantics accepted at POPL 2023
- Quantitative Hennessy-Milner Theorems via Notions of Density accepted at CSL 2023
- DFG-Project
*Higher-Order Monad-based Programming and Reasoning (HOMBRe)*granted - Uniform Elgot Iteration in Foundations accepted for ICALP 2021

# Publications

**Here** is the list of my scientific publications. Cf. me on **DBLP** and on **ResearchGate**.

# Recent Talks

- Kleene Monads in a Short While at Oberseminar Theoretische Informatik
- Representing Guardedness in Call-by-Value at FSCD 2023
- Tensors of Computational Effects and a Logic for Probabilistic Traces at the Emmy-Noether-Seminar, Department Mathematik, FAU Erlangen-Nürnberg
- Towards a Higher-Order Mathematical Operational Semantics at the Topos Institute
- Kleene Monads in a Long While at Oberseminar Theoretische Informatik
- Towards a Higher-Order Mathematical Operational Semantics at Icelandic Centre of Excellence TCS Seminar
- Representing Guardedness at Tallinn University of Technology’s TCS Seminar
- Computational Adequacy and Choice: How Deep is the Rabbit Hole? at Oberseminar Theoretische Informatik
- Uniform Elgot Iteration in Foundations at ICALP 2021 (narrated slides)
- Local Local Reasoning: A BI-Hyperdoctrine for Full Ground Store at FoSSaCS 2020
- Towards Constructive Hybrid Semantics at FSCD 2020 (narrated slides)
- Towards Constructive Hybrid Semantics at Oberseminar Theoretische Informatik
- Towards Coherence for Guarded Traces presented at the LFCS Seminar in the University of Edinburgh
- Unifying Notions of Feedback presented at the FAU Tag der Informatik 2019
- An Adequate Semantics for Hybrid While presented at the 16th Workshop on Quantitative Aspects of Programming Languages and Systems
- Guarded traced categories for recursion and iteration presented at the Icelandic Centre of Excellence TCS Seminar
- Towards Coherence for Guarded Traces presented at the Birmingham School of Computer Science Theory Seminar
- From Delay Monad to Duration Monad: An Excursion into Non-Inductive Semantics presented at the Chair Seminar
- A Metalanguage for Guarded Iteration presented at ICTAC 2018
- Equational Theories for Real-Time Coalgebraic State Machines presented at
*Algebra and Coalgebra in Languages and Automata Workshop*associated with ICTAC 2018 - A Semantics for Hybrid Iteration presented at CONCUR 2018
- A Metalanguage for Guarded Iteration presented at HASLab, University of Minho
- Guarded Traced Categories presented at the FoSSaCS 2018

# Teaching

- Summer 2023 Monad-based Programming (course description).
- Summer 2021 Theorie der Programmierung (course description)
- Summer 2021 Communication and Parallel Processes (course description)
- Summer 2021 Homotopy Type Theory Seminar (jointly with Tadeusz Litak)
- Winter 2019 Introduction to Dependently Typed Programming
- Summer 2019 Monad-based Programming (course description).
- Summer 2017 Homotopy Type Theory Seminar (jointly with Tadeusz Litak).
- Winter 2016 Communication and Parallel Processes (course description, lecture script).
- Summer 2015 Monad-based Programming (course description).
- Summer 2014 Term rewriting (course description).
- Summer 2013 Communication and Parallel Processes (course description).