A broadcast-based calculus for communicating systems C Ene, T Muntean Proceedings 15th International Parallel and Distributed Processing Symposium …, 2001 | 111 | 2001 |
Expressiveness of point-to-point versus broadcast communications C Ene, T Muntean Fundamentals of Computation Theory: 12th International Symposium, FCT’99 …, 1999 | 78 | 1999 |
Towards automated proofs for asymmetric encryption schemes in the random oracle model J Courant, M Daubignard, C Ene, P Lafourcade, Y Lakhnech Proceedings of the 15th ACM conference on Computer and Communications …, 2008 | 54 | 2008 |
A symbolic decision procedure for cryptographic protocols with time stamps L Bozga, C Ene, Y Lakhnech The Journal of Logic and Algebraic Programming 65 (1), 1-35, 2005 | 33 | 2005 |
Computationally sound typing for non-interference: The case of deterministic encryption J Courant, C Ene, Y Lakhnech FSTTCS 2007: Foundations of Software Technology and Theoretical Computer …, 2007 | 23 | 2007 |
Some decision problems for parallel communicating grammar systems FL Tiplea, C Ene, CM Ionescu, O Procopiuc Theoretical Computer Science 134 (2), 365-385, 1994 | 18 | 1994 |
On Unique Decomposition of Processes in the Applied π-Calculus. J Dreier, C Ene, P Lafourcade, Y Lakhnech FoSSaCS 7794, 50-64, 2013 | 13 | 2013 |
Automated proofs for asymmetric encryption J Courant, M Daubignard, C Ene, P Lafourcade, Y Lakhnech Journal of Automated Reasoning 46, 261-291, 2011 | 13 | 2011 |
Un Modele formel pour les systemes mobiles a diffusion C Ene Phd thesis, Université de la Méditerranée–Marseille, 2001 | 10 | 2001 |
A coverability structure for parallel communicating grammar systems FL Tiplea, C Ene Elektronische Informationsverarbeitung und Kybernetik 29 (5), 303-315, 1993 | 9 | 1993 |
Testing theories for broadcasting processes C Ene, T Muntean Sci. Ann. Cuza Univ. 11, 214-230, 2002 | 8 | 2002 |
Hierarchies of Petri Net Languages and a Super-Normal Form. FL Tiplea, C Ene Developments in Language Theory, 396-405, 1995 | 8 | 1995 |
Countermeasures optimization in multiple fault-injection context E Boespflug, C Ene, L Mounier, ML Potet 2020 Workshop on Fault Detection and Tolerance in Cryptography (FDTC), 26-34, 2020 | 6 | 2020 |
On the existence of an effective and complete proof system for bounded security protocols L Bozga, C Ene, Y Lakhnech Proceedings of Foundations of Software Science and Computation Structures …, 2004 | 6 | 2004 |
On the existence of an effective and complete inference system for cryptographic protocols L Bozga, C Ene, Y Lakhnech Foundations of Software Science and Computation Structures: 7th …, 2004 | 5 | 2004 |
Formal indistinguishability extended to the random oracle model C Ene, Y Lakhnech, VC Ngo Computer Security–ESORICS 2009: 14th European Symposium on Research in …, 2009 | 4 | 2009 |
On the existence and decidability of unique decompositions of processes in the applied π-calculus J Dreier, C Ene, P Lafourcade, Y Lakhnech Theoretical Computer Science 612, 102-125, 2016 | 3 | 2016 |
BAXMC: a CEGAR approach to Max# SAT T Vigouroux, C Ene, D Monniaux, L Mounier, ML Potet CONFERENCE ON FORMAL METHODS IN COMPUTER-AIDED DESIGN–FMCAD 2022, 170, 2022 | 1 | 2022 |
Output-sensitive Information flow analysis C Ene, L Mounier, ML Potet Logical Methods in Computer Science 17, 2021 | 1 | 2021 |
CIL security proof for a password-based key exchange C Ene, C Gritti, Y Lakhnech Provable Security: 7th International Conference, ProvSec 2013, Melaka …, 2013 | 1 | 2013 |