Institute of

Theoretical Computer Science

Carl-Friedrich-Gauß-Fakultät

Technische Universität Braunschweig

Publications 2015

Publications 2015

Conference contributions

  1. What's Decidable about Availability Languages?, by Parosh Abdulla, Mohamed Faouzi Atig, Roland Meyer, and Mehdi Seyed Salehi.
    In Proceedings of FSTTCS 2015.
    PDF | DOI | BibTeX

  2. Antichains for Recursive Program Verification, by Lukas Holik and Roland Meyer.
    In Proceedings of NETYS 2015.
    PDF | DOI | BibTeX

  3. Lazy TSO Reachability, by Ahmed Bouajjani, Georgel Calin, Egor Derevenetc, and Roland Meyer.
    In Proceedings of FASE 2015.
    arXiv | DOI | BibTeX

  4. From Program Verification to Time and Space: The Scientific Life of Ernst-Rüdiger Olderog, by Roland Meyer and Heike Wehrheim.
    In Proceedings of Symposium in Honor of Ernst-Rüdiger Olderog.
    DOI | BibTeX

  5. Building A State-Of-The-Art Model Checker, by Sebastian Wolff.
    In 45. Jahrestagung der Gesellschaft für Informatik, Informatik 2015, Informatik, Energie und Umwelt, 28. September - 2. Oktober 2015 in Cottbus, Deutschland, 2015.
    PDF | Slides | Code on GitHub

  6. The Emptiness Problem for Valence Automata or: Another Decidable Extension of Petri Nets, by Georg Zetzsche.
    In Proceedings of RP 2015.
    DOI

  7. An Approach to Computing Downward Closures, by Georg Zetzsche.
    In Proceedings of ICALP 2015.
    DOI | arXiv

  8. Computing downward closures for stacked counter automata, by Georg Zetzsche.
    In Proceedings of STACS 2015.
    DOI | arXiv

Editor

  1. Stefan Haar and Roland Meyer, editors. Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD), IEEE Computer Society Press, 2015.
    Webpage | BibTeX

  2. Roland Meyer, Andre Platzer, and Heike Wehrheim, editors. Correct System Design: Symposium in Honor of Ernst-Rüdiger Olderog on the Occasion of His 60th Birthday, Proceedings , 9360 of LNCS. Springer, 2015.
    DOI | BibTeX

Journal articles

  1. Rational subsets and submonoids of wreath products, by Markus Lohrey, Benjamin Steinberg, and Georg Zetzsche.
    Information and Computation, 2015.
    DOI | arXiv

  2. Memory-Model-Aware Testing - a Unified Complexity Analysis, by Florian Furbach, Roland Meyer, Klaus Schneider, and Maximilian Senftleben.
    ACM Transactions on Embedded Computing Systems (TECS), 2015.
    PDF | BibTeX

Theses

  1. Computing the Deligne number of curve singularities and an algorithmic framework for differential algebras in Singular, Master Thesis by Peter Chini.
    Technische Universität Kaiserslautern, 2015.
    PDF

  2. Computing boundaries of tropical varieties, Master Thesis by Sebastian Muskalla.
    Technische Universität Kaiserslautern, 2015.
    PDF

  3. Thread-Modular Reasoning for Heap-Manipulating Programs: Exploiting Pointer Race Freedom, Master's Thesis by Sebastian Wolff.
    Technische Universität Kaiserslautern, 2015.
    PDF | Slides | Code on GitHub

  4. Verification of Message Passing Concurrent Systems, PhD Thesis by Emanuele D'Osualdo.
    University of Oxford, 2015.
    PDF

  5. Robustness against Relaxed Memory Models, PhD thesis by Egor Derevenetc.
    University of Kaiserslautern, 2015.
    PDF | BibTeX