| Unguarded recursion on coinductive resumptions S Goncharov, L Schröder, C Rauch, J Jakob Logical Methods in Computer Science 14, 2018 | 33 | 2018 |
| A relatively complete generic Hoare logic for order-enriched effects S Goncharov, L Schröder 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 273-282, 2013 | 28 | 2013 |
| A coinductive calculus for asynchronous side-effecting processes S Goncharov, L Schröder Information and Computation 231, 204-232, 2013 | 27 | 2013 |
| Unifying guarded and unguarded iteration S Goncharov, L Schröder, C Rauch, M Piróg Foundations of Software Science and Computation Structures: 20th …, 2017 | 24 | 2017 |
| Towards a coalgebraic Chomsky hierarchy S Goncharov, S Milius, A Silva IFIP International Conference on Theoretical Computer Science, 265-280, 2014 | 23 | 2014 |
| Kleene monads: handling iteration in a framework of generic effects S Goncharov, L Schröder, T Mossakowski Algebra and Coalgebra in Computer Science: Third International Conference …, 2009 | 19 | 2009 |
| Guarded traced categories S Goncharov, L Schröder Foundations of Software Science and Computation Structures: 21st …, 2018 | 18 | 2018 |
| Implementing hybrid semantics: From functional to imperative S Goncharov, R Neves, J Proença Theoretical Aspects of Computing–ICTAC 2020: 17th International Colloquium …, 2020 | 14 | 2020 |
| Coalgebraic weak bisimulation from recursive equations over monads S Goncharov, D Pattinson International Colloquium on Automata, Languages, and Programming, 196-207, 2014 | 14 | 2014 |
| Complete Elgot monads and coalgebraic resumptions S Goncharov, S Milius, C Rauch Electronic Notes in Theoretical Computer Science 325, 147-168, 2016 | 13 | 2016 |
| Generic Hoare logic for order-enriched effects with exceptions C Rauch, S Goncharov, L Schröder International Workshop on Algebraic Development Techniques, 208-222, 2016 | 11 | 2016 |
| Trace semantics via generic observations S Goncharov International Conference on Algebra and Coalgebra in Computer Science, 158-174, 2013 | 11 | 2013 |
| A generic complete dynamic logic for reasoning about purity and effects T Mossakowski, L Schröder, S Goncharov Formal Aspects of Computing 22 (3), 363-384, 2010 | 11 | 2010 |
| Kleene monads S Goncharov Verlag Dr. Hut, 2010 | 11 | 2010 |
| An adequate while-language for hybrid computation S Goncharov, R Neves Proceedings of the 21st International Symposium on Principles and Practice …, 2019 | 10 | 2019 |
| A semantics for hybrid iteration S Goncharov, J Jakob, R Neves arXiv preprint arXiv:1807.01053, 2018 | 10 | 2018 |
| Towards a higher-order mathematical operational semantics S Goncharov, S Milius, L Schröder, S Tsampas, H Urbat Proceedings of the ACM on Programming Languages 7 (POPL), 632-658, 2023 | 9 | 2023 |
| Quantitative Hennessy-Milner theorems via notions of density J Forster, S Goncharov, D Hofmann, P Nora, L Schröder, P Wild arXiv preprint arXiv:2207.09187, 2022 | 9 | 2022 |
| A generic complete dynamic logic for reasoning about purity and effects T Mossakowski, L Schröder, S Goncharov International Conference on Fundamental Approaches to Software Engineering …, 2008 | 9 | 2008 |
| Some remarks on Conway and iteration theories Z Ésik, S Goncharov arXiv preprint arXiv:1603.00838, 2016 | 7 | 2016 |
Lutz SchröderProfessor of Computer Science, Friedrich-Alexander-Universität Erlangen-Nürnberg在 cs.fau.de 的电子邮件经过验证
