Theoretical Computer Science

Publications 2013

Conference contributions

10. Silent Transitions in Automata with Storage, by Georg Zetzsche.
    In Proceedings of ICALP 2013.
    DOI | arXiv

9. A Theory of Name Boundedness, by Reiner Hüchting, Rupak Majumdar, and Roland Meyer.
   In Proceedings of CONCUR 2013.
   PDF | DOI

8. Provenance Verification, by Rupak Majumdar, Roland Meyer, and Zilong Wang.
   In Proceedings of RP 2013.
   DOI | BibTeX

7. Automatic Verification of Erlang-Style Concurrency, by Emanuele D'Osualdo, Jonathan Kochems, and C.-H. Luke Ong.
   In Proceedings of SAS 13.
   DOI | arXiv | Slides | Project's website

6. Semilinearity and Context-Freeness of Languages Accepted by Valence Automata, by P. Buckheister and Georg Zetzsche.
   In Proceedings of MFCS 2013.
   DOI | arXiv

5. Rational Subsets and Submonoids of Wreath Products, by Markus Lohrey, Benjamin Steinberg, and Georg Zetzsche.
   In Proceedings of ICALP 2013.
   DOI | arXiv

4. A Theory of Partitioned Global Address Spaces, by Georgel Calin, Egor Derevenetc, Rupak Majumdar, and Roland Meyer.
   In Proceedings of FSTTCS 2013.
   arXiv | DOI | BibTeX

3. Checking and Enforcing Robustness against TSO, by Ahmed Bouajjani, Egor Derevenetc, and Roland Meyer.
   In Proceedings of ESOP 2013.
   PDF (full version) | DOI | BibTeX

2. Static Provenance Verification for Message Passing Programs, by Rupak Majumdar, Roland Meyer, and Zilong Wang.
   In Proceedings of SAS 2013.
   PDF | DOI | BibTeX

1. Adjacent Ordered Multi-Pushdown Systems, by Prakash Saivasan, Mohammed Faouzi Atig, and K Narayan Kumar.
   In Proceedings of DLT 13.
   DOI

Journal articles

1. A Polynomial Translation of Pi-Calculus (FCP) to Safe Petri Nets, by Victor Khomenko, Roland Meyer, and Reiner Hüchting.
   Logical Methods in Computer Science, 2013.
   arXiv | BibTeX