| Checking and enforcing robustness against TSO A Bouajjani, E Derevenetc, R Meyer European Symposium on Programming, 533-553, 2013 | 107 | 2013 |
| 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 | 107 | 2005 |
| Model checking duration calculus: A practical approach R Meyer, J Faber, J Hoenicke, A Rybalchenko Formal Aspects of Computing 20 (4), 481-505, 2008 | 72 | 2008 |
| On boundedness in depth in the π-calculus R Meyer Fifth Ifip International Conference On Theoretical Computer Science–Tcs 2008 …, 2008 | 69 | 2008 |
| 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 | 68 | 2006 |
| Deciding robustness against total store ordering A Bouajjani, R Meyer, E Möhlmann International Colloquium on Automata, Languages, and Programming, 428-440, 2011 | 55 | 2011 |
| A theory of structural stationarity in the π-calculus R Meyer Acta Informatica 46 (2), 87-137, 2009 | 41 | 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 | 39 | 2006 |
| The downward-closure of Petri net languages P Habermehl, R Meyer, H Wimmel International Colloquium on Automata, Languages, and Programming, 466-477, 2010 | 38 | 2010 |
| Language-theoretic abstraction refinement Z Long, G Calin, R Majumdar, R Meyer International Conference on Fundamental Approaches to Software Engineering …, 2012 | 32 | 2012 |
| On the relationship between π-calculus and finite place/transition Petri nets R Meyer, R Gorrieri International Conference on Concurrency Theory, 463-480, 2009 | 31 | 2009 |
| Robustness against Power is PSpace-complete E Derevenetc, R Meyer International Colloquium on Automata, Languages, and Programming, 158-170, 2014 | 29 | 2014 |
| Structural stationarity in the π-calculus. R Meyer Univ., Fak. II, Department für Informatik, 2009 | 29 | 2009 |
| Petruchio: From dynamic networks to nets R Meyer, T Strazny International Conference on Computer Aided Verification, 175-179, 2010 | 23 | 2010 |
| 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 | 22 | 2015 |
| Lazy TSO reachability A Bouajjani, G Calin, E Derevenetc, R Meyer International Conference on Fundamental Approaches to Software Engineering …, 2015 | 20 | 2015 |
| Kleene, Rabin, and Scott are available J Hoenicke, R Meyer, ER Olderog International Conference on Concurrency Theory, 462-477, 2010 | 19 | 2010 |
| Checking pi-calculus structural congruence is graph isomorphism complete V Khomenko, R Meyer 2009 Ninth International Conference on Application of Concurrency to System …, 2009 | 19 | 2009 |
| A practical approach to verification of mobile systems using net unfoldings R Meyer, V Khomenko, T Strazny Fundamenta Informaticae 94 (3-4), 439-471, 2009 | 17 | 2009 |
| 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 | 15 | 2019 |
Ahmed BouajjaniProfessor Computer Science, University of ParisVerified email at irif.fr
