Navigation

Christoph Rauch

Address:   FAU Erlangen-Nürnberg Room:   11.156
    Chair for Theoretical Computer Science Telephone:   +49-91-3185-64031
    Martensstraße 3 Fax:   +49-91-3185-64055
    D-91058 Erlangen E-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

2020
[8], , and : Cheap CTL Compassion in NuSMV, In 21st International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2020), LNCS, vol. 11990, pp. 248–269, Springer, . Artifact evaluation: Available and Functional [bibtex] [url]
2019
[7], , and : Guarded and Unguarded Iteration for Generalized Processes, In Logical Methods in Computer Science, 15(3), . [bibtex] [url] [doi]
2018
[6], and : A Metalanguage for Guarded Iteration, In Bernd Fischer, Tarmo Uustalu, eds.: Theoretical Aspects of Computing – ICTAC 2018, pp. 191–210, Springer International Publishing, . [ArXiv preprint] [bibtex]
[5], , and : Unguarded Recursion on Coinductive Resumptions, In Log. Methods Comput. Sci., 14(3), . [bibtex] [url] [doi]
2017
[4], and : Generic Hoare Logic for Order-Enriched Effects with Exceptions, In Phillip James, Markus Roggenbach, eds.: Recent Trends in Algebraic Development Techniques: 23rd IFIP WG 1.3 International Workshop, WADT 2016, Revised Selected Papers, pp. 208–222, Springer, . The final publication is available at Springer via https://doi.org/10.1007/978-3-319-72044-9_14. [bibtex] [pdf]
[3], , and : Unifying Guarded and Unguarded Iteration, In Javier Esparza, Andrzej Murawski, eds.: Proc. 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017), Lect. Notes Comput. Sci. (ArCOSS), vol. 10203, pp. 517–533, Springer, . The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-54458-7_30. [bibtex] [pdf]
2016
[2], and : Complete Elgot Monads and Coalgebraic Resumptions, In Electr. Notes Theor. Comput. Sci., 325, pp. 147–168, . [bibtex] [url]
2015
[1], and : Unguarded Recursion on Coinductive Resumptions, In Proc. 31st Conference on the Mathematical Foundations of Programming Semantics (MFPS XXXI), Electronic Notes in Theoretical Computer Science, vol. 319(), pp. 183 – 198, . [preprint] [bibtex] [url]