Theoretical Computer Science

Publications 2012

Conference contributions

5. A Polynomial Translation of Pi-Calculus (FCP) to Safe Petri Nets, by Roland Meyer, Victor Khomenko, and Reiner Hüchting.
   In Proceedings of CONCUR 2012.
   PDF | DOI

4. Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding, by Prakash Saivasan, K Narayan Kumar, Mohammed Faouzi Atig, and Ahmed Bouajjani.
   In Proceedings of ATVA 12.
   DOI

3. Language-Theoretic Abstraction Refinement, by Zhenyue Long, Georgel Calin, Rupak Majumdar, and Roland Meyer.
   In Proceedings of FASE 2012.
   ETAPS 2012 best paper award by EAPLS.
   DOI | www | BibTeX

2. Soter: An Automatic Safety Verifier for Erlang, by Emanuele D'Osualdo, Jonathan Kochems, and C.-H. Luke Ong.
   In Proceedings of AGERE! 12.
   DOI | Tool

1. An Algorithmic Framework for Coverability in Well-Structured Systems, by Tim Strazny and Roland Meyer.
   In Proceedings of ACSD 2012.
   ACSD 2012 best paper award.
   DOI | BibTeX

Journal articles

1. Petri Net Reachability Graphs: Decidability Status of FO Properties, by Ph. Darondeau, S. Demri, Roland Meyer, and C. Morvan.
   Logical Methods in Computer Science, 2012.
   BibTeX

Theses

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

Technical Reports

1. A Polynomial Translation of Pi-Calculus (FCP) to Safe Petri Nets, by Roland Meyer, Victor Khomenko, and Reiner Hüchting.
   Technical Report CS-TR-1323, School of Computing Science, Newcastle University, 2012.
   PDF