EN | DE
Theoretische Informatik

Sergey Goncharov's Publications

2018
[23] Guarded Traced Categories (Sergey Goncharov, Lutz Schröder), In Proc. 21st International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2018 (Christel Baier, Ugo Dal Lago, eds.), LNCS, vol. 10803, pp. 313–330, Springer, 2018. [bib] [pdf] [doi]
[22] A Metalanguage for Guarded Iteration (Sergey Goncharov, Christoph Rauch, Lutz Schröder), In Theoretical Aspects of Computing -- ICTAC 2018 (Bernd Fischer, Tarmo Uustalu, eds.), pp. 191–210, Springer International Publishing, 2018. ( [ArXiv preprint] ) [bib]
[21] A Semantics for Hybrid Iteration (Sergey Goncharov, Julian Jakob, Renato Neves), In 29th International Conference on Concurrency Theory (CONCUR 2018) (Sven Schewe, Lijun Zhang, eds.), lncs, springer, 2018. [bib]
[20] Unguarded Recursion on Coinductive Resumptions (Sergey Goncharov, Lutz Schröder, Christoph Rauch, Julian Jakob), In Log. Methods Comput. Sci., vol. 14(3), 2018. [bib] [pdf] [doi]
2017
[19] Generic Hoare Logic for Order-Enriched Effects with Exceptions (Christoph Rauch, Sergey Goncharov, Lutz Schröder), In Recent Trends in Algebraic Development Techniques: 23rd IFIP WG 1.3 International Workshop, WADT 2016, Revised Selected Papers (Phillip James, Markus Roggenbach, eds.), pp. 208–222, Springer, 2017. The final publication is available at Springer via https://doi.org/10.1007/978-3-319-72044-9_14. [bib] [pdf]
[18] Unifying Guarded and Unguarded Iteration (Sergey Goncharov, Lutz Schröder, Christoph Rauch, Maciej Piróg), In Proc. 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017) (Javier Esparza, Andrzej Murawski, eds.), Lect. Notes Comput. Sci. (ArCOSS), vol. 10203, pp. 517–533, Springer, 2017. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-54458-7_30. [bib] [pdf]
2016
[17] Complete Elgot Monads and Coalgebraic Resumptions (Sergey Goncharov, Stefan Milius, Christoph Rauch), In Electr. Notes Theor. Comput. Sci., vol. 325, pp. 147–168, 2016. [bib] [pdf]
2015
[16] Unguarded Recursion on Coinductive Resumptions (Sergey Goncharov, Christoph Rauch, Lutz Schröder), In Proc. 31st Conference on the Mathematical Foundations of Programming Semantics (MFPS XXXI), Electronic Notes in Theoretical Computer Science, vol. 319(), pp. 183 – 198, 2015. [preprint] [bib] [pdf]
2014
[15] Monodic Fragments of Probabilistic First-order Logic (Jean Christoph Jung, Carsten Lutz, Sergey Goncharov, Lutz Schröder), In Proc. 41st International Colloquium on Automata, Languages, and Programming, ICALP 2014 (Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias, eds.), Lecture Notes in Computer Science, vol. 8573, pp. 256–267, Springer, 2014. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-43951-7_22. [bib] [doi]
[14] Coalgebraic Weak Bisimulation from Recursive Equations over Monads (Sergey Goncharov, Dirk Pattinson), In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II (Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias, eds.), Lecture Notes in Computer Science, vol. 8573, pp. 196–207, 2014. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-43951-7_17. [bib] [doi]
[13] Towards a Coalgebraic Chomsky Hierarchy (Extended Abstract) (Sergey Goncharov, Stefan Milius, Alexandra Silva), In Proc. 8th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science (TCS'14) (Josep Diaz, Ivan Lanese, Davide Sangiorgi, eds.), Lecture Notes Comput. Sci., vol. 8705, pp. 265–280, Springer, 2014. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-44602-7_21. [bib] [doi]
2013
[12] A Relatively Complete Generic Hoare Logic for Order-Enriched Effects (Sergey Goncharov, Lutz Schröder), In Proc. 28th Annual Symposium on Logic in Computer Science (LICS 2013), pp. 273–282, IEEE, 2013. [bib] [pdf] [doi]
[11] A coinductive calculus for asynchronous side-effecting processes (Sergey Goncharov, Lutz Schröder), In Information and Computation, vol. 231(0), pp. 204 – 232, 2013. [bib] [pdf] [doi]
[10] Trace Semantics via Generic Observations (Sergey Goncharov), In Algebra and Coalgebra in Computer Science (CALCO 2013) (Reiko Heckel, Stefan Milius, eds.), Lecture Notes in Computer Science, Springer, 2013. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-40206-7_13. [bib] [doi]
[9] Exploring the Boundaries of Monad Tensorability on Set (Nathan Bowler, Sergey Goncharov, Paul Blain Levy, Lutz Schröder), In Logical Methods in Computer Science, vol. 9(3), 2013. [bib] [pdf] [doi]
2011
[8] A Counterexample to Tensorability of Effects (Sergey Goncharov, Lutz Schröder), In Algebra and Coalgebra in Computer Science (CALCO 2011) (Andrea Corradini, Bartek Klin, eds.), Lecture Notes in Computer Science, Springer, 2011. [bib]
[7] A coinductive calculus for asynchronous side-effecting processes (Sergey Goncharov, Lutz Schröder), In Fundamentals of Computation Theory (FCT 2011) (Olaf Owe, Martin Steffen, Jan Arne Telle, eds.), Lecture Notes in Computer Science, vol. 6914, Springer, 2011. [bib] [pdf]
[6] Powermonads and Tensors of Unranked Effects (Sergey Goncharov, Lutz Schröder), In Logic in Computer Science (LICS 2011) (Martin Grohe, ed.), IEEE Computer Society, 2011. [bib] [pdf]
2010
[5] A Generic Complete Dynamic Logic for Reasoning about Purity and Effects (Till Mossakowski, Lutz Schröder, Sergey Goncharov), In Formal Aspects of Computing, vol. 22(3-4), pp. 363–384, 2010. [bib] [pdf]
[4] Kleene monads (Sergey Goncharov), PhD thesis, Universität Bremen; www.uni-bremen.de, 2010. [pdf] [bib]
2009
[3] Kleene Monads: Handling Iteration in a Framework of Generic Effects (Sergey Goncharov, Lutz Schröder, Till Mossakowski), In Algebra and Coalgebra in Computer Science (CALCO 2009) (Alexander Kurz, Andrzej Tarlecki, eds.), Lecture Notes in Computer Science, vol. 5728, pp. 18–33, Springer, 2009. [bib]
2008
[2] A generic complete dynamic logic for reasoning about purity and effects (Till Mossakowski, Lutz Schröder, Sergey Goncharov), In Fundamental Approaches to Software Engineering (FASE 2008) (J. Fiadeiro, P. Inverardi, eds.), Lecture Notes in Computer Science, vol. 4961, pp. 199–214, Springer, 2008. [bib] [pdf]
2006
[1] Completeness of Global Evaluation Logic (Sergey Goncharov, Lutz Schröder, Till Mossakowski), In Mathematical Foundations of Computer Science (Rastislav Královič, Paweł Urzyczyn, eds.), Lecture Notes in Computer Science, vol. 4162, pp. 447–458, Springer, 2006. [preprint] [bib] [pdf]
Powered by bibtexbrowser