| 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 | 199 | 2016 |
| Automated Verification of Equivalence Properties of Cryptographic Protocols. R Chadha, S Ciobâca, S Kremer ESOP 7211, 108-127, 2012 | 199* | 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 | 93 | 2013 |
| All-path reachability logic A Ştefănescu, Ş Ciobâcă, R Mereuta, BM Moore, TF Şerbănută, G Roşu International Conference on Rewriting Techniques and Applications, 425-440, 2014 | 84 | 2014 |
| Computing knowledge in security protocols under convergent equational theories Ş Ciobâcă, S Delaune, S Kremer Journal of Automated Reasoning 48 (2), 219-262, 2012 | 78 | 2012 |
| Computing knowledge in security protocols under convergent equational theories Ş Ciobâcă, S Delaune, S Kremer International Conference on Automated Deduction, 355-370, 2009 | 78 | 2009 |
| Protocol composition for arbitrary primitives S Ciobâca, V Cortier 2010 23rd IEEE Computer Security Foundations Symposium, 322-336, 2010 | 75 | 2010 |
| 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 | 66 | 2017 |
| 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 | 45 | 2016 |
| A coinductive approach to proving reachability properties in logically constrained term rewriting systems Ş Ciobâcă, D Lucanu Automated Reasoning: 9th International Joint Conference, IJCAR 2018, Held as …, 2018 | 33 | 2018 |
| Trace-relating compiler correctness and secure compilation C Abate, R Blanco, Ș Ciobâcă, A Durier, D Garg, C Hrițcu, M Patrignani, ... Programming Languages and Systems: 29th European Symposium on Programming …, 2020 | 22 | 2020 |
| From small-step semantics to big-step semantics, automatically Ş Ciobâcă International Conference on Integrated Formal Methods, 347-361, 2013 | 19 | 2013 |
| Automated Verification of Security Protocols with Applications to Electronic Voting S Ciobâca These de doctorat, Laboratoire Spécification et Vérification. ENS Cachan …, 2011 | 19* | 2011 |
| An extended account of trace-relating compiler correctness and secure compilation C Abate, R Blanco, Ş Ciobâcă, A Durier, D Garg, C Hriţcu, M Patrignani, ... ACM Transactions on Programming Languages and Systems (TOPLAS) 43 (4), 1-48, 2021 | 18 | 2021 |
| All-path reachability logic A Stefanescu, S Ciobâca, R Mereuta, B Moore, TF Serbanuta, G Rosu Logical Methods in Computer Science 15, 2019 | 15 | 2019 |
| Reducing partial equivalence to partial correctness S Ciobâca 2014 16th International Symposium on Symbolic and Numeric Algorithms for …, 2014 | 12 | 2014 |
| Verifying the DPLL algorithm in Dafny CC Andrici, Ş Ciobâcă arXiv preprint arXiv:1909.01743, 2019 | 7 | 2019 |
| Operationally-based program equivalence proofs using LCTRSs Ş Ciobâcă, D Lucanu, AS Buruiană Journal of Logical and Algebraic Methods in Programming 135, 100894, 2023 | 6 | 2023 |
| Unification modulo builtins Ş Ciobâcă, A Arusoaie, D Lucanu Logic, Language, Information, and Computation: 25th International Workshop …, 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 |
Grigore RosuUniversity of Illinois at Urbana ChampaignVerified email at illinois.edu
