Institute of

Theoretical Computer Science

Carl-Friedrich-Gauß-Fakultät

Technische Universität Braunschweig

Publications

Publications

Recent

  1. Petri Net Invariant Synthesis, by Peter Chini and Florian Furbach.

    NETYS 2021

  2. Liveness Verification and Synthesis: New Algorithms for Recursive Programs, by Roland Meyer, Sebastian Muskalla, and Elisabeth Neumann.

    arXiv

  3. Munchausen Iteration, by Roland Meyer and Sebastian Muskalla.

    arXiv

  4. Fast Witness Counting, by Peter Chini, Rehab Massoud, Roland Meyer, and Prakash Saivasan.

    arXiv

Conference contributions

  1. Parameterized Verification under Release Acquire is PSPACE-complete, by Shankaranarayanan Krishna, Adwait Godbole, Roland Meyer, and Soham Chakraborty.
    In Proceedings of PODC 2022. To appear.

  2. Dartagnan: SMT-based Violation Witness Validation, by Hernan Ponce-de-Leon, Thomas Haas, and Roland Meyer.
    In Proceedings of TACAS 2022. Competition Contribution (SVCOMP).
    PDF

  3. Model-Based Fault Classification for Automotive Software, by Roland Meyer, Sören van der Wall, and Sebastian Wolff.
    In Proceedings of APLAS 2022.
    DOI

  4. Dartagnan: Leveraging Compiler Optimizations and the Price of Precision, by Hernan Ponce-de-Leon, Thomas Haas, and Roland Meyer.
    In Proceedings of TACAS 2021. Competition Contribution (SVCOMP).

  5. Dartagnan: Bounded Model Checking for Weak Memory Models, by Hernan Ponce-de-Leon, Florian Furbach, Keijo Heljanko, and Roland Meyer.
    In Proceedings of TACAS 2020. Competition Contribution.
    PDF | Project Page | DOI | BibTeX

  6. On the Complexity of Multi-Pushdown Games, by Roland Meyer and Sören van der Wall.
    In Proceedings of FSTTCS 2020.
    DOI | PDF

  7. Safety Verification under Power, by Parosh Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Egor Derevenetc, Carl Leonardsson, and Roland Meyer.
    In Proceedings of NETYS 2020. To appear.
    DOI | BibTeX

  8. A Framework for Consistency Algorithms, by Peter Chini and Prakash Saivasan.
    In Proceedings of FSTTCS 2020.
    Conference Version | DOI/BibTex | Full Version @ arXiv

  9. Pointer Life Cycle Types for Lock-Free Data Structures with Memory Reclamation, by Roland Meyer and Sebastian Wolff.
    In Proceedings of POPL 2020. Artifact evaluated: functional&reusable.
    PDF | Slides | Project Page | DOI | arXiv

  10. Widest Paths and Global Propagation in Bounded Value Iteration for Stochastic Games, by Kittiphon Phalakarn, Toru Takisaka, Thomas Haas, and Ichiro Hasuo.
    In Proceedings of CAV 2020.
    DOI | arXiv

  11. Sicherheit, Zuverlässigkeit, Korrektheit, by Juliane Krämer and Roland Meyer.
    In Proceedings of INFORMATIK 2019.
    DOI | BibTeX

  12. BMC for Weak Memory Models: Relation Analysis for Compact SMT Encodings, by Natalia Gavrilenko, Hernan Ponce-de-Leon, Florian Furbach, Keijo Heljanko, and Roland Meyer.
    In Proceedings of CAV 2019. Artifact evaluated positively.
    PDF | Project Page | CAV 2019 | DOI | BibTeX

  13. Inductive Counting and the Reachability Problem for Petri Nets , by Peter Chini and Roland Meyer.
    In Carl Adam Petri: Ideas, Personality, Impact, 2019.
    Book | DOI

  14. Complexity of Liveness in Parameterized Systems, by Peter Chini, Roland Meyer, and Prakash Saivasan.
    In Proceedings of FSTTCS 2019.
    Conference Version | DOI/BibTex | Full Version @ arXiv

  15. Liveness in Broadcast Networks, by Peter Chini, Roland Meyer, and Prakash Saivasan.
    In Proceedings of NETYS 2019.

    Best Student Paper Award.
    Conference Version | DOI/BibTex | Full Version @ arXiv

  16. Temporal Tracing of On-chip Signals using Timeprints, by Rehab Massoud, Peter Chini, Prakash Saivasan, Roland Meyer, Hoang M. Le, and Rolf Drechsler.
    In Proceedings of DAC 2019.
    PDF | DOI

  17. Decoupling Lock-Free Data Structures from Memory Reclamation for Static Analysis, by Roland Meyer and Sebastian Wolff.
    In Proceedings of POPL 2019. Artifact evaluated: functional&reusable.
    PDF | Slides | Project Page | DOI | arXiv

  18. BMC with Memory Models as Modules, by Hernan Ponce-de-Leon, Florian Furbach, Keijo Heljanko, and Roland Meyer.
    In Proceedings of FMCAD 2018.
    PDF | BibTeX

  19. Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems, by Matthew Hague, Roland Meyer, Sebastian Muskalla, and Martin Zimmermann.
    In Proceedings of MFCS 2018.
    PDF | DOI & BibTex | Full Version @ arXiv | Slides

  20. Bounded Context Switching for Valence Systems, by Roland Meyer, Sebastian Muskalla, and Georg Zetzsche.
    In Proceedings of CONCUR 2018.
    PDF | DOI & BibTex | Full Version @ arXiv | Slides

  21. Regular Separability of Well-Structured Transition Systems, by Wojciech Czerwiński, Sławomir Lasota, Roland Meyer, Sebastian Muskalla, K Narayan Kumar, and Prakash Saivasan.
    In Proceedings of CONCUR 2018.
    PDF | DOI & BibTex | Full Version @ arXiv | Slides | Poster

  22. Fine-Grained Complexity of Safety Verification, by Peter Chini, Roland Meyer, and Prakash Saivasan.
    In Proceedings of TACAS 2018.
    Conference Version | DOI/BibTex | Full Version @ arXiv

  23. Reasoning About Weak Semantics via Strong Semantics, by Roland Meyer and Sebastian Wolff.
    In Principled Software Development - Essays Dedicated to Arnd Poetzsch-Heffter on the Occasion of his 60th Birthday, 2018.
    PDF | Book | DOI

  24. Verifying Quantitative Temporal Properties of Procedural Programs, by Mohammed Faouzi Atig, K Narayan Kumar, Prakash Saivasan, and Ahmed Bouajjani.
    In Proceedings of CONCUR 2018.

  25. Portability Analysis for Axiomatic Memory Models. PORTHOS: One Tool for all Models, by Roland Meyer, Hernan Ponce-de-Leon, Florian Furbach, and Keijo Heljanko.
    In Proceedings of SAS 2017.
    DOI | arXiv

  26. Domains for Higher-Order Games, by Matthew Hague, Roland Meyer, and Sebastian Muskalla.
    In Proceedings of MFCS 2017.
    PDF | DOI & BibTex | Full Version @ arXiv | Slides

  27. On the Upward/Downward Closures of Petri Nets, by Mohamed Faouzi Atig, Roland Meyer, Sebastian Muskalla, and Prakash Saivasan.
    In Proceedings of MFCS 2017.
    PDF | DOI & BibTex | Full Version @ arXiv | Slides

  28. On the Complexity of Bounded Context Switching, by Peter Chini, Jonathan Kolberg, Andreas Krebs, Roland Meyer, and Prakash Saivasan.
    In Proceedings of ESA 2017.
    Conference Version | DOI/BibTex | Full Version @ arXiv

  29. Effect Summaries for Thread-Modular Analysis, by Lukas Holik, Roland Meyer, Tomas Vojnar, and Sebastian Wolff.
    In Proceedings of SAS 2017.
    PDF | Slides | DOI | arXiv | Code on GitHub

  30. Verification of Asynchronous Programs with Nested Locks , by Mohammed Faouzi Atig, K Narayan Kumar, Prakash Saivasan, and Ahmed Bouajjani.
    In Proceedings of FSTTCS 2017.

  31. Parity games over bounded phase multi-pushdown systems, by Mohammed Faouzi Atig, K Narayan Kumar, Prakash Saivasan, and Ahmed Bouajjani.
    In Proceedings of NETYS 2017.

  32. Locality and Singularity for Store-Atomic Memory Models, by Egor Derevenetc, Roland Meyer, and Sebastian Schweizer.
    In Proceedings of NETYS 2017.
    DOI | arXiv

  33. Pointer Race Freedom, by Frederic Haziza, Lukas Holik, Roland Meyer, and Sebastian Wolff.
    In Proceedings of VMCAI 2016.
    PDF | DOI | BibTeX

  34. Summaries for Context-Free Games, by Lukas Holik, Roland Meyer, and Sebastian Muskalla.
    In Proceedings of FSTTCS 2016.
    PDF | DOI & BibTex | Full Version @ arXiv | Slides

  35. On Hierarchical Communication Topologies in the pi-calculus, by Emanuele D'Osualdo and C.-H. Luke Ong.
    In Proceedings of ESOP 2016.
    DOI | arXiv | Tool

  36. First-order logic with reachability for infinite-state systems, by Emanuele D'Osualdo, Roland Meyer, and Georg Zetzsche.
    In Proceedings of LICS 2016.
    PDF | DOI

  37. Complexity of regular abstractions of one-counter languages, by Mohammed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K Narayan Kumar, Prakash Saivasan, and Georg Zetzsche.
    In Proceedings of LICS 2016.
    arXiv

  38. Acceleration in Multi-PushDown Systems, by Prakash Saivasan, K Narayan Kumar, and Mohammed Faouzi Atig.
    In Proceedings of TACAS 2016.
    DOI

  39. The Emptiness Problem for Valence Automata or: Another Decidable Extension of Petri Nets, by Georg Zetzsche.
    In Proceedings of RP 2015.
    DOI

  40. An Approach to Computing Downward Closures, by Georg Zetzsche.
    In Proceedings of ICALP 2015.
    DOI | arXiv

  41. Computing downward closures for stacked counter automata, by Georg Zetzsche.
    In Proceedings of STACS 2015.
    DOI | arXiv

  42. What's Decidable about Availability Languages?, by Parosh Abdulla, Mohamed Faouzi Atig, Roland Meyer, and Mehdi Seyed Salehi.
    In Proceedings of FSTTCS 2015.
    PDF | DOI | BibTeX

  43. Antichains for Recursive Program Verification, by Lukas Holik and Roland Meyer.
    In Proceedings of NETYS 2015.
    PDF | Correction | DOI | BibTeX

  44. From Program Verification to Time and Space: The Scientific Life of Ernst-Rüdiger Olderog, by Roland Meyer and Heike Wehrheim.
    In Proceedings of Symposium in Honor of Ernst-Rüdiger Olderog.
    DOI | BibTeX

  45. Lazy TSO Reachability, by Ahmed Bouajjani, Georgel Calin, Egor Derevenetc, and Roland Meyer.
    In Proceedings of FASE 2015.
    arXiv | DOI | BibTeX

  46. Building A State-Of-The-Art Model Checker, by Sebastian Wolff.
    In 45. Jahrestagung der Gesellschaft für Informatik, Informatik 2015, Informatik, Energie und Umwelt, 28. September - 2. Oktober 2015 in Cottbus, Deutschland, 2015.
    PDF | Slides | Code on GitHub

  47. Memory-Model-Aware Testing - a Unified Complexity Analysis, by Florian Furbach, Roland Meyer, Klaus Schneider, and Maximilian Senftleben.
    In Proceedings of ACSD 2014.

    ACSD 2014 best paper award.
    DOI | PDF

  48. Bounds on Mobility, by Reiner Hüchting, Rupak Majumdar, and Roland Meyer.
    In Proceedings of CONCUR 2014.
    PDF | DOI | BibTeX

  49. The Monoid of Queue Actions, by Martin Huschenbett, Dietrich Kuske, and Georg Zetzsche.
    In Proceedings of MFCS 2014.
    DOI | arXiv

  50. On Boolean closed full trios and rational Kripke frames, by Markus Lohrey and Georg Zetzsche.
    In Proceedings of STACS 2014.
    DOI

  51. Checking and Enforcing Robustness against Relaxed Memory Models, by Ahmed Bouajjani, Egor Derevenetc, and Roland Meyer.
    In Proceedings of SE 2014.
    PDF

  52. Robustness against Power is PSPACE-complete, by Egor Derevenetc and Roland Meyer.
    In Proceedings of ICALP 2014.
    arXiv | DOI | BibTeX

  53. On Bounded Reachability Analysis of Shared Memory Systems, by Prakash Saivasan, K Narayan Kumar, Mohammed Faouzi Atig, and Ahmed Bouajjani.
    In Proceedings of FSTTCS 2014.
    DOI

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  69. A Sufficient Condition for Erasing Productions to Be Avoidable, by Georg Zetzsche.
    In Proceedings of DLT 2011.
    DOI

  70. On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids, by Georg Zetzsche.
    In Proceedings of ICALP 2011.
    arXiv | DOI

  71. Petri Net Reachability Graphs: Decidability Status of FO Properties, by Ph. Darondeau, S. Demri, Roland Meyer, and C. Morvan.
    In Proceedings of FSTTCS 2011.
    DOI | BibTeX

  72. Deciding Robustness against Total Store Ordering, by Ahmed Bouajjani, Roland Meyer, and Eike Möhlmann.
    In Proceedings of ICALP 2011.
    DOI | BibTeX

  73. On Erasing Productions in Random Context Grammars, by Georg Zetzsche.
    In Proceedings of ICALP 2010.
    DOI

  74. Kleene, Rabin, and Scott are available, by Jochen Hoenicke, Roland Meyer, and Ernst-Rüdiger Olderog.
    In Proceedings of CONCUR 2010.
    PDF | DOI | BibTeX

  75. The downward-closure of Petri net languages, by Peter Habermehl, Roland Meyer, and Harro Wimmel.
    In Proceedings of ICALP 2010.
    Slides | PDF | DOI | BibTeX

  76. Petruchio: From dynamic networks to nets, by Roland Meyer and Tim Strazny.
    In Proceedings of CAV 2010.
    PDF | DOI | BibTeX

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

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

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

  80. Labeled Step Sequences in Petri Nets, by Matthias Jantzen and Georg Zetzsche.
    In Proceedings of PETRI NETS 2008.
    DOI

  81. On boundedness in depth in the pi-calculus, by Roland Meyer.
    In Proceedings of IFIP TCS 2008.
    Slides | PDF | DOI | BibTeX

  82. A practical approach to verification of mobile systems using net unfoldings, by Roland Meyer, Victor Khomenko, and Tim Strazny.
    In Proceedings of PETRI NETS 2008.
    Slides | PDF | DOI | BibTeX

  83. Model checking data-dependent real-time properties of the European Train Control System, by Johannes Faber and Roland Meyer.
    In Proceedings of FMCAD 2006.
    DOI | BibTeX | Slides

  84. Model checking duration calculus: A practical approach, by Roland Meyer, Johannes Faber, and Andrey Rybalchenko.
    In Proceedings of ICTAC 2006.
    PDF | DOI | BibTeX

  85. Compositional semantics for UML 2.0 sequence diagrams using Petri nets, by Christoph Eichner, Hans Fleischhack, Roland Meyer, Ulrik Schrimpf, and Christian Stehno.
    In Proceedings of SDL 2005.
    DOI | BibTeX

Editor

  1. Karima Echihabi and Roland Meyer, editors. Proceedings of the 09th International Conference on Networked Systems (NETYS), 12754 of LNCS. Springer, 2021.
    DOI | BibTeX

  2. Roland Meyer and Uwe Nestmann, editors. Selected Papers of the 28th International Conference on Concurrency Theory (CONCUR 2017), 15(3/4). Logical Methods in Computer Science (LMCS), 2019.
    Webpage | BibTeX

  3. Stefan Haar and Roland Meyer, editors. Special Issue on ACSD 2015, ACM Transactions on Embedded Computing Systems (TECS), 16(2). ACM, 2017.
    Webpage | BibTeX

  4. Roland Meyer and Uwe Nestmann, editors. Proceedings of the 28th International Conference on Concurrency Theory (CONCUR), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017.
    Webpage | BibTeX

  5. Stefan Haar and Roland Meyer, editors. Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD), IEEE Computer Society Press, 2015.
    Webpage | BibTeX

  6. Roland Meyer, Andre Platzer, and Heike Wehrheim, editors. Correct System Design: Symposium in Honor of Ernst-Rüdiger Olderog on the Occasion of His 60th Birthday, Proceedings , 9360 of LNCS. Springer, 2015.
    DOI | BibTeX

  7. M. Diehl, H. Lipskoch, Roland Meyer, and C. Storm, editors. Proceedings des gemeinsamen Workshops der Graduiertenkollegs , 4 of Trustworthy Software Systems. GITO, 2008.

Journal articles

  1. Liveness in Broadcast Networks, by Peter Chini, Roland Meyer, and Prakash Saivasan.
    Computing, 2021.
    Conference Version | Full Version @ arXiv

  2. Fine-Grained Complexity of Safety Verification, by Peter Chini, Roland Meyer, and Prakash Saivasan.
    Journal of Automated Reasoning, 2020.
    DOI | arXiv

  3. Fine-Grained Complexity of Program Verification Tasks, by Peter Chini, Roland Meyer, and Prakash Saivasan.
    Parameterized Complexity Newsletter, 2019.
    PDF

  4. Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups, by Daniel König, Markus Lohrey, and Georg Zetzsche.
    Contemporary Mathematics, 2016.
    arXiv

  5. Memory-Model-Aware Testing - a Unified Complexity Analysis, by Florian Furbach, Roland Meyer, Klaus Schneider, and Maximilian Senftleben.
    ACM Transactions on Embedded Computing Systems (TECS), 2015.
    PDF | BibTeX

  6. Rational subsets and submonoids of wreath products, by Markus Lohrey, Benjamin Steinberg, and Georg Zetzsche.
    Information and Computation, 2015.
    DOI | arXiv

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

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

  9. Toward Understanding the Generative Capacity of Erasing Rules in Matrix Grammars, by Georg Zetzsche.
    International Journal of Foundations of Computer Science, 2011.
    DOI

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

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

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

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

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

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

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

  17. Petri Net Controlled Finite Automata, by Berndt Farwer, Matthias Jantzen, Manfred Kudlek, Heiko Rölke, and Georg Zetzsche.
    Fundamenta Informaticae, 2008.

  18. Language Classes Defined by Concurrent Finite Automata, by Matthias Jantzen, Manfred Kudlek, and Georg Zetzsche.
    Fundamenta Informaticae, 2008.

  19. Model Checking Duration Calculus: A Practical Approach., by Roland Meyer, Johannes Faber, Jochen Hoenicke, and Andrey Rybalchenko.
    Formal Aspects of Computing, 2008.
    PDF | DOI | BibTeX

  20. Methods and algorithms for reconstructing assembler programs into high level language, by K.N. Dolgova, A. Chernov, and Egor Derevenetc.
    Problems of Information Security, 2008.
    PDF | BibTeX

  21. Trustworthy Software Systems: A Discussion of Basic Concepts and Terminology., by S. Becker, W. Hasselbring, A. Paul, M. Boskovic, H. Koziolek, J. Ploski, A. Dhama, H. Lipskoch, M. Rohr, , S. Giesecke, Roland Meyer, M. Swaminathan, J. Happe, M. Muhle, and T. Warns.
    ACM SIGSOFT Software Engineering Notes, 2006.
    DOI | BibTeX

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

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

  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. Multiset Storage Automata, by Manfred Kudlek, Patrick Totzke, and Georg Zetzsche.
    In Proceedings of the Workshop CS&P'2008, 2008.

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

  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. On Languages Accepted by Concurrent Finite Automata, by Matthias Jantzen, Manfred Kudlek, and Georg Zetzsche.
    In Proceedings of the Workshop CS&P'2007, 2007.

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

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

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

Theses

  1. Memory-Model-aware Static Analysis of Concurrent Programs, Master's Thesis by René Maseli.
    Technische Universität Braunschweig, 2021.
    PDF

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  2. 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.
    Technical Report 64, Sonderforschungsbereiche (SFB)/Transregio (TR) 14 AVACS, 2010.
    PDF

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

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

  5. Checking pi-calculus structural congruence is graph isomorphism complete, by Victor Khomenko and Roland Meyer.
    Technical Report CS-TR-1100, School of Computing Science, Newcastle University, 2008.
    PDF | BibTeX

  6. A practical approach to verification of mobile systems using net unfoldings, by Roland Meyer, Victor Khomenko, and Tim Strazny.
    Technical Report CS-TR-1064, School of Computing Science, Newcastle University, 2008.
    PDF | BibTeX

  7. On depth and breadth in the pi-calculus, by Roland Meyer.
    Technical Report 01/08, Department of Computing Science, University of Oldenburg, 2008.
    BibTeX