Roland Meyer
Roland Meyer
Professor of Theoretical Computer Science
Verified email at tu-bs.de - Homepage
Title
Cited by
Cited by
Year
Checking and enforcing robustness against TSO
A Bouajjani, E Derevenetc, R Meyer
European Symposium on Programming, 533-553, 2013
1112013
Compositional semantics for UML 2.0 sequence diagrams using Petri Nets
C Eichner, H Fleischhack, R Meyer, U Schrimpf, C Stehno
International SDL Forum, 133-148, 2005
1072005
Model checking duration calculus: A practical approach
R Meyer, J Faber, J Hoenicke, A Rybalchenko
Formal Aspects of Computing 20 (4), 481-505, 2008
742008
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
712006
On boundedness in depth in the π-calculus
R Meyer
Fifth Ifip International Conference On Theoretical Computer Science–Tcs 2008 …, 2008
702008
Deciding robustness against total store ordering
A Bouajjani, R Meyer, E Möhlmann
International Colloquium on Automata, Languages, and Programming, 428-440, 2011
592011
A theory of structural stationarity in the π-calculus
R Meyer
Acta Informatica 46 (2), 87-137, 2009
422009
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
392006
The downward-closure of Petri net languages
P Habermehl, R Meyer, H Wimmel
International Colloquium on Automata, Languages, and Programming, 466-477, 2010
382010
Language-theoretic abstraction refinement
Z Long, G Calin, R Majumdar, R Meyer
International Conference on Fundamental Approaches to Software Engineering …, 2012
342012
On the relationship between π-calculus and finite place/transition Petri nets
R Meyer, R Gorrieri
International Conference on Concurrency Theory, 463-480, 2009
322009
Robustness against Power is PSpace-complete
E Derevenetc, R Meyer
International Colloquium on Automata, Languages, and Programming, 158-170, 2014
312014
Structural stationarity in the π-calculus.
R Meyer
Univ., Fak. II, Department für Informatik, 2009
292009
Petruchio: From dynamic networks to nets
R Meyer, T Strazny
International Conference on Computer Aided Verification, 175-179, 2010
252010
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
242015
Lazy TSO reachability
A Bouajjani, G Calin, E Derevenetc, R Meyer
International Conference on Fundamental Approaches to Software Engineering …, 2015
222015
BMC for weak memory models: Relation analysis for compact SMT encodings
N Gavrilenko, H Ponce-de-León, F Furbach, K Heljanko, R Meyer
International Conference on Computer Aided Verification, 355-365, 2019
212019
A theory of partitioned global address spaces
G Calin, E Derevenetc, R Majumdar, R Meyer
arXiv preprint arXiv:1307.6590, 2013
202013
Checking pi-calculus structural congruence is graph isomorphism complete
V Khomenko, R Meyer
2009 Ninth International Conference on Application of Concurrency to System …, 2009
192009
Kleene, Rabin, and Scott are available
J Hoenicke, R Meyer, ER Olderog
International Conference on Concurrency Theory, 462-477, 2010
182010
The system can't perform the operation now. Try again later.
Articles 1–20