Roland Meyer

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 81

Top Venues

CoRR

Proc. ACM Program. Lang.

CONCUR

FSTTCS

University of Oldenburg, Germany (PHD)

Education History

University of Oldenburg, Germany

PHD

Publications

Roland Meyer, Jakob Tepe, Sebastian Wolff
Realizability in Semantics-Guided Synthesis Done Eagerly. CoRR (2024)
Pascal Baumann, Eren Keskin, Roland Meyer, Georg Zetzsche
Separability in Büchi Vass and Singly Non-Linear Systems of Inequalities. CoRR (2024)
Sören van der Wall, Roland Meyer
SNIP: Speculative Execution and Non-Interference Preservation for Compiler Transformations. CoRR (2024)
Eren Keskin, Roland Meyer
On the Separability Problem of VASS Reachability Languages. CoRR (2024)
Pascal Baumann, Eren Keskin, Roland Meyer, Georg Zetzsche
Separability in Büchi VASS and Singly Non-Linear Systems of Inequalities. ICALP (2024)
Eren Keskin, Roland Meyer
On the Separability Problem of VASS Reachability Languages. LICS (2024)
Micha Horlboge, Erwin Quiring, Roland Meyer, Konrad Rieck
I still know it's you! On Challenges in Anonymizing Source Code. Proc. Priv. Enhancing Technol. 2024 (3) (2024)
Roland Meyer, Thomas Wies, Sebastian Wolff
Context-Aware Separation Logic. CoRR (2023)
Roland Meyer, Anton Opaterny, Thomas Wies, Sebastian Wolff
nekton: A Linearizability Proof Checker. CAV (1) (2023)
Pascal Baumann, Roland Meyer, Georg Zetzsche
Regular Separability in Büchi VASS. STACS (2023)
Roland Meyer, Thomas Wies, Sebastian Wolff
Embedding Hindsight Reasoning in Separation Logic. Proc. ACM Program. Lang. 7 (PLDI) (2023)
Eren Keskin, Roland Meyer
Separability and Non-Determinizability of WSTS. CoRR (2023)
Eren Keskin, Roland Meyer, Sören van der Wall
Contextual Equivalence for Alternation and Urgency. CoRR (2023)
Roland Meyer, Thomas Wies, Sebastian Wolff
Make flows small again: revisiting the flow framework. CoRR (2023)
Thomas Haas, René Pascasl Maseli, Roland Meyer, Hernán Ponce de León
Static Analysis of Memory Models for SMT Encodings. Proc. ACM Program. Lang. 7 (OOPSLA2) (2023)
Pascal Baumann, Roland Meyer, Georg Zetzsche
Regular Separability in Büchi VASS. CoRR (2023)
Eren Keskin, Roland Meyer
Separability and Non-Determinizability of WSTS. CONCUR (2023)
Roland Meyer, Thomas Wies, Sebastian Wolff
Make Flows Small Again: Revisiting the Flow Framework. TACAS (1) (2023)
Hernán Ponce de León, Thomas Haas, Roland Meyer
Dartagnan: SMT-based Violation Witness Validation (Competition Contribution). TACAS (2) (2022)
Thomas Haas, Roland Meyer, Hernán Ponce de León
CAAT: consistency as a theory. Proc. ACM Program. Lang. 6 (OOPSLA2) (2022)
Mike Becker, Roland Meyer, Tobias Runge, Ina Schaefer, Sören van der Wall, Sebastian Wolff
Model-based Fault Classification for Automotive Software. CoRR (2022)
Micha Horlboge, Erwin Quiring, Roland Meyer, Konrad Rieck
I still know it's you! On Challenges in Anonymizing Source Code. CoRR (2022)
Peter Chini, Roland Meyer, Prakash Saivasan
Liveness in broadcast networks. Computing 104 (10) (2022)
Roland Meyer, Thomas Wies, Sebastian Wolff
A Concurrent Program Logic with a Future and History. CoRR (2022)
Mike Becker, Roland Meyer, Tobias Runge, Ina Schaefer, Sören van der Wall, Sebastian Wolff
Model-Based Fault Classification for Automotive Software. APLAS (2022)
Roland Meyer, Thomas Wies, Sebastian Wolff
Embedding Hindsight Reasoning in Separation Logic. CoRR (2022)
Roland Meyer, Thomas Wies, Sebastian Wolff
A concurrent program logic with a future and history. Proc. ACM Program. Lang. 6 (OOPSLA2) (2022)
Shankara Narayanan Krishna, Adwait Godbole, Roland Meyer, Soham Chakraborty
Parameterized Verification under Release Acquire is PSPACE-complete. PODC (2022)
Hernán Ponce de León, Thomas Haas, Roland Meyer
Dartagnan: Leveraging Compiler Optimizations and the Price of Precision (Competition Contribution). TACAS (2) (2021)
Adwait Godbole, Shankara Narayanan Krishna, Roland Meyer
Safety Verification of Parameterized Systems under Release-Acquire. CoRR (2021)
Hernán Ponce de León, Florian Furbach, Keijo Heljanko, Roland Meyer
Dartagnan: Bounded Model Checking for Weak Memory Models (Competition Contribution). TACAS (2) (2020)
Roland Meyer, Sebastian Wolff
Pointer life cycle types for lock-free data structures with memory reclamation. Proc. ACM Program. Lang. 4 (POPL) (2020)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Egor Derevenetc, Carl Leonardsson, Roland Meyer
On the State Reachability Problem for Concurrent Programs Under Power. NETYS (2020)
Roland Meyer, Sören van der Wall
On the Complexity of Multi-Pushdown Games. FSTTCS (2020)
Peter Chini, Roland Meyer, Prakash Saivasan
Fine-Grained Complexity of Safety Verification. J. Autom. Reason. 64 (7) (2020)
Natalia Gavrilenko, Hernán Ponce de León, Florian Furbach, Keijo Heljanko, Roland Meyer
BMC for Weak Memory Models: Relation Analysis for Compact SMT Encodings. CAV (1) (2019)
Peter Chini, Roland Meyer, Prakash Saivasan
Complexity of Liveness in Parameterized Systems. CoRR (2019)
Juliane Krämer, Roland Meyer
Sicherheit, Zuverlässigkeit, Korrektheit. GI-Jahrestagung (2019)
Roland Meyer, Sebastian Wolff
Pointer Life Cycle Types for Lock-Free Data Structures with Memory Reclamation. CoRR (2019)
Peter Chini, Roland Meyer, Prakash Saivasan
Liveness in Broadcast Networks. NETYS (2019)
Peter Chini, Roland Meyer, Prakash Saivasan
Liveness in Broadcast Networks. CoRR (2019)
Roland Meyer, Sebastian Wolff
Decoupling lock-free data structures from memory reclamation for static analysis. Proc. ACM Program. Lang. 3 (POPL) (2019)
Peter Chini, Roland Meyer, Prakash Saivasan
Complexity of Liveness in Parameterized Systems. FSTTCS (2019)
Rehab Massoud, Hoang M. Le, Peter Chini, Prakash Saivasan, Roland Meyer, Rolf Drechsler
Temporal Tracing of On-Chip Signals using Timeprints. DAC (2019)
Matthew Hague, Roland Meyer, Sebastian Muskalla, Martin Zimmermann
Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems. CoRR (2018)
Peter Chini, Roland Meyer, Prakash Saivasan
Fine-Grained Complexity of Safety Verification. TACAS (2) (2018)
Hernán Ponce de León, Florian Furbach, Keijo Heljanko, Roland Meyer
BMC with Memory Models as Modules. FMCAD (2018)
Matthew Hague, Roland Meyer, Sebastian Muskalla, Martin Zimmermann
Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems. MFCS (2018)
Roland Meyer, Sebastian Muskalla, Georg Zetzsche
Bounded Context Switching for Valence Systems. CONCUR (2018)
Peter Chini, Roland Meyer, Prakash Saivasan
Fine-Grained Complexity of Safety Verification. CoRR (2018)
Roland Meyer, Sebastian Muskalla, Georg Zetzsche
Bounded Context Switching for Valence Systems. CoRR (2018)
Roland Meyer, Sebastian Wolff
Reasoning About Weak Semantics via Strong Semantics. Principled Software Development (2018)
Peter Chini, Rehab Massoud, Roland Meyer, Prakash Saivasan
Fast Witness Counting. CoRR (2018)
Wojciech Czerwinski, Slawomir Lasota, Roland Meyer, Sebastian Muskalla, K. Narayan Kumar, Prakash Saivasan
Regular Separability of Well-Structured Transition Systems. CONCUR (2018)
Roland Meyer, Sebastian Wolff
Decoupling Lock-Free Data Structures from Memory Reclamation for Static Analysis. CoRR (2018)
Egor Derevenetc, Roland Meyer, Sebastian Schweizer
Locality and Singularity for Store-Atomic Memory Models. CoRR (2017)
Matthew Hague, Roland Meyer, Sebastian Muskalla
Domains for Higher-Order Games. CoRR (2017)
Hernán Ponce de León, Florian Furbach, Keijo Heljanko, Roland Meyer
Portability Analysis for Weak Memory Models. PORTHOS: One Tool for all Models. SAS (2017)
Roland Meyer, Sebastian Muskalla, Elisabeth Neumann
Liveness Verification and Synthesis: New Algorithms for Recursive Programs. CoRR (2017)
Egor Derevenetc, Roland Meyer, Sebastian Schweizer
Locality and Singularity for Store-Atomic Memory Models. NETYS (2017)
Lukás Holík, Roland Meyer, Tomás Vojnar, Sebastian Wolff
Effect Summaries for Thread-Modular Analysis. CoRR (2017)
Hernán Ponce de León, Florian Furbach, Keijo Heljanko, Roland Meyer
Portability Analysis for Axiomatic Memory Models. PORTHOS: One Tool for all Models. CoRR (2017)
Stefan Haar, Roland Meyer
Message from the Guest Editors. ACM Trans. Embed. Comput. Syst. 16 (2) (2017)
Matthew Hague, Roland Meyer, Sebastian Muskalla
Domains for Higher-Order Games. MFCS (2017)
Mohamed Faouzi Atig, Roland Meyer, Sebastian Muskalla, Prakash Saivasan
On the Upward/Downward Closures of Petri Nets. MFCS (2017)
Lukás Holík, Roland Meyer, Tomás Vojnar, Sebastian Wolff
Effect Summaries for Thread-Modular Analysis - Sound Analysis Despite an Unsound Heuristic. SAS (2017)
Peter Chini, Jonathan Kolberg, Andreas Krebs, Roland Meyer, Prakash Saivasan
On the Complexity of Bounded Context Switching. ESA (2017)
Mohamed Faouzi Atig, Roland Meyer, Sebastian Muskalla, Prakash Saivasan
On the Upward/Downward Closures of Petri Nets. CoRR (2017)
Roland Meyer, Sebastian Muskalla
Munchausen Iteration. CoRR (2016)
Frédéric Haziza, Lukás Holík, Roland Meyer, Sebastian Wolff
Pointer Race Freedom. VMCAI (2016)
Lukás Holík, Roland Meyer, Sebastian Muskalla
Summaries for Context-Free Games. FSTTCS (2016)
Peter Chini, Jonathan Kolberg, Roland Meyer, Prakash Saivasan
On the Complexity of Bounded Context Switching. CoRR (2016)
Lukás Holík, Roland Meyer, Sebastian Muskalla
Antichains for Inclusion Games. CoRR (2016)
Emanuele D'Osualdo, Roland Meyer, Georg Zetzsche
First-order logic with reachability for infinite-state systems. LICS (2016)
Lukás Holík, Roland Meyer
Antichains for the Verification of Recursive Programs. NETYS (2015)
Ahmed Bouajjani, Georgel Calin, Egor Derevenetc, Roland Meyer
Lazy TSO Reachability. CoRR (2015)
Frédéric Haziza, Lukás Holík, Roland Meyer, Sebastian Wolff
Pointer Race Freedom. CoRR (2015)
Ahmed Bouajjani, Georgel Calin, Egor Derevenetc, Roland Meyer
Lazy TSO Reachability. FASE (2015)
Florian Furbach, Roland Meyer, Klaus Schneider, Maximilian Senftleben
Memory-Model-Aware Testing: A Unified Complexity Analysis. ACM Trans. Embed. Comput. Syst. 14 (4) (2015)
Roland Meyer, Heike Wehrheim
From Program Verification to Time and Space: The Scientific Life of Ernst-Rüdiger Olderog. Correct System Design (2015)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Roland Meyer, Mehdi Seyed Salehi
What's Decidable about Availability Languages?. FSTTCS (2015)
Egor Derevenetc, Roland Meyer
Robustness against Power is PSpace-complete. ICALP (2) (2014)
Egor Derevenetc, Roland Meyer
Robustness against Power is PSPACE-complete. CoRR (2014)
Florian Furbach, Roland Meyer, Klaus Schneider, Maximilian Senftleben
Memory Model-Aware Testing - A Unified Complexity Analysis. ACSD (2014)
Reiner Hüchting, Rupak Majumdar, Roland Meyer
Bounds on Mobility. CONCUR (2014)
Ahmed Bouajjani, Egor Derevenetc, Roland Meyer
Robustness against Relaxed Memory Models. Software Engineering (2014)
Victor Khomenko, Roland Meyer, Reiner Hüchting
A Polynomial Translation of pi-calculus FCPs to Safe Petri Nets. Log. Methods Comput. Sci. 9 (3) (2013)
Georgel Calin, Egor Derevenetc, Rupak Majumdar, Roland Meyer
A Theory of Partitioned Global Address Spaces. CoRR (2013)
Ahmed Bouajjani, Egor Derevenetc, Roland Meyer
Checking and Enforcing Robustness against TSO. ESOP (2013)
Georgel Calin, Egor Derevenetc, Rupak Majumdar, Roland Meyer
A Theory of Partitioned Global Address Spaces. FSTTCS (2013)
Reiner Hüchting, Rupak Majumdar, Roland Meyer
A Theory of Name Boundedness. CONCUR (2013)
Rupak Majumdar, Roland Meyer, Zilong Wang
Static Provenance Verification for Message Passing Programs. SAS (2013)
Rupak Majumdar, Roland Meyer, Zilong Wang
Provenance Verification. RP (2013)
Roland Meyer, Victor Khomenko, Reiner Hüchting
A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets. CONCUR (2012)
Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan
Petri Net Reachability Graphs: Decidability Status of First Order Properties Log. Methods Comput. Sci. 8 (4) (2012)
Tim Strazny, Roland Meyer
An Algorithmic Framework for Coverability in Well-Structured Systems. ACSD (2012)
Zhenyue Long, Georgel Calin, Rupak Majumdar, Roland Meyer
Language-Theoretic Abstraction Refinement. FASE (2012)
Ahmed Bouajjani, Egor Derevenetc, Roland Meyer
Robustness Checking against TSO: Attacks and Defence CoRR (2012)
Ahmed Bouajjani, Roland Meyer, Eike Möhlmann
Deciding Robustness against Total Store Ordering. ICALP (2) (2011)
Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan
Petri Net Reachability Graphs: Decidability Status of FO Properties. FSTTCS (2011)

Roland Meyer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Roland Meyer