Sergey Goncharov
Scholar

Sergey Goncharov

Google Scholar ID: O6as6pAAAAAJ
School of Computer Science, University of Birmingham
Logic in Computer ScienceSemanticsProgramming
Citations & Impact
All-time
Citations
291
 
H-index
10
 
i10-index
12
 
Publications
20
 
Co-authors
17
list available
Resume (English only)
Academic Achievements
  • Publications: 'Big Steps in Higher-Order Mathematical Operational Semantics' accepted at ICFP 2025, 'Bialgebraic Reasoning on Stateful Languages' accepted at ICFP 2025, 'Probabilistic Strategies: Definability and the Tensor Completeness Problem' accepted at LICS 2025, 'Relators and Notions of Simulation Revisited' accepted at LICS 2025, 'Identity-Preserving Lax Extensions and Where to Find Them' accepted at STACS 2025, 'Abstract Operational Methods for Call-by-Push-Value' accepted at POPL 2025, 'A Unifying Categorical View on Nondeterministic Iteration and Tests' accepted at CONCUR 2024, 'Bialgebraic Reasoning on Higher-order Program Equivalence' accepted at LICS 2024, 'Logical Predicates in Higher-Order Mathematical Operational Semantics' accepted at FOSSACS 2024, 'Representing Guardedness in Call-by-Value' accepted at FSCD 2023, 'Weak Similarity in Higher-Order Mathematical Operational Semantics' 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. Academic projects: DFG-funded project 'Abstract Techniques for Programming Languages and Secure Compilation (ATLaS)' (jointly with Stelios Tsampas) granted, DFG project 'Higher-Order Monad-based Programming and Reasoning (HOMBRe)' granted.
Research Experience
  • Currently an assistant professor at the School of Computer Science, University of Birmingham; previously worked at the Chair for Theoretical Computer Science of Friedrich-Alexander University of Erlangen and Nürnberg.
Background
  • Research interests include computational monads and side-effects, program logics (with side-effects), semantics and foundations of computations, (universal) algebra, coalgebra, and category theory, hybrid systems.