Institute of

Theoretical Computer Science

Carl-Friedrich-Gauß-Fakultät

Technische Universität Braunschweig

Workshop contributions

Workshop contributions

  1. Thread Summaries for Lock-Free Data Structures, by Sebastian Wolff.
    In Proceedings of the 28th Nordic Workshop on Programming Theory (NWPT'16), 2016.
    PDF | Slides | Code on GitHub | Proceedings

  2. SmartDec: Approaching C++ Decompilation, by A. Fokin, Egor Derevenetc, A. Chernov, and K. Troshina.
    In Proceedings of 18th Working Conference on Reverse Engineering. Limerick, Ireland, 2011.
    IEEE | DOI | BibTeX

  3. Reconstruction of Composite Types for Decompilation, by K. Troshina, Egor Derevenetc, and A. Chernov.
    In Proceedings of 10th IEEE International Working Conference on Source Code Analysis and Manipulation. Timisoara, Romania, 2010.
    IEEE | DOI | BibTeX

  4. Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains, by Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio, Ernst Moritz Hahn, and Lijun Zhang.
    In Model Checking Software - 17th International SPIN Workshop, Enschede, The Netherlands, September 27-29, 2010. Proceedings, 2010.
    DOI

  5. Concurrent finite automata and related language classes (an overview), by Manfred Kudlek and Georg Zetzsche.
    In Automata, Formal Languages and Algebraic Systems, Proceedings of AFLAS 2008, 2010.
    DOI

  6. Strukturelle Stationarität, by Roland Meyer.
    In Ausgezeichnete Informatik Dissertationen, 2009.
    PDF, in German | BibTeX

  7. Automata-theoretic verification based on counterexample specifications, by Ernst-Rüdiger Olderog and Roland Meyer.
    In Informatik als Dialog zwischen Theorie und Anwendung, 2009.
    DOI | BibTeX

  8. C Decompilation: Is It Possible?, by K. Troshina, A. Chernov, and Egor Derevenetc.
    In Proceedings of International Workshop on Program Understanding. Altai Mountains, Russia, 2009.
    PDF | BibTeX

  9. Properties of Multiset Language Classes Defined by Multiset Storage Automata, by Manfred Kudlek, Patrick Totzke, and Georg Zetzsche.
    In Proceedings of the Workshop CS&P'2008, 2008.

  10. Multiset Storage Automata, by Manfred Kudlek, Patrick Totzke, and Georg Zetzsche.
    In Proceedings of the Workshop CS&P'2008, 2008.

  11. On Concurrent Finite Automata, by Berndt Farwer, Matthias Jantzen, Manfred Kudlek, Heiko Rölke, and Georg Zetzsche.
    In Proceedings of the Workshop CS&P'2007, 2007.

  12. A Petri net semantics for pi-calculus verification, by Roland Meyer.
    In Dagstuhl "zehn plus eins", 2007.
    BibTeX

  13. On Languages Accepted by Concurrent Finite Automata, by Matthias Jantzen, Manfred Kudlek, and Georg Zetzsche.
    In Proceedings of the Workshop CS&P'2007, 2007.

  14. Finite Automata Controlled by Petri Nets, by Matthias Jantzen, Manfred Kudlek, and Georg Zetzsche.
    In Proceedings of the 14th Workshop; Algorithmen und Werkzeuge für Petrinetze, 2007.

  15. Model checking the pi-calculus, by Roland Meyer.
    In Proc. of the International Research Training Groups Workshop, 2006.
    BibTeX