All-path reachability logic A Ştefănescu, Ş Ciobācă, R Mereuta, BM Moore, TF Şerbănută, G Roşu Rewriting and Typed Lambda Calculi: Joint International Conference, RTA-TLCA …, 2014 | 77 | 2014 |
Executing Formal Semantics with the Tool D Lazar, A Arusoaie, TF Şerbǎnuţǎ, C Ellison, R Mereuta, D Lucanu, ... FM 2012: Formal Methods: 18th International Symposium, Paris, France, August …, 2012 | 16 | 2012 |
All-path reachability logic A Stefanescu, S Ciobāca, R Mereuta, B Moore, TF Serbanuta, G Rosu arXiv preprint arXiv:1810.10826, 2018 | 10 | 2018 |
Extending the Service Composition Formalism with Relational Parameters P Diac, L Tucar, R Mereuta arXiv preprint arXiv:1909.04393, 2019 | | 2019 |
All-Path Reachability Logic G Rosu, TF Serbanuta, B Moore, R Mereuta, S Ciobaca, A Stefanescu Logical Methods in Computer Science 15, 2019 | | 2019 |
Parsing K definitions R Mereuţă, G Grigoraş Electronic Notes in Theoretical Computer Science 304, 151-166, 2014 | | 2014 |
Parsing in K framework R Mereuta | | 2011 |