Roland Meyer

1.0k total citations
33 papers, 135 citations indexed

About

Roland Meyer is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Roland Meyer has authored 33 papers receiving a total of 135 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Computational Theory and Mathematics, 18 papers in Artificial Intelligence and 8 papers in Computer Networks and Communications. Recurrent topics in Roland Meyer's work include Formal Methods in Verification (17 papers), Distributed systems and fault tolerance (8 papers) and Logic, programming, and type systems (8 papers). Roland Meyer is often cited by papers focused on Formal Methods in Verification (17 papers), Distributed systems and fault tolerance (8 papers) and Logic, programming, and type systems (8 papers). Roland Meyer collaborates with scholars based in Germany, United States and United Kingdom. Roland Meyer's co-authors include Victor Khomenko, Wilhelm Hasselbring, Marko Bošković, Jens Happe, Philippe Darondeau, Stéphane Demri, Steffen Becker, Georg Zetzsche, Heiko Koziolek and Klaus Schneider and has published in prestigious journals such as Lecture notes in computer science, Acta Informatica and ACM Transactions on Embedded Computing Systems.

In The Last Decade

Roland Meyer

30 papers receiving 124 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Roland Meyer Germany	6	63	59	42	36	34	33	135
Yaron Velner Israel	5	39 0.6×	39 0.7×	29 0.7×	11 0.3×	51 1.5×	11	105
Sven Jörges Germany	7	80 1.3×	22 0.4×	24 0.6×	79 2.2×	70 2.1×	14	128
Sascha Klüppelholz Germany	7	105 1.7×	76 1.3×	31 0.7×	60 1.7×	41 1.2×	23	148
Dominique Méry France	7	89 1.4×	68 1.2×	53 1.3×	25 0.7×	27 0.8×	26	139
Robert Brummayer Austria	5	70 1.1×	80 1.4×	23 0.5×	78 2.2×	37 1.1×	7	140
Petr Ročkai Czechia	6	20 0.3×	71 1.2×	27 0.6×	51 1.4×	14 0.4×	15	108
J. P. Queille France	5	54 0.9×	65 1.1×	30 0.7×	51 1.4×	35 1.0×	7	127
James Ivers United States	7	98 1.6×	16 0.3×	49 1.2×	42 1.2×	82 2.4×	24	145
Peter Schachte Australia	8	98 1.6×	54 0.9×	62 1.5×	39 1.1×	42 1.2×	28	156
Kaïs Klai France	8	44 0.7×	70 1.2×	55 1.3×	35 1.0×	60 1.8×	21	142

Countries citing papers authored by Roland Meyer

Since Specialization

Citations

This map shows the geographic impact of Roland Meyer's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Roland Meyer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Roland Meyer more than expected).

Fields of papers citing papers by Roland Meyer

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Roland Meyer. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Roland Meyer. The network helps show where Roland Meyer may publish in the future.

Co-authorship network of co-authors of Roland Meyer

This figure shows the co-authorship network connecting the top 25 collaborators of Roland Meyer. A scholar is included among the top collaborators of Roland Meyer based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Roland Meyer. Roland Meyer is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Meyer, Roland, et al.. (2025). SNIP: Speculative Execution and Non-Interference Preservation for Compiler Transformations. Proceedings of the ACM on Programming Languages. 9(POPL). 1506–1535. 2 indexed citations

Meyer, Roland, et al.. (2023). Embedding Hindsight Reasoning in Separation Logic. Proceedings of the ACM on Programming Languages. 7(PLDI). 1848–1871. 2 indexed citations

Meyer, Roland, et al.. (2022). CAAT: consistency as a theory. Proceedings of the ACM on Programming Languages. 6(OOPSLA2). 114–144. 2 indexed citations

Meyer, Roland, et al.. (2022). CAAT: Consistency as a Theory (Artifact). Zenodo (CERN European Organization for Nuclear Research). 1 indexed citations

Krishna, Shankara Narayanan, et al.. (2022). Parameterized Verification under Release Acquire is PSPACE-complete. Research Repository (Delft University of Technology). 482–492. 1 indexed citations

Meyer, Roland, et al.. (2018). Bounded Context Switching for Valence Systems. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations

Czerwiński, Wojciech, et al.. (2018). Regular Separability of Well-Structured Transition Systems. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations

Heljanko, Keijo, et al.. (2018). BMC with Memory Models as Modules. Työväentutkimus Vuosikirja. 1–9. 3 indexed citations

Meyer, Roland, André Platzer, & Heike Wehrheim. (2015). Correct System Design. Lecture notes in computer science. 2 indexed citations

10.

Bouajjani, Ahmed, et al.. (2015). Robustness against Relaxed Memory Models. Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft). 85–86. 1 indexed citations

11.

Meyer, Roland, et al.. (2015). Memory-Model-Aware Testing. ACM Transactions on Embedded Computing Systems. 14(4). 1–25. 5 indexed citations

12.

Meyer, Roland, et al.. (2014). Memory Model-Aware Testing - A Unified Complexity Analysis. 92–101. 2 indexed citations

13.

Khomenko, Victor, et al.. (2013). A Polynomial Translation of pi-calculus FCPs to Safe Petri Nets. Logical Methods in Computer Science. Volume 9, Issue 3. 2 indexed citations

14.

Darondeau, Philippe, et al.. (2012). Petri Net Reachability Graphs: Decidability Status of First Order Properties. Logical Methods in Computer Science. Volume 8, Issue 4. 5 indexed citations

15.

Meyer, Roland. (2009). A theory of structural stationarity in the π-Calculus. Acta Informatica. 46(2). 87–137. 9 indexed citations

16.

Meyer, Roland, et al.. (2008). Checking pi-Calculus Structural Congruence is Graph Isomorphism Complete. School of Computing Science Technical Report Series. 3 indexed citations

17.

Becker, Steffen, Wilhelm Hasselbring, Marko Bošković, et al.. (2006). Trustworthy software systems. ACM SIGSOFT Software Engineering Notes. 31(6). 1–18. 37 indexed citations

18.

Meyer, Roland, et al.. (2006). Model Checking Data-Dependent Real-Time Properties of the European Train Control System. 76–77. 11 indexed citations

19.

Meyer, Roland, et al.. (2006). Model Checking Duration Calculus: A Practical Approach. Lecture notes in computer science. 20(4-5). 332–346.

20.

Meyer, Roland, et al.. (1959). PERFORMANCE OF TRAILING AERODYNAMIC DECELERATORS AT HIGH DYNAMIC PRESSURES. PART III. WIND TUNNEL TESTING OF RIGID AND FLEXIBLE PARACHUTE MODELS. Defense Technical Information Center (DTIC). 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact