EN | DE
Theoretische Informatik

Christoph Rauch

Address: FAU Erlangen-NürnbergRoom: 11.156
  Chair for Theoretical Computer Science Telephone: +49-91-3185-64031
  Martensstraße 3Fax: +49-91-3185-64055
  D-91058 ErlangenE-Mail: christoph.rauch@fau.de

About me

I am a PhD student at Chair for Theoretical Computer Science of Friedrich-Alexander University of Erlangen and Nürnberg. My Master's thesis about a generic Hoare calculus for order-enriched effects with additional support for exceptions, supervised by Lutz Schröder and Sergey Goncharov, is available here.

Publications

2018
[6] 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]
[5] 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
[4] 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]
[3] 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
[2] 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
[1] 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]
Powered by bibtexbrowser