PD Dr.-Ing. Sergey Goncharov



Organisationseinheit


Technische Fakultät
Lehrstuhl für Informatik 8 (Theoretische Informatik)


Preise / Auszeichnungen


2018 : EACTS Best Paper Award at ETAPS 2018
2018 : ICTAC 2018 Best Paper Award



Projektleitung


HighMoon/HighMoon2: Eine High-Level-Sprache für monadenbasierte Prozesse
PD Dr.-Ing. Sergey Goncharov; Prof. Dr. Lutz Schröder
(01.09.2013 - 31.10.2020)


Publikationen (Download BibTeX)

Go to first page Go to previous page 1 von 2 Go to next page Go to last page

Goncharov, S., Rauch, C., & Schröder, L. (2018). A Metalanguage for Guarded Iteration. In Bernd Fischer Tarmo Uustalu (Eds.), Theoretical Aspects of Computing - ICTAC 2018 (LNCS 11187) (pp. 191--210). Stellenbosch, South Africa: Springer International Publishing.
Goncharov, S., & Neves, R. (2018). A Semantics for Hybrid Iteration. In Proceedings of the 29th International Conference on Concurrency Theory, CONCUR 2018. Beijing, China.
Goncharov, S., & Schröder, L. (2018). Guarded Traced Categories. In Proceedings of the 21st International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2018 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018 (pp. 313-330). Springer Verlag.
Goncharov, S., Schröder, L., Rauch, C., & Jakob, J. (2018). Unguarded Recursion on Coinductive Resumptions. Logical Methods in Computer Science, 14(3). https://dx.doi.org/10.23638/LMCS-14(3:10)2018
Rauch, C., Goncharov, S., & Schröder, L. (2017). Generic Hoare Logic for Order-Enriched Effects with Exceptions. In James P, Roggenbach M (Eds.), Recent Trends in Algebraic Development Techniques: 23rd IFIP WG 1.3 International Workshop, WADT 2016, Revised Selected Papers (pp. 208--222). Springer.
Goncharov, S., Schröder, L., Rauch, C., & Piróg, M. (2017). Unifying Guarded and Unguarded Iteration. In Esparza Javier , Murawski Andrzej (Eds.), Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017). Uppsala, SE: Berlin: Springer.
Goncharov, S., Milius, S., & Rauch, C. (2016). Complete Elgot Monads and Coalgebraic Resumptions. Electronic Notes in Theoretical Computer Science, 325, 147-168. https://dx.doi.org/10.1016/j.entcs.2016.09.036
Goncharov, S., Milius, S., & Rauch, C. (2016). Complete Elgot Monads and Coalgebraic Resumptions. In Lars Birkedal (Eds.), (pp. 147--168). Carnegie Mellon University, Pittsburgh, US: Electronic Notes in Theoretical Computer Science.
Goncharov, S., Rauch, C., & Schröder, L. (2015). Unguarded Recursion on Coinductive Resumptions. In Mathematical Foundations of Programming Semantics XXXI, MFPS 2015 (pp. 250 - 264). Art Cinema Lux, Nijmegen, NL: Elsevier.
Goncharov, S., & Pattinson, D. (2014). Coalgebraic Weak Bisimulation from Recursive Equations over Monads. In Proc. 41st International Colloquium on Automata, Languages, and Programming (pp. 196-207). Kopenhagen: Berlin/Heidelberg: Springer.

Zuletzt aktualisiert 2018-24-07 um 04:30