Roland Meyer

According to our database, Roland Meyer authored at least 89 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2024

Realizability in Semantics-Guided Synthesis Done Eagerly.

Roland Meyer, Jakob Tepe, Sebastian Wolff

CoRR, 2024

On the Separability Problem of VASS Reachability Languages.

Eren Keskin, Roland Meyer

CoRR, 2024

2023

Static Analysis of Memory Models for SMT Encodings.

Thomas Haas, René Pascasl Maseli, Roland Meyer, Hernán Ponce de León

Proc. ACM Program. Lang., October, 2023

Embedding Hindsight Reasoning in Separation Logic.

Roland Meyer, Thomas Wies, Sebastian Wolff

Proc. ACM Program. Lang., 2023

Context-Aware Separation Logic.

Roland Meyer, Thomas Wies, Sebastian Wolff

CoRR, 2023

Contextual Equivalence for Alternation and Urgency.

Eren Keskin, Roland Meyer, Sören van der Wall

CoRR, 2023

Make Flows Small Again: Revisiting the Flow Framework.

Roland Meyer, Thomas Wies, Sebastian Wolff

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

Regular Separability in Büchi VASS.

Pascal Baumann, Roland Meyer, Georg Zetzsche

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Separability and Non-Determinizability of WSTS.

Eren Keskin, Roland Meyer

Proceedings of the 34th International Conference on Concurrency Theory, 2023

nekton: A Linearizability Proof Checker.

Roland Meyer, Anton Opaterny, Thomas Wies, Sebastian Wolff

Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022

A concurrent program logic with a future and history.

Roland Meyer, Thomas Wies, Sebastian Wolff

Proc. ACM Program. Lang., 2022

CAAT: consistency as a theory.

Thomas Haas, Roland Meyer, Hernán Ponce de León

Proc. ACM Program. Lang., 2022

I still know it's you! On Challenges in Anonymizing Source Code.

Micha Horlboge, Erwin Quiring, Roland Meyer, Konrad Rieck

CoRR, 2022

Liveness in broadcast networks.

Peter Chini, Roland Meyer, Prakash Saivasan

Computing, 2022

Dartagnan: SMT-based Violation Witness Validation (Competition Contribution).

Hernán Ponce de León, Thomas Haas, Roland Meyer

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

Parameterized Verification under Release Acquire is PSPACE-complete.

Shankaranarayanan Krishna, Adwait Godbole, Roland Meyer, Soham Chakraborty

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Model-Based Fault Classification for Automotive Software.

Mike Becker, Roland Meyer, Tobias Runge, Ina Schaefer, Sören van der Wall, Sebastian Wolff

Proceedings of the Programming Languages and Systems - 20th Asian Symposium, 2022

2021

Verifying and Optimizing Compact NUMA-Aware Locks on Weak Memory Models.

Antonio Paolillo, Hernán Ponce de León, Thomas Haas, Diogo Behrens, Rafael Lourenco de Lima Chehab, Ming Fu, Roland Meyer

CoRR, 2021

Safety Verification of Parameterized Systems under Release-Acquire.

Adwait Godbole, Shankara Narayanan Krishna, Roland Meyer

CoRR, 2021

Dartagnan: Leveraging Compiler Optimizations and the Price of Precision (Competition Contribution).

Hernán Ponce de León, Thomas Haas, Roland Meyer

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2021

2020

Pointer life cycle types for lock-free data structures with memory reclamation.

Roland Meyer, Sebastian Wolff

Proc. ACM Program. Lang., 2020

Fine-Grained Complexity of Safety Verification.

Peter Chini, Roland Meyer, Prakash Saivasan

J. Autom. Reason., 2020

Dartagnan: Bounded Model Checking for Weak Memory Models (Competition Contribution).

Hernán Ponce de León, Florian Furbach, Keijo Heljanko, Roland Meyer

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2020

On the State Reachability Problem for Concurrent Programs Under Power.

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Egor Derevenetc, Carl Leonardsson, Roland Meyer

Proceedings of the Networked Systems - 8th International Conference, 2020

On the Complexity of Multi-Pushdown Games.

Roland Meyer, Sören van der Wall

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019

Decoupling lock-free data structures from memory reclamation for static analysis.

Roland Meyer, Sebastian Wolff

Proc. ACM Program. Lang., 2019

Sicherheit, Zuverlässigkeit, Korrektheit.

Juliane Krämer, Roland Meyer

Proceedings of the 49. Jahrestagung der Gesellschaft für Informatik, 50 Jahre Gesellschaft für Informatik, 2019

Complexity of Liveness in Parameterized Systems.

Peter Chini, Roland Meyer, Prakash Saivasan

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Temporal Tracing of On-Chip Signals using Timeprints.

Rehab Massoud, Hoang M. Le, Peter Chini, Prakash Saivasan, Roland Meyer, Rolf Drechsler

Proceedings of the 56th Annual Design Automation Conference 2019, 2019

BMC for Weak Memory Models: Relation Analysis for Compact SMT Encodings.

Natalia Gavrilenko, Hernán Ponce de León, Florian Furbach, Keijo Heljanko, Roland Meyer

Proceedings of the Computer Aided Verification - 31st International Conference, 2019

Inductive Counting and the Reachability Problem for Petri Nets.

Peter Chini, Roland Meyer

Proceedings of the Carl Adam Petri: Ideas, Personality, Impact, 2019

2018

Fast Witness Counting.

Peter Chini, Rehab Massoud, Roland Meyer, Prakash Saivasan

CoRR, 2018

Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems.

Matthew Hague, Roland Meyer, Sebastian Muskalla, Martin Zimmermann

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

BMC with Memory Models as Modules.

Hernán Ponce de León, Florian Furbach, Keijo Heljanko, Roland Meyer

Proceedings of the 2018 Formal Methods in Computer Aided Design, 2018

Bounded Context Switching for Valence Systems.

Roland Meyer, Sebastian Muskalla, Georg Zetzsche

Proceedings of the 29th International Conference on Concurrency Theory, 2018

Regular Separability of Well-Structured Transition Systems.

Wojciech Czerwinski, Slawomir Lasota, Roland Meyer, Sebastian Muskalla, K. Narayan Kumar, Prakash Saivasan

Proceedings of the 29th International Conference on Concurrency Theory, 2018

Reasoning About Weak Semantics via Strong Semantics.

Roland Meyer, Sebastian Wolff

Proceedings of the Principled Software Development, 2018

2017

Message from the Guest Editors.

Stefan Haar, Roland Meyer

ACM Trans. Embed. Comput. Syst., 2017

Liveness Verification and Synthesis: New Algorithms for Recursive Programs.

Roland Meyer, Sebastian Muskalla, Elisabeth Neumann

CoRR, 2017

Portability Analysis for Axiomatic Memory Models. PORTHOS: One Tool for all Models.

Hernán Ponce de León, Florian Furbach, Keijo Heljanko, Roland Meyer

CoRR, 2017

Effect Summaries for Thread-Modular Analysis.

Lukás Holík, Roland Meyer, Tomás Vojnar, Sebastian Wolff

CoRR, 2017

Portability Analysis for Weak Memory Models. PORTHOS: One Tool for all Models.

Hernán Ponce de León, Florian Furbach, Keijo Heljanko, Roland Meyer

Proceedings of the Static Analysis - 24th International Symposium, 2017

Effect Summaries for Thread-Modular Analysis - Sound Analysis Despite an Unsound Heuristic.

Lukás Holík, Roland Meyer, Tomás Vojnar, Sebastian Wolff

Proceedings of the Static Analysis - 24th International Symposium, 2017

Locality and Singularity for Store-Atomic Memory Models.

Egor Derevenetc, Roland Meyer, Sebastian Schweizer

Proceedings of the Networked Systems - 5th International Conference, 2017

Domains for Higher-Order Games.

Matthew Hague, Roland Meyer, Sebastian Muskalla

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

On the Upward/Downward Closures of Petri Nets.

Mohamed Faouzi Atig, Roland Meyer, Sebastian Muskalla, Prakash Saivasan

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

On the Complexity of Bounded Context Switching.

Peter Chini, Jonathan Kolberg, Andreas Krebs, Roland Meyer, Prakash Saivasan

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Munchausen Iteration.

Roland Meyer, Sebastian Muskalla

CoRR, 2016

Antichains for Inclusion Games.

Lukás Holík, Roland Meyer, Sebastian Muskalla

CoRR, 2016

On the Complexity of Bounded Context Switching.

Peter Chini, Jonathan Kolberg, Roland Meyer, Prakash Saivasan

CoRR, 2016

Pointer Race Freedom.

Frédéric Haziza, Lukás Holík, Roland Meyer, Sebastian Wolff

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2016

First-order logic with reachability for infinite-state systems.

Emanuele D'Osualdo, Roland Meyer, Georg Zetzsche

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Summaries for Context-Free Games.

Lukás Holík, Roland Meyer, Sebastian Muskalla

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

Memory-Model-Aware Testing: A Unified Complexity Analysis.

Florian Furbach, Roland Meyer, Klaus Schneider, Maximilian Senftleben

ACM Trans. Embed. Comput. Syst., 2015

Antichains for the Verification of Recursive Programs.

Lukás Holík, Roland Meyer

Proceedings of the Networked Systems - Third International Conference, 2015

What's Decidable about Availability Languages?.

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Roland Meyer, Mehdi Seyed Salehi

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Lazy TSO Reachability.

Ahmed Bouajjani, Georgel Calin, Egor Derevenetc, Roland Meyer

Proceedings of the Fundamental Approaches to Software Engineering, 2015

From Program Verification to Time and Space: The Scientific Life of Ernst-Rüdiger Olderog.

Roland Meyer, Heike Wehrheim

Proceedings of the Correct System Design, 2015

2014

Robustness against Relaxed Memory Models.

Ahmed Bouajjani, Egor Derevenetc, Roland Meyer

Proceedings of the Software Engineering 2014, Fachtagung des GI-Fachbereichs Softwaretechnik, 25. Februar, 2014

Robustness against Power is PSpace-complete.

Egor Derevenetc, Roland Meyer

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Bounds on Mobility.

Reiner Hüchting, Rupak Majumdar, Roland Meyer

Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

2013

A Polynomial Translation of pi-calculus FCPs to Safe Petri Nets.

Victor Khomenko, Roland Meyer, Reiner Hüchting

Log. Methods Comput. Sci., 2013

Static Provenance Verification for Message Passing Programs.

Rupak Majumdar, Roland Meyer, Zilong Wang

Proceedings of the Static Analysis - 20th International Symposium, 2013

Provenance Verification.

Rupak Majumdar, Roland Meyer, Zilong Wang

Proceedings of the Reachability Problems - 7th International Workshop, 2013

A Theory of Partitioned Global Address Spaces.

Georgel Calin, Egor Derevenetc, Rupak Majumdar, Roland Meyer

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Checking and Enforcing Robustness against TSO.

Ahmed Bouajjani, Egor Derevenetc, Roland Meyer

Proceedings of the Programming Languages and Systems, 2013

A Theory of Name Boundedness.

Reiner Hüchting, Rupak Majumdar, Roland Meyer

Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

2012

Petri Net Reachability Graphs: Decidability Status of First Order Properties

Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan

Log. Methods Comput. Sci., 2012

Robustness Checking against TSO: Attacks and Defence

Ahmed Bouajjani, Egor Derevenetc, Roland Meyer

CoRR, 2012

Language-Theoretic Abstraction Refinement.

Zhenyue Long, Georgel Calin, Rupak Majumdar, Roland Meyer

Proceedings of the Fundamental Approaches to Software Engineering, 2012

A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets.

Roland Meyer, Victor Khomenko, Reiner Hüchting

Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

An Algorithmic Framework for Coverability in Well-Structured Systems.

Tim Strazny, Roland Meyer

Proceedings of the 12th International Conference on Application of Concurrency to System Design, 2012

2011

Deciding Robustness against Total Store Ordering.

Ahmed Bouajjani, Roland Meyer, Eike Möhlmann

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Petri Net Reachability Graphs: Decidability Status of FO Properties.

Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010

The Downward-Closure of Petri Net Languages.

Peter Habermehl, Roland Meyer, Harro Wimmel

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Kleene, Rabin, and Scott Are Available.

Jochen Hoenicke, Roland Meyer, Ernst-Rüdiger Olderog

Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

Petruchio: From Dynamic Networks to Nets.

Roland Meyer, Tim Strazny

Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

2009

Structural stationarity in the π-calculus.

Roland Meyer

PhD thesis, 2009

A Practical Approach to Verification of Mobile Systems Using Net Unfoldings.

Roland Meyer, Victor Khomenko, Tim Strazny

Fundam. Informaticae, 2009

A theory of structural stationarity in the <i>pi</i> -Calculus.

Roland Meyer

Acta Informatica, 2009

Strukturelle Stationarität.

Roland Meyer

Proceedings of the Ausgezeichnete Informatikdissertationen 2009, 2009

On the Relationship between π-Calculus and Finite Place/Transition Petri Nets.

Roland Meyer, Roberto Gorrieri

Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

Checking pi-Calculus Structural Congruence is Graph Isomorphism Complete.

Victor Khomenko, Roland Meyer

Proceedings of the Ninth International Conference on Application of Concurrency to System Design, 2009

2008

Model checking Duration Calculus: a practical approach.

Roland Meyer, Johannes Faber, Jochen Hoenicke, Andrey Rybalchenko

Formal Aspects Comput., 2008

On Boundedness in Depth in the pi-Calculus.

Roland Meyer

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

2006

Trustworthy software systems: a discussion of basic concepts and terminology.

Steffen Becker, Wilhelm Hasselbring, Alexandra Paul, Marko Boskovic, Heiko Koziolek, Jan Ploski, Abhishek Dhama, Henrik Lipskoch, Matthias Rohr, Daniel Winteler, Simon Giesecke, Roland Meyer, Mani Swaminathan, Jens Happe, Margarete Muhle, Timo Warns

ACM SIGSOFT Softw. Eng. Notes, 2006

Model Checking Duration Calculus: A Practical Approach.

Roland Meyer, Johannes Faber, Andrey Rybalchenko

Proceedings of the Theoretical Aspects of Computing, 2006

Model Checking Data-Dependent Real-Time Properties of the European Train Control System.

Johannes Faber, Roland Meyer

Proceedings of the Formal Methods in Computer-Aided Design, 6th International Conference, 2006

2005

Compositional Semantics for UML 2.0 Sequence Diagrams Using Petri Nets.

Christoph Eichner, Hans Fleischhack, Roland Meyer, Ulrik Schrimpf, Christian Stehno

Proceedings of the SDL 2005: Model Driven, 2005