Automated Proofs for Asymmetric Encryption.
J. Courant, M. Daubignard, C. Ene, P. Lafourcade, Y. Lakhnech.
Journal of Automated Reasoning 46(3-4): 261-291, 2011.
Automated Proofs for Asymmetric Encryption.
J. Courant, M. Daubignard, C. Ene, P. Lafourcade, Y. Lakhnech.
Concurrency, Compositionality, and Correctness p. 300-321, 2010.
A
symbolic
decision procedure for
cryptographic protocols with time stamps.
L. Bozga, C.
Ene, Y.
Lakhnech.
Journal of
Logic and Algebraic
Programming , Volume 65, Issue 1, p.
1-35, 2005.
Testing Theories for
Broadcasting
Processes.
C. Ene, T. Muntean.
Scientific Annals of
the A.I.Cuza University of
Iasi, Computer Science Section, vol.XI, p. 214-230, 2002.
On Complexity of
Reachability of Transition Restricted Petri Nets.
C. Ene.
Scientific Annals of
the A.I.Cuza University of
Iasi, Computer Science Section, vol.VII, 1998.
Hierarchies
of Petri Net Languages and a Super-Normal Form.
F. L. Tiplea, C. Ene.
Journal
of Automata,
Languages and
Combinatorics, Volume 2, No. 3, p. 187-208, 1997.
Some decision problems for
parallel communicating
grammar systems.
F. L. Tiplea, C. Ene, C. M.
Ionescu, O.
Procopiuc.
Theoretical Computer
Science, 134(2), p. 365-385, 21
November 1994.
A
coverability structure for parallel communicating grammar systems.
F. L.
Tiplea, C. Ene.
Journal of
Information
Processing and
Cybernetics EIK 29, no. 5, p. 303-315, , 1993.
An
accessability
problem in
monotonic grammars (in romanian).
C. Ene.
Studii si
Cercetari Matematice, 1993.
Automatic
Verification of Security Properties based on Abstractions.
L.
Bozga, C.
Ene, R. Janvier, Y. Lakhnech, L. Mazare, M. Perin.
In
Proceedings of Verification of Infinite-State Systems with
Applications to Security, (Vissas '05), 2005.
A
symbolic
decision procedure for
cryptographic protocols with time stamps.
L. Bozga, C.
Ene, Y. Lakhnech.
In
proceedings of CONCUR'04, Lecture Notes in Computer
Science 3170, p. 177-192,
Springer-Verlag, 2004.
On
the
existence of an effective and complete inference system for
cryptographic protocols.
L. Bozga, C. Ene, Y. Lakhnech.
In proceedings of FOSSACS'04, Lecture
Notes in Computer
Science 2987,
p. 42-57, Springer-Verlag, 2004.
Testing Theories
for Broadcasting
Processes.
C. Ene, T. Muntean.
International
Symposium on Parallel and Distributed Computing, 2002.
A
Broadcast-based Calculus for Communicating Systems.
C.
Ene, T. Muntean.
(extended
abstract in
FMPPTA'01), 2001.
Expressiveness
of Point-to-Point versus Broadcast Communications.
C.
Ene, T. Muntean.
In Fundamentals of
Computation
Theory, 12th
International Symposium FCT'99, Lecture Notes in Computer Science 1684,
Springer-Verlag, 1999.
Hierarchies
of
Petri net languages and a super-normal form.
F.L.
Tiplea, C. Ene.
In:
Proceedings
of the 2nd International Conference ``Developments in
Language Theory'', World
Scientific, pages 396-408. 1995.
On
the Power and Complexity of PCGS.
F. L. Tiplea, O.
Procopiuc, C. M.
Procopiuc,
C.
Ene.
Artificial
Life:
Grammatical Models, Black Sea
University Press, Bucharest, 1995.