| Automated verification of equivalence properties of cryptographic protocols R Chadha, V Cheval, Ş Ciobâcă, S Kremer ACM Transactions on Computational Logic (TOCL) 17 (4), 23, 2016 | 137 | 2016 |
| Automated Verification of Equivalence Properties of Cryptographic Protocols. R Chadha, S Ciobâca, S Kremer ESOP 7211, 108-127, 2012 | 137* | 2012 |
| One-path reachability logic G Rosu, A Stefanescu, S Ciobâca, BM Moore 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 358-367, 2013 | 76 | 2013 |
| Computing knowledge in security protocols under convergent equational theories Ş Ciobâcă, S Delaune, S Kremer Journal of Automated Reasoning 48 (2), 219-262, 2012 | 69 | 2012 |
| Computing knowledge in security protocols under convergent equational theories Ş Ciobâcă, S Delaune, S Kremer International Conference on Automated Deduction, 355-370, 2009 | 69 | 2009 |
| Protocol composition for arbitrary primitives S Ciobâca, V Cortier 2010 23rd IEEE Computer Security Foundations Symposium, 322-336, 2010 | 66 | 2010 |
| All-path reachability logic A Ştefănescu, Ş Ciobâcă, R Mereuta, BM Moore, TF Şerbănută, G Roşu Rewriting and Typed Lambda Calculi, 425-440, 2014 | 63 | 2014 |
| A language-independent proof system for full program equivalence S Ciobaca, D Lucanu, V Rusu, G Rosu Formal Aspects of Computing 28 (3), 469, 2016 | 17 | 2016 |
| A language-independent proof system for mutual program equivalence Ş Ciobâcă, D Lucanu, V Rusu, G Roşu International Conference on Formal Engineering Methods, 75-90, 2014 | 17 | 2014 |
| Automated Verification of Security Protocols with Applications to Electronic Voting Ş Ciobâcă Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, 2011 | 15* | 2011 |
| A coinductive approach to proving reachability properties in logically constrained term rewriting systems Ş Ciobâcă, D Lucanu International Joint Conference on Automated Reasoning, 295-311, 2018 | 13 | 2018 |
| Reducing partial equivalence to partial correctness S Ciobâca 2014 16th International Symposium on Symbolic and Numeric Algorithms for …, 2014 | 11 | 2014 |
| From small-step semantics to big-step semantics, automatically Ş Ciobâcă International Conference on Integrated Formal Methods, 347-361, 2013 | 9 | 2013 |
| A comparison of open-source static analysis tools for vulnerability detection in c/c++ code A Arusoaie, S Ciobâca, V Craciun, D Gavrilut, D Lucanu 2017 19th International Symposium on Symbolic and Numeric Algorithms for …, 2017 | 6 | 2017 |
| Trace-Relating Compiler Correctness and Secure Compilation C Abate, R Blanco, Ș Ciobâcă, A Durier, D Garg, C Hrițcu, M Patrignani, ... European Symposium on Programming, 1-28, 2020 | 5 | 2020 |
| All-Path Reachability Logic A Stefanescu, S Ciobâca, R Mereuta, B Moore, TF Serbanuta, G Rosu arXiv preprint arXiv:1810.10826, 2018 | 5 | 2018 |
| A theoretical foundation for programming languages aggregation Ş Ciobâcă, D Lucanu, V Rusu, G Roşu International Workshop on Algebraic Development Techniques, 30-47, 2015 | 5 | 2015 |
| Unification modulo builtins Ş Ciobâcă, A Arusoaie, D Lucanu International Workshop on Logic, Language, Information, and Computation, 179-195, 2018 | 4 | 2018 |
| Computing finite variants for subterm convergent rewrite systems⋆ S Ciobâca UNIF 2011, 28, 2011 | 4 | 2011 |
| Compartmented Threshold RSA Based on the Chinese Remainder Theorem. S Iftene, S Ciobâca, M Grindei IACR Cryptol. ePrint Arch. 2008, 370, 2008 | 4 | 2008 |
Grigore RosuUniversity of Illinois at Urbana ChampaignVerifierad e-postadress på illinois.edu
