default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCristian Ene
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c16]Thomas Vigouroux
, Marius Bozga, Cristian Ene, Laurent Mounier:
Function Synthesis for Maximizing Model Counting. VMCAI (1) 2024: 258-279- 2023
- [d2]Thomas Vigouroux, Marius Bozga, Cristian Ene, Laurent Mounier:
[artifact50] Function synthesis for maximising model counting. Zenodo, 2023
- [d1]Thomas Vigouroux, Marius Bozga, Cristian Ene, Laurent Mounier:
[artifact50] Function synthesis for maximising model counting. Zenodo, 2023 - [i4]Thomas Vigouroux, Marius Bozga, Cristian Ene, Laurent Mounier:
Function synthesis for maximizing model counting. CoRR abs/2305.10003 (2023) - 2022
- [c15]Thomas Vigouroux, Cristian Ene, David Monniaux, Laurent Mounier, Marie-Laure Potet:
BaxMC: a CEGAR approach to Max#SAT. FMCAD 2022: 170-178 - [i3]Thomas Vigouroux, Cristian Ene, David Monniaux, Laurent Mounier, Marie-Laure Potet:
BAXMC: a CEGAR approach to Max\#SAT. CoRR abs/2211.00973 (2022) - 2021
- [j9]Cristian Ene, Laurent Mounier, Marie-Laure Potet:
Output-sensitive Information flow analysis. Log. Methods Comput. Sci. 17(1) (2021) - 2020
- [c14]Etienne Boespflug, Cristian Ene, Laurent Mounier, Marie-Laure Potet:
Countermeasures Optimization in Multiple Fault-Injection Context. FDTC 2020: 26-34
2010 – 2019
- 2019
- [c13]Cristian Ene, Laurent Mounier, Marie-Laure Potet:
Output-Sensitive Information Flow Analysis. FORTE 2019: 93-110 - [i2]Cristian Ene, Laurent Mounier, Marie-Laure Potet:
Output-sensitive Information flow analysis. CoRR abs/1909.09567 (2019) - 2016
- [j8]Jannik Dreier, Cristian Ene, Pascal Lafourcade, Yassine Lakhnech:
On the existence and decidability of unique decompositions of processes in the applied π-calculus. Theor. Comput. Sci. 612: 102-125 (2016) - 2013
- [c12]Jannik Dreier, Cristian Ene, Pascal Lafourcade, Yassine Lakhnech:
On Unique Decomposition of Processes in the Applied π-Calculus. FoSSaCS 2013: 50-64 - [c11]Cristian Ene, Clémentine Gritti, Yassine Lakhnech:
CIL Security Proof for a Password-Based Key Exchange. ProvSec 2013: 59-85 - 2011
- [j7]Judicaël Courant, Marion Daubignard, Cristian Ene, Pascal Lafourcade, Yassine Lakhnech:
Automated Proofs for Asymmetric Encryption. J. Autom. Reason. 46(3-4): 261-291 (2011) - 2010
- [c10]Judicaël Courant, Marion Daubignard, Cristian Ene, Pascal Lafourcade, Yassine Lakhnech:
Automated Proofs for Asymmetric Encryption. Concurrency, Compositionality, and Correctness 2010: 300-321
2000 – 2009
- 2009
- [c9]Cristian Ene, Yassine Lakhnech, Van Chan Ngo:
Formal Indistinguishability Extended to the Random Oracle Model. ESORICS 2009: 555-570 - [i1]Jean-François Monin, Cristian Ene, Michaël Périn:
Gentzen-Prawitz Natural Deduction as a Teaching Tool. CoRR abs/0907.3599 (2009) - 2008
- [c8]Judicaël Courant, Marion Daubignard, Cristian Ene, Pascal Lafourcade, Yassine Lakhnech:
Towards automated proofs for asymmetric encryption schemes in the random oracle model. CCS 2008: 371-380 - 2007
- [c7]Judicaël Courant, Cristian Ene, Yassine Lakhnech:
Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption. FSTTCS 2007: 364-375 - 2005
- [j6]Liana Bozga, Cristian Ene, Yassine Lakhnech:
A symbolic decision procedure for cryptographic protocols with time stamps. J. Log. Algebraic Methods Program. 65(1): 1-35 (2005) - [c6]Liana Bozga, Cristian Ene, Romain Janvier, Yassine Lakhnech, Laurent Mazaré, Michaël Périn:
Automatic Verification of Security Properties Based on Abstractions. VISSAS 2005: 23-53 - 2004
- [c5]Liana Bozga, Cristian Ene, Yassine Lakhnech:
A Symbolic Decision Procedure for Cryptographic Protocols with Time Stamps (Extended Abstract). CONCUR 2004: 177-192 - [c4]Liana Bozga, Cristian Ene, Yassine Lakhnech:
On the Existence of an Effective and Complete Inference System for Cryptographic Protocols. FoSSaCS 2004: 42-57 - 2002
- [j5]Cristian Ene, Traian Muntean:
Testing Theories for Broadcasting Processes. Sci. Ann. Cuza Univ. 11: 214-230 (2002) - 2001
- [c3]Cristian Ene, Traian Muntean:
A Broadcast-based Calculus for Communicating Systems. IPDPS 2001: 149
1990 – 1999
- 1999
- [c2]Cristian Ene, Traian Muntean:
Expressiveness of Point-to-Point versus Broadcast Communications. FCT 1999: 258-268 - 1998
- [j4]Cristian Ene:
On Complexity of Reachability of Transition Restricted Petri Nets. Sci. Ann. Cuza Univ. 7: 103-106 (1998) - 1997
- [j3]Ferucio Laurentiu Tiplea, Cristian Ene:
Hierarchies of Petri Net Languages and a Super-Normal Form. J. Autom. Lang. Comb. 2(3): 187-204 (1997) - 1995
- [c1]Ferucio Laurentiu Tiplea, Cristian Ene:
Hierarchies of Petri Net Languages and a Super-Normal Form. Developments in Language Theory 1995: 396-405 - 1994
- [j2]Ferucio Laurentiu Tiplea, Cristian Ene, Cecilia Magdalena Ionescu, Octavian Procopiuc:
Some Decision Problems for Parallel Communicating Grammar Systems. Theor. Comput. Sci. 134(2): 365-385 (1994) - 1993
- [j1]Ferucio Laurentiu Tiplea, Cristian Ene:
A Coverability Structure for Parallel Communicating Grammar Systems. J. Inf. Process. Cybern. 29(5): 303-315 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-22 20:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
