Institute of

Theoretical Computer Science

Carl-Friedrich-Gauß-Fakultät

Technische Universität Braunschweig

Publications 2009

Publications 2009

Conference contributions

  1. Checking pi-calculus structural congruence is graph isomorphism complete, by Victor Khomenko and Roland Meyer.
    In Proceedings of ACSD 2009.
    DOI | PDF | BibTeX

  2. Erasing in Petri Net Languages and Matrix Grammars, by Georg Zetzsche.
    In Proceedings of DLT 2009.
    DOI

  3. On the relationship between pi-calculus and finite place/transition Petri nets, by Roland Meyer and Roberto Gorrieri.
    In Proceedings of CONCUR 2009.
    Slides | PDF | DOI | BibTeX

Journal articles

  1. A Theory of Structural Stationarity in the Pi-Calculus, by Roland Meyer.
    Acta Informatica, 2009.
    DOI | BibTeX

  2. CoLoSS: The Coalgebraic Logic Satisfiability Solver, by Georgel Calin, Robert S. R. Myers, Dirk Pattinson, and Lutz Schröder.
    Electr. Notes Theor. Comput. Sci., 2009.
    DOI

  3. Multiset Pushdown Automata, by Manfred Kudlek, Patrick Totzke, and Georg Zetzsche.
    Fundamenta Informaticae, 2009.
    DOI

  4. Properties of Multiset Language Classes Defined by Multiset Pushdown Automata, by Manfred Kudlek, Patrick Totzke, and Georg Zetzsche.
    Fundamenta Informaticae, 2009.
    DOI

  5. Structural analysis in the problem of decompilation, by Egor Derevenetc and K.N. Dolgova.
    Collection of Young Scientists' Articles, 2009.

  6. A Practical Approach to Verification of Mobile Systems using Net Unfoldings, by Roland Meyer, Victor Khomenko, and Tim Strazny.
    Fundamenta Informaticae, 2009.
    DOI | BibTeX

  7. Structural analysis in the problem of decompilation, by Egor Derevenetc and K.N. Dolgova.
    Applied Informatics, 2009.
    PDF | BibTeX

Workshop contributions

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

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

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

Theses

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

Technical Reports

  1. A Note on Hack's Conjecture, Parikh Images of Matrix Languages and Multiset Grammars, by Georg Zetzsche.
    Technical Report FBI-HH-B-289/09, University of Hamburg, Department of Computer Science, 2009.
    OPUS

  2. Automated Checking of Observational Equivalence for an Extended Spi Calculus, by Georgel Calin, Markus Rabe, and Raphael Reischuk.
    Technical Report , Student Seminar at Saarland University, 2009.
    PDF