Cristian Ene

Orcid: 0000-0001-6322-0383

According to our database1, Cristian Ene authored at least 25 papers between 1993 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Function Synthesis for Maximizing Model Counting.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2024

2023
[artifact50] Function synthesis for maximising model counting.
Dataset, September, 2023

[artifact50] Function synthesis for maximising model counting.
Dataset, September, 2023

2022
BaxMC: a CEGAR approach to Max#SAT.
Proceedings of the 22nd Formal Methods in Computer-Aided Design, 2022

2021
Output-sensitive Information flow analysis.
Log. Methods Comput. Sci., 2021

2020
Countermeasures Optimization in Multiple Fault-Injection Context.
Proceedings of the 17th Workshop on Fault Detection and Tolerance in Cryptography, 2020

2016
On the existence and decidability of unique decompositions of processes in the applied π-calculus.
Theor. Comput. Sci., 2016

2013
CIL Security Proof for a Password-Based Key Exchange.
Proceedings of the Provable Security - 7th International Conference, 2013

On Unique Decomposition of Processes in the Applied π-Calculus.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

2011
Automated Proofs for Asymmetric Encryption.
J. Autom. Reason., 2011

2009
Gentzen-Prawitz Natural Deduction as a Teaching Tool
CoRR, 2009

Formal Indistinguishability Extended to the Random Oracle Model.
Proceedings of the Computer Security, 2009

2008
Towards automated proofs for asymmetric encryption schemes in the random oracle model.
Proceedings of the 2008 ACM Conference on Computer and Communications Security, 2008

2007
Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2005
A symbolic decision procedure for cryptographic protocols with time stamps.
J. Log. Algebraic Methods Program., 2005

Automatic Verification of Security Properties Based on Abstractions.
Proceedings of the Verification of Infinite-State Systems with Applications to Security, 2005

2004
On the Existence of an Effective and Complete Inference System for Cryptographic Protocols.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

A Symbolic Decision Procedure for Cryptographic Protocols with Time Stamps (Extended Abstract).
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2002
Testing Theories for Broadcasting Processes.
Sci. Ann. Cuza Univ., 2002

2001
A Broadcast-based Calculus for Communicating Systems.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

1999
Expressiveness of Point-to-Point versus Broadcast Communications.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998
On Complexity of Reachability of Transition Restricted Petri Nets.
Sci. Ann. Cuza Univ., 1998

1997
Hierarchies of Petri Net Languages and a Super-Normal Form.
J. Autom. Lang. Comb., 1997

1994
Some Decision Problems for Parallel Communicating Grammar Systems.
Theor. Comput. Sci., 1994

1993
A Coverability Structure for Parallel Communicating Grammar Systems.
J. Inf. Process. Cybern., 1993


  Loading...