default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoland Meyer 0001
Person information
- affiliation: TU Braunschweig, Germany
- affiliation (former): University of Kaiserslautern, Germany
- affiliation (former): LIAFA, University Paris Diderot (Paris 7), France
- affiliation (PhD 2009): University of Oldenburg, Germany
Other persons with the same name
- Roland Meyer 0002 — University of Hanover, Hannover, Germany
- Roland Meyer 0003 — Karlsruhe University of Arts and Design, Germany
- Roland Meyer 0004 — Humboldt University Berlin, Department of West-Slavic Languages, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c62]Eren Keskin, Roland Meyer, Sören van der Wall:
Urgency Annotations for Alternating Choices. Principles of Verification (3) 2025: 351-373- 2024
- [j17]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): 744-760 (2024) - [c61]Pascal Baumann, Eren Keskin, Roland Meyer, Georg Zetzsche
:
Separability in Büchi VASS and Singly Non-Linear Systems of Inequalities. ICALP 2024: 126:1-126:19 - [c60]Eren Keskin, Roland Meyer:
On the Separability Problem of VASS Reachability Languages. LICS 2024: 49:1-49:14 - [i37]Eren Keskin, Roland Meyer:
On the Separability Problem of VASS Reachability Languages. CoRR abs/2401.16095 (2024) - [i36]Roland Meyer, Jakob Tepe, Sebastian Wolff:
Realizability in Semantics-Guided Synthesis Done Eagerly. CoRR abs/2403.05607 (2024) - [i35]Pascal Baumann, Eren Keskin, Roland Meyer, Georg Zetzsche:
Separability in Büchi Vass and Singly Non-Linear Systems of Inequalities. CoRR abs/2406.01008 (2024) - [i34]Sören van der Wall, Roland Meyer:
SNIP: Speculative Execution and Non-Interference Preservation for Compiler Transformations. CoRR abs/2407.15080 (2024) - 2023
- [j16]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): 1618-1647 (2023) - [j15]Roland Meyer, Thomas Wies, Sebastian Wolff:
Embedding Hindsight Reasoning in Separation Logic. Proc. ACM Program. Lang. 7(PLDI): 1848-1871 (2023) - [c59]Roland Meyer, Anton Opaterny, Thomas Wies, Sebastian Wolff:
nekton: A Linearizability Proof Checker. CAV (1) 2023: 170-183 - [c58]Eren Keskin, Roland Meyer:
Separability and Non-Determinizability of WSTS. CONCUR 2023: 8:1-8:17 - [c57]Pascal Baumann, Roland Meyer, Georg Zetzsche:
Regular Separability in Büchi VASS. STACS 2023: 9:1-9:19 - [c56]Roland Meyer, Thomas Wies, Sebastian Wolff:
Make Flows Small Again: Revisiting the Flow Framework. TACAS (1) 2023: 628-646 - [i33]Pascal Baumann, Roland Meyer, Georg Zetzsche:
Regular Separability in Büchi VASS. CoRR abs/2301.11242 (2023) - [i32]Roland Meyer, Thomas Wies, Sebastian Wolff:
Make flows small again: revisiting the flow framework. CoRR abs/2304.04886 (2023) - [i31]Eren Keskin, Roland Meyer:
Separability and Non-Determinizability of WSTS. CoRR abs/2305.02736 (2023) - [i30]Eren Keskin, Roland Meyer, Sören van der Wall:
Contextual Equivalence for Alternation and Urgency. CoRR abs/2305.02967 (2023) - [i29]Roland Meyer, Thomas Wies, Sebastian Wolff:
Context-Aware Separation Logic. CoRR abs/2307.15549 (2023) - 2022
- [j14]Peter Chini, Roland Meyer, Prakash Saivasan:
Liveness in broadcast networks. Computing 104(10): 2203-2223 (2022) - [j13]Thomas Haas, Roland Meyer, Hernán Ponce de León:
CAAT: consistency as a theory. Proc. ACM Program. Lang. 6(OOPSLA2): 114-144 (2022) - [j12]Roland Meyer, Thomas Wies, Sebastian Wolff:
A concurrent program logic with a future and history. Proc. ACM Program. Lang. 6(OOPSLA2): 1378-1407 (2022) - [c55]Mike Becker, Roland Meyer, Tobias Runge, Ina Schaefer, Sören van der Wall, Sebastian Wolff:
Model-Based Fault Classification for Automotive Software. APLAS 2022: 110-131 - [c54]Shankaranarayanan Krishna, Adwait Godbole, Roland Meyer, Soham Chakraborty:
Parameterized Verification under Release Acquire is PSPACE-complete. PODC 2022: 482-492 - [c53]Hernán Ponce de León, Thomas Haas, Roland Meyer:
Dartagnan: SMT-based Violation Witness Validation (Competition Contribution). TACAS (2) 2022: 418-423 - [i28]Roland Meyer, Thomas Wies, Sebastian Wolff:
A Concurrent Program Logic with a Future and History. CoRR abs/2207.02355 (2022) - [i27]Micha Horlboge, Erwin Quiring, Roland Meyer, Konrad Rieck:
I still know it's you! On Challenges in Anonymizing Source Code. CoRR abs/2208.12553 (2022) - [i26]Mike Becker, Roland Meyer, Tobias Runge, Ina Schaefer, Sören van der Wall, Sebastian Wolff:
Model-based Fault Classification for Automotive Software. CoRR abs/2208.14290 (2022) - [i25]Roland Meyer, Thomas Wies, Sebastian Wolff:
Embedding Hindsight Reasoning in Separation Logic. CoRR abs/2209.13692 (2022) - 2021
- [c52]Hernán Ponce de León, Thomas Haas, Roland Meyer:
Dartagnan: Leveraging Compiler Optimizations and the Price of Precision (Competition Contribution). TACAS (2) 2021: 428-432 - [e3]Karima Echihabi, Roland Meyer:
Networked Systems - 9th International Conference, NETYS 2021, Virtual Event, May 19-21, 2021, Proceedings. Lecture Notes in Computer Science 12754, Springer 2021, ISBN 978-3-030-91013-6 [contents] - [i24]Adwait Godbole, Shankara Narayanan Krishna, Roland Meyer:
Safety Verification of Parameterized Systems under Release-Acquire. CoRR abs/2101.12123 (2021) - [i23]Antonio Paolillo, Hernán Ponce de León, Thomas Haas, Diogo Behrens, Rafael Lourenco de Lima Chehab, Ming Fu, Roland Meyer:
Verifying and Optimizing Compact NUMA-Aware Locks on Weak Memory Models. CoRR abs/2111.15240 (2021) - 2020
- [j11]Peter Chini, Roland Meyer, Prakash Saivasan:
Fine-Grained Complexity of Safety Verification. J. Autom. Reason. 64(7): 1419-1444 (2020) - [j10]Roland Meyer, Sebastian Wolff:
Pointer life cycle types for lock-free data structures with memory reclamation. Proc. ACM Program. Lang. 4(POPL): 68:1-68:36 (2020) - [c51]Roland Meyer, Sören van der Wall:
On the Complexity of Multi-Pushdown Games. FSTTCS 2020: 52:1-52:35 - [c50]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: 47-59 - [c49]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: 378-382
2010 – 2019
- 2019
- [j9]Roland Meyer, Sebastian Wolff:
Decoupling lock-free data structures from memory reclamation for static analysis. Proc. ACM Program. Lang. 3(POPL): 58:1-58:31 (2019) - [c48]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: 355-365 - [c47]Rehab Massoud, Hoang M. Le, Peter Chini, Prakash Saivasan, Roland Meyer, Rolf Drechsler:
Temporal Tracing of On-Chip Signals using Timeprints. DAC 2019: 186 - [c46]Peter Chini, Roland Meyer, Prakash Saivasan:
Complexity of Liveness in Parameterized Systems. FSTTCS 2019: 37:1-37:15 - [c45]Juliane Krämer, Roland Meyer:
Sicherheit, Zuverlässigkeit, Korrektheit. GI-Jahrestagung 2019: 455-456 - [c44]Peter Chini, Roland Meyer, Prakash Saivasan:
Liveness in Broadcast Networks. NETYS 2019: 52-66 - [p2]Peter Chini, Roland Meyer:
Inductive Counting and the Reachability Problem for Petri Nets. Carl Adam Petri: Ideas, Personality, Impact 2019: 161-169 - [i22]Peter Chini, Roland Meyer, Prakash Saivasan:
Liveness in Broadcast Networks. CoRR abs/1904.00833 (2019) - [i21]Peter Chini, Roland Meyer, Prakash Saivasan:
Complexity of Liveness in Parameterized Systems. CoRR abs/1909.12004 (2019) - [i20]Roland Meyer, Sebastian Wolff:
Pointer Life Cycle Types for Lock-Free Data Structures with Memory Reclamation. CoRR abs/1910.11714 (2019) - 2018
- [c43]Roland Meyer, Sebastian Wolff:
Reasoning About Weak Semantics via Strong Semantics. Principled Software Development 2018: 283-303 - [c42]Roland Meyer, Sebastian Muskalla, Georg Zetzsche:
Bounded Context Switching for Valence Systems. CONCUR 2018: 12:1-12:18 - [c41]Wojciech Czerwinski, Slawomir Lasota, Roland Meyer, Sebastian Muskalla, K. Narayan Kumar, Prakash Saivasan:
Regular Separability of Well-Structured Transition Systems. CONCUR 2018: 35:1-35:18 - [c40]Hernán Ponce de León, Florian Furbach, Keijo Heljanko, Roland Meyer:
BMC with Memory Models as Modules. FMCAD 2018: 1-9 - [c39]Matthew Hague, Roland Meyer, Sebastian Muskalla, Martin Zimmermann:
Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems. MFCS 2018: 57:1-57:15 - [c38]Peter Chini, Roland Meyer, Prakash Saivasan:
Fine-Grained Complexity of Safety Verification. TACAS (2) 2018: 20-37 - [i19]Peter Chini, Roland Meyer, Prakash Saivasan:
Fine-Grained Complexity of Safety Verification. CoRR abs/1802.05559 (2018) - [i18]Roland Meyer, Sebastian Muskalla, Georg Zetzsche:
Bounded Context Switching for Valence Systems. CoRR abs/1803.09703 (2018) - [i17]Matthew Hague, Roland Meyer, Sebastian Muskalla, Martin Zimmermann:
Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems. CoRR abs/1805.02963 (2018) - [i16]Peter Chini, Rehab Massoud, Roland Meyer, Prakash Saivasan:
Fast Witness Counting. CoRR abs/1807.05777 (2018) - [i15]Roland Meyer, Sebastian Wolff:
Decoupling Lock-Free Data Structures from Memory Reclamation for Static Analysis. CoRR abs/1810.10807 (2018) - 2017
- [j8]Stefan Haar, Roland Meyer:
Message from the Guest Editors. ACM Trans. Embed. Comput. Syst. 16(2): 40:1 (2017) - [c37]Peter Chini, Jonathan Kolberg, Andreas Krebs, Roland Meyer, Prakash Saivasan:
On the Complexity of Bounded Context Switching. ESA 2017: 27:1-27:15 - [c36]Mohamed Faouzi Atig, Roland Meyer, Sebastian Muskalla, Prakash Saivasan:
On the Upward/Downward Closures of Petri Nets. MFCS 2017: 49:1-49:14 - [c35]Matthew Hague, Roland Meyer, Sebastian Muskalla:
Domains for Higher-Order Games. MFCS 2017: 59:1-59:15 - [c34]Egor Derevenetc, Roland Meyer, Sebastian Schweizer:
Locality and Singularity for Store-Atomic Memory Models. NETYS 2017: 133-148 - [c33]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: 169-191 - [c32]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: 299-320 - [e2]Roland Meyer, Uwe Nestmann:
28th International Conference on Concurrency Theory, CONCUR 2017, September 5-8, 2017, Berlin, Germany. LIPIcs 85, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-048-4 [contents] - [i14]Mohamed Faouzi Atig, Roland Meyer, Sebastian Muskalla, Prakash Saivasan:
On the Upward/Downward Closures of Petri Nets. CoRR abs/1701.02927 (2017) - [i13]Roland Meyer, Sebastian Muskalla, Elisabeth Neumann:
Liveness Verification and Synthesis: New Algorithms for Recursive Programs. CoRR abs/1701.02947 (2017) - [i12]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 abs/1702.06704 (2017) - [i11]Egor Derevenetc, Roland Meyer, Sebastian Schweizer:
Locality and Singularity for Store-Atomic Memory Models. CoRR abs/1703.04603 (2017) - [i10]Matthew Hague, Roland Meyer, Sebastian Muskalla:
Domains for Higher-Order Games. CoRR abs/1705.00355 (2017) - [i9]Lukás Holík, Roland Meyer, Tomás Vojnar, Sebastian Wolff:
Effect Summaries for Thread-Modular Analysis. CoRR abs/1705.03701 (2017) - 2016
- [c31]Lukás Holík, Roland Meyer, Sebastian Muskalla:
Summaries for Context-Free Games. FSTTCS 2016: 41:1-41:16 - [c30]Emanuele D'Osualdo, Roland Meyer, Georg Zetzsche:
First-order logic with reachability for infinite-state systems. LICS 2016: 457-466 - [c29]Frédéric Haziza, Lukás Holík, Roland Meyer, Sebastian Wolff:
Pointer Race Freedom. VMCAI 2016: 393-412 - [i8]Lukás Holík, Roland Meyer, Sebastian Muskalla:
Antichains for Inclusion Games. CoRR abs/1603.07256 (2016) - [i7]Roland Meyer, Sebastian Muskalla:
Munchausen Iteration. CoRR abs/1605.00422 (2016) - [i6]Peter Chini, Jonathan Kolberg, Roland Meyer, Prakash Saivasan:
On the Complexity of Bounded Context Switching. CoRR abs/1609.09728 (2016) - 2015
- [j7]Florian Furbach, Roland Meyer, Klaus Schneider, Maximilian Senftleben:
Memory-Model-Aware Testing: A Unified Complexity Analysis. ACM Trans. Embed. Comput. Syst. 14(4): 63:1-63:25 (2015) - [c28]Roland Meyer, Heike Wehrheim:
From Program Verification to Time and Space: The Scientific Life of Ernst-Rüdiger Olderog. Correct System Design 2015: 3-4 - [c27]Ahmed Bouajjani, Georgel Calin, Egor Derevenetc, Roland Meyer:
Lazy TSO Reachability. FASE 2015: 267-282 - [c26]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Roland Meyer, Mehdi Seyed Salehi:
What's Decidable about Availability Languages?. FSTTCS 2015: 192-205 - [c25]Lukás Holík, Roland Meyer:
Antichains for the Verification of Recursive Programs. NETYS 2015: 322-336 - [e1]Roland Meyer, André Platzer, Heike Wehrheim:
Correct System Design - Symposium in Honor of Ernst-Rüdiger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings. Lecture Notes in Computer Science 9360, Springer 2015, ISBN 978-3-319-23505-9 [contents] - [i5]Ahmed Bouajjani, Georgel Calin, Egor Derevenetc, Roland Meyer:
Lazy TSO Reachability. CoRR abs/1501.02683 (2015) - [i4]Frédéric Haziza, Lukás Holík, Roland Meyer, Sebastian Wolff:
Pointer Race Freedom. CoRR abs/1511.00184 (2015) - 2014
- [c24]Florian Furbach, Roland Meyer, Klaus Schneider, Maximilian Senftleben:
Memory Model-Aware Testing - A Unified Complexity Analysis. ACSD 2014: 92-101 - [c23]Reiner Hüchting, Rupak Majumdar, Roland Meyer:
Bounds on Mobility. CONCUR 2014: 357-371 - [c22]Egor Derevenetc, Roland Meyer:
Robustness against Power is PSpace-complete. ICALP (2) 2014: 158-170 - [c21]Ahmed Bouajjani, Egor Derevenetc, Roland Meyer:
Robustness against Relaxed Memory Models. Software Engineering 2014: 85-86 - [i3]Egor Derevenetc, Roland Meyer:
Robustness against Power is PSPACE-complete. CoRR abs/1404.7092 (2014) - 2013
- [j6]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) - [c20]Reiner Hüchting, Rupak Majumdar, Roland Meyer:
A Theory of Name Boundedness. CONCUR 2013: 182-196 - [c19]Ahmed Bouajjani, Egor Derevenetc, Roland Meyer:
Checking and Enforcing Robustness against TSO. ESOP 2013: 533-553 - [c18]Georgel Calin, Egor Derevenetc, Rupak Majumdar, Roland Meyer:
A Theory of Partitioned Global Address Spaces. FSTTCS 2013: 127-139 - [c17]Rupak Majumdar, Roland Meyer, Zilong Wang:
Provenance Verification. RP 2013: 21-22 - [c16]Rupak Majumdar, Roland Meyer, Zilong Wang:
Static Provenance Verification for Message Passing Programs. SAS 2013: 366-387 - [i2]Georgel Calin, Egor Derevenetc, Rupak Majumdar, Roland Meyer:
A Theory of Partitioned Global Address Spaces. CoRR abs/1307.6590 (2013) - 2012
- [j5]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) - [c15]Tim Strazny, Roland Meyer:
An Algorithmic Framework for Coverability in Well-Structured Systems. ACSD 2012: 173-182 - [c14]Roland Meyer, Victor Khomenko, Reiner Hüchting:
A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets. CONCUR 2012: 440-455 - [c13]Zhenyue Long, Georgel Calin, Rupak Majumdar, Roland Meyer:
Language-Theoretic Abstraction Refinement. FASE 2012: 362-376 - [i1]Ahmed Bouajjani, Egor Derevenetc, Roland Meyer:
Robustness Checking against TSO: Attacks and Defence. CoRR abs/1208.6152 (2012) - 2011
- [c12]Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan:
Petri Net Reachability Graphs: Decidability Status of FO Properties. FSTTCS 2011: 140-151 - [c11]Ahmed Bouajjani, Roland Meyer, Eike Möhlmann:
Deciding Robustness against Total Store Ordering. ICALP (2) 2011: 428-440 - 2010
- [c10]Roland Meyer, Tim Strazny:
Petruchio: From Dynamic Networks to Nets. CAV 2010: 175-179 - [c9]Jochen Hoenicke, Roland Meyer, Ernst-Rüdiger Olderog:
Kleene, Rabin, and Scott Are Available. CONCUR 2010: 462-477 - [c8]Peter Habermehl, Roland Meyer, Harro Wimmel:
The Downward-Closure of Petri Net Languages. ICALP (2) 2010: 466-477
2000 – 2009
- 2009
- [b1]Roland Meyer:
Structural stationarity in the π-calculus. University of Oldenburg, Germany, 2009, pp. 1-293 - [j4]Roland Meyer:
A theory of structural stationarity in the pi -Calculus. Acta Informatica 46(2): 87-137 (2009) - [j3]Roland Meyer, Victor Khomenko, Tim Strazny:
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings. Fundam. Informaticae 94(3-4): 439-471 (2009) - [c7]Victor Khomenko, Roland Meyer:
Checking pi-Calculus Structural Congruence is Graph Isomorphism Complete. ACSD 2009: 70-79 - [c6]Roland Meyer, Roberto Gorrieri:
On the Relationship between π-Calculus and Finite Place/Transition Petri Nets. CONCUR 2009: 463-480 - [p1]Roland Meyer:
Strukturelle Stationarität. Ausgezeichnete Informatikdissertationen 2009: 141-150 - 2008
- [j2]Roland Meyer, Johannes Faber, Jochen Hoenicke, Andrey Rybalchenko:
Model checking Duration Calculus: a practical approach. Formal Aspects Comput. 20(4-5): 481-505 (2008) - [c5]Roland Meyer, Victor Khomenko, Tim Strazny:
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings. Petri Nets 2008: 327-347 - [c4]Roland Meyer:
On Boundedness in Depth in the pi-Calculus. IFIP TCS 2008: 477-489 - 2006
- [j1]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:
Trustworthy software systems: a discussion of basic concepts and terminology. ACM SIGSOFT Softw. Eng. Notes 31(6): 1-18 (2006) - [c3]Johannes Faber, Roland Meyer:
Model Checking Data-Dependent Real-Time Properties of the European Train Control System. FMCAD 2006: 76-77 - [c2]Roland Meyer, Johannes Faber, Andrey Rybalchenko:
Model Checking Duration Calculus: A Practical Approach. ICTAC 2006: 332-346 - 2005
- [c1]Christoph Eichner, Hans Fleischhack, Roland Meyer, Ulrik Schrimpf, Christian Stehno:
Compositional Semantics for UML 2.0 Sequence Diagrams Using Petri Nets. SDL Forum 2005: 133-148