Stefan Ciobaca
Stefan Ciobaca
Verifierad e-postadress på info.uaic.ro - Startsida
Titel
Citeras av
Citeras av
År
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
1372016
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
762013
Computing knowledge in security protocols under convergent equational theories
Ş Ciobâcă, S Delaune, S Kremer
Journal of Automated Reasoning 48 (2), 219-262, 2012
692012
Computing knowledge in security protocols under convergent equational theories
Ş Ciobâcă, S Delaune, S Kremer
International Conference on Automated Deduction, 355-370, 2009
692009
Protocol composition for arbitrary primitives
S Ciobâca, V Cortier
2010 23rd IEEE Computer Security Foundations Symposium, 322-336, 2010
662010
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
632014
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
172016
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
172014
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
132018
Reducing partial equivalence to partial correctness
S Ciobâca
2014 16th International Symposium on Symbolic and Numeric Algorithms for …, 2014
112014
From small-step semantics to big-step semantics, automatically
Ş Ciobâcă
International Conference on Integrated Formal Methods, 347-361, 2013
92013
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
62017
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
52020
All-Path Reachability Logic
A Stefanescu, S Ciobâca, R Mereuta, B Moore, TF Serbanuta, G Rosu
arXiv preprint arXiv:1810.10826, 2018
52018
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
52015
Unification modulo builtins
Ş Ciobâcă, A Arusoaie, D Lucanu
International Workshop on Logic, Language, Information, and Computation, 179-195, 2018
42018
Computing finite variants for subterm convergent rewrite systems⋆
S Ciobâca
UNIF 2011, 28, 2011
42011
Compartmented Threshold RSA Based on the Chinese Remainder Theorem.
S Iftene, S Ciobâca, M Grindei
IACR Cryptol. ePrint Arch. 2008, 370, 2008
42008
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20