Follow
Cristian Ene
Cristian Ene
Verimag, University of Grenoble Alpes, France
Verified email at univ-grenoble-alpes.fr
Title
Cited by
Cited by
Year
A broadcast-based calculus for communicating systems
C Ene, T Muntean
Proceedings 15th International Parallel and Distributed Processing Symposium …, 2001
1112001
Expressiveness of point-to-point versus broadcast communications
C Ene, T Muntean
International Symposium on Fundamentals of Computation Theory, 258-268, 1999
861999
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
572008
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
342005
Computationally sound typing for non-interference: The case of deterministic encryption
J Courant, C Ene, Y Lakhnech
International Conference on Foundations of Software Technology and …, 2007
242007
Some decision problems for parallel communicating grammar systems
FL Tiplea, C Ene, CM Ionescu, O Procopiuc
Theoretical Computer Science 134 (2), 365-385, 1994
181994
On Unique Decomposition of Processes in the Applied π-Calculus
J Dreier, C Ene, P Lafourcade, Y Lakhnech
Foundations of Software Science and Computation Structures: 16th …, 2013
142013
Automated proofs for asymmetric encryption
J Courant, M Daubignard, C Ene, P Lafourcade, Y Lakhnech
Journal of Automated Reasoning 46, 261-291, 2011
142011
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
102020
Un Modele formel pour les systemes mobiles a diffusion
C Ene
Phd thesis, Université de la Méditerranée–Marseille, 2001
102001
A coverability structure for parallel communicating grammar systems
FL Tiplea, C Ene
Elektronische Informationsverarbeitung und Kybernetik 29 (5), 303-315, 1993
101993
Hierarchies of Petri Net Languages and a Super-Normal Form.
FL Tiplea, C Ene
Developments in Language Theory, 396-405, 1995
91995
Testing theories for broadcasting processes
C Ene, T Muntean
Sci. Ann. Cuza Univ. 11, 214-230, 2002
72002
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
62004
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
52009
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
52004
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
42016
BaxMC: a CEGAR approach to Max# SAT.
T Vigouroux, C Ene, D Monniaux, L Mounier, ML Potet
FMCAD, 170-178, 2022
32022
Function synthesis for maximizing model counting
T Vigouroux, M Bozga, C Ene, L Mounier
International Conference on Verification, Model Checking, and Abstract …, 2023
22023
Output-sensitive Information flow analysis
C Ene, L Mounier, ML Potet
Logical Methods in Computer Science 17, 2021
12021
The system can't perform the operation now. Try again later.
Articles 1–20