Theoretical Computer Science

Theses

19. Bounded Analysis of Concurrent and Recursive Programs, Master's Thesis by Sören van der Wall.
    Technische Universität Braunschweig, 2019.
    PDF

18. Probabilistic Programming: Applications of Martingales beyond Reachability, Master's Thesis by Thomas Haas.
    Technische Universität Braunschweig, 2019.
    PDF

17. Runtime Verification of Sequential Consistency for ARM, Master's Thesis by Mike Becker.
    TU Braunschweig, 2017.
    

16. Algorithms for Context-free Games: A Comparison of Saturation, Guess&Check and Summarization, Master's Thesis by Elisabeth Neumann.
    Technische Universität Kaiserslautern, 2017.
    PDF

15. Lifetime Analysis for Whiley, Master's Thesis by Sebastian Schweizer.
    Technische Universität Kaiserslautern, 2016.
    PDF | Slides | More on Whiley | Code Contribution

14. Monoids as Storage Mechanisms, PhD thesis by Georg Zetzsche.
    Technische Universität Kaiserslautern, 2016.
    PDF

13. Verification Techniques for TSO-Relaxed Programs, PhD Thesis by Georgel Calin.
    Technische Universität Kaiserslautern, 2016.
    PDF

12. Analysis of Automata-theoretic models of Concurrent Recursive Programs, PhD Thesis by Prakash Saivasan.
    Chennai Mathematical Institute, 2016.
    PDF

11. 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

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

9. 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

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

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

6. Automata-Theoretic Control for Total Store Ordering Architectures, Master Thesis by Florian Furbach.
   Technische Universität Kaiserslautern, 2012.
   PDF

5. Scheduler-Quantified Time-Bounded Reachability for Distributed Input/Output Interactive Probabilistic Chains, MSc Thesis by Georgel Calin.
   Saarland University, 2010.
   PDF

4. On Erasing Productions in Grammars with Regulated Rewriting, Diplomarbeit by Georg Zetzsche.
   Universität Hamburg, 2010.
   

3. Reconstruction of C++ control flow structures from a low-level program, Diploma Thesis by Egor Derevenetc.
   Moscow State University, 2010.
   

2. Structural Stationarity in the pi-Calculus, PhD thesis by Roland Meyer.
   Department of Computing Science, University of Oldenburg, 2009.
   Slides | PDF | BibTeX

1. Model-Checking von Phasen-Event-Automaten bezüglich Duration Calculus Formeln mittels Testautomaten, Master's thesis by Roland Meyer.
   Department of Computing Science, University of Oldenburg, 2005.
   PDF, in German | BibTeX