Institute of

Theoretical Computer Science

Carl-Friedrich-Gauß-Fakultät

Technische Universität Braunschweig

Publications 2019

Publications 2019

Conference contributions

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

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

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

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

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

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

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

Editor

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

Journal articles

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

Theses

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

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