Sergey Goncharov

Orcid: 0000-0001-6924-8766

Affiliations:
  • University of Erlangen-Nuremberg, Department of Computer Science
  • DFKI, Bremen, Germany (former)
  • University of Bremen, Germany (former)


According to our database1, Sergey Goncharov authored at least 45 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A point-free perspective on lax extensions and predicate liftings.
Math. Struct. Comput. Sci., 2024

Representing Guardedness in Call-by-Value and Guarded Parametrized Monads.
CoRR, 2024

Bialgebraic Reasoning on Higher-Order Program Equivalence.
CoRR, 2024

Logical Predicates in Higher-Order Mathematical Operational Semantics.
Proceedings of the Foundations of Software Science and Computation Structures, 2024

2023
Towards a Higher-Order Mathematical Operational Semantics.
Proc. ACM Program. Lang., January, 2023

Weak Similarity in Higher-Order Mathematical Operational Semantics.
LICS, 2023

Representing Guardedness in Call-By-Value.
Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

Kantorovich Functors and Characteristic Logics for Behavioural Distances.
Proceedings of the Foundations of Software Science and Computation Structures, 2023

Quantitative Hennessy-Milner Theorems via Notions of Density.
Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

Higher-Order Mathematical Operational Semantics (Early Ideas).
Proceedings of the 10th Conference on Algebra and Coalgebra in Computer Science, 2023

2022
Quantalic Behavioural Distances.
CoRR, 2022

Stateful Structural Operational Semantics.
Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

Shades of Iteration: From Elgot to Kleene.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2022

2021
A metalanguage for guarded iteration.
Theor. Comput. Sci., 2021

Uniform Elgot Iteration in Foundations.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Toward a Uniform Theory of Effectful State Machines.
ACM Trans. Comput. Log., 2020

Implementing Hybrid Semantics: From Functional to Imperative.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2020 - 17th International Colloquium, Macau, China, November 30, 2020

Towards Constructive Hybrid Semantics.
Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

Local Local Reasoning: A BI-Hyperdoctrine for Full Ground Store.
Proceedings of the Foundations of Software Science and Computation Structures, 2020

2019
Guarded and Unguarded Iteration for Generalized Processes.
Log. Methods Comput. Sci., 2019

An Adequate While-Language for Hybrid Computation.
Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages, 2019

Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot.
Proceedings of the 8th Conference on Algebra and Coalgebra in Computer Science, 2019

2018
Unguarded Recursion on Coinductive Resumptions.
Log. Methods Comput. Sci., 2018

Guarded Traced Categories.
Proceedings of the Foundations of Software Science and Computation Structures, 2018

A Semantics for Hybrid Iteration.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017
Unifying Guarded and Unguarded Iteration.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

2016
Complete Elgot Monads and Coalgebraic Resumptions.
Proceedings of the Thirty-second Conference on the Mathematical Foundations of Programming Semantics, 2016

Some Remarks on Conway and Iteration Theories.
CoRR, 2016

Generic Hoare Logic for Order-Enriched Effects with Exceptions.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2016

2015
Unguarded Recursion on Coinductive Resumptions.
Proceedings of the 31st Conference on the Mathematical Foundations of Programming Semantics, 2015

2014
(Co-)Algebraic Foundations for Effect Handling and Iteration.
CoRR, 2014

Towards a Coalgebraic Chomsky Hierarchy.
CoRR, 2014

Towards a Coalgebraic Chomsky Hierarchy - (Extended Abstract).
Proceedings of the Theoretical Computer Science, 2014

Monodic Fragments of Probabilistic First-Order Logic.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Coalgebraic Weak Bisimulation from Recursive Equations over Monads.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
A coinductive calculus for asynchronous side-effecting processes.
Inf. Comput., 2013

Exploring the Boundaries of Monad Tensorability on Set.
Log. Methods Comput. Sci., 2013

A Relatively Complete Generic Hoare Logic for Order-Enriched Effects.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Trace Semantics via Generic Observations.
Proceedings of the Algebra and Coalgebra in Computer Science, 2013

2011
Powermonads and Tensors of Unranked Effects.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

A Counterexample to Tensorability of Effects.
Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2010
Kleene monads.
PhD thesis, 2010

A generic complete dynamic logic for reasoning about purity and effects.
Formal Aspects Comput., 2010

2009
Kleene Monads: Handling Iteration in a Framework of Generic Effects.
Proceedings of the Algebra and Coalgebra in Computer Science, 2009

2006
Completeness of Global Evaluation Logic.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006


  Loading...