Roland Meyer
Roland Meyer
Professor of Theoretical Computer Science
Verified email at - Homepage
Cited by
Cited by
Checking and enforcing robustness against TSO
A Bouajjani, E Derevenetc, R Meyer
Programming Languages and Systems: 22nd European Symposium on Programming …, 2013
Compositional semantics for UML 2.0 sequence diagrams using Petri Nets
C Eichner, H Fleischhack, R Meyer, U Schrimpf, C Stehno
SDL 2005: Model Driven: 12th International SDL Forum, Grimstad, Norway, June …, 2005
Trustworthy software systems: a discussion of basic concepts and terminology
S Becker, W Hasselbring, A Paul, M Boskovic, H Koziolek, J Ploski, ...
ACM SIGSOFT Software Engineering Notes 31 (6), 1-18, 2006
Model checking duration calculus: A practical approach
R Meyer, J Faber, J Hoenicke, A Rybalchenko
Formal Aspects of Computing 20 (4), 481-505, 2008
On boundedness in depth in the π-calculus
R Meyer
Fifth Ifip International Conference On Theoretical Computer Science–Tcs 2008 …, 2008
Deciding robustness against total store ordering
A Bouajjani, R Meyer, E Möhlmann
International Colloquium on Automata, Languages, and Programming, 428-440, 2011
BMC for weak memory models: Relation analysis for compact SMT encodings
N Gavrilenko, H Ponce-de-León, F Furbach, K Heljanko, R Meyer
Computer Aided Verification: 31st International Conference, CAV 2019, New …, 2019
The downward-closure of Petri net languages
P Habermehl, R Meyer, H Wimmel
International Colloquium on Automata, Languages, and Programming, 466-477, 2010
A theory of structural stationarity in the π-calculus
R Meyer
Acta Informatica 46 (2), 87-137, 2009
Model checking data-dependent real-time properties of the European Train Control System
J Faber, R Meyer
2006 Formal Methods in Computer Aided Design, 76-77, 2006
Language-theoretic abstraction refinement
Z Long, G Calin, R Majumdar, R Meyer
International Conference on Fundamental Approaches to Software Engineering …, 2012
Robustness against Power is PSpace-complete
E Derevenetc, R Meyer
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
Memory-model-aware testing: A unified complexity analysis
F Furbach, R Meyer, K Schneider, M Senftleben
ACM Transactions on Embedded Computing Systems (TECS) 14 (4), 1-25, 2015
On the Relationship between π-Calculus and Finite Place/Transition Petri Nets
R Meyer, R Gorrieri
International Conference on Concurrency Theory, 463-480, 2009
Petruchio: From dynamic networks to nets
R Meyer, T Strazny
Computer Aided Verification: 22nd International Conference, CAV 2010 …, 2010
Structural stationarity in the π-calculus.
R Meyer
Univ., Fak. II, Department für Informatik, 2009
Regular separability of well structured transition systems
W Czerwiński, S Lasota, R Meyer, S Muskalla, KN Kumar, P Saivasan
arXiv preprint arXiv:1702.05334, 2017
Lazy TSO reachability
A Bouajjani, G Calin, E Derevenetc, R Meyer
Fundamental Approaches to Software Engineering: 18th International …, 2015
A theory of partitioned global address spaces
G Calin, E Derevenetc, R Majumdar, R Meyer
arXiv preprint arXiv:1307.6590, 2013
Checking pi-calculus structural congruence is graph isomorphism complete
V Khomenko, R Meyer
2009 Ninth International Conference on Application of Concurrency to System …, 2009
The system can't perform the operation now. Try again later.
Articles 1–20