Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Hubert Comon-Lundh"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 4, Issue 2 (2008)
Tree automata with one memory have been introduced in 2001. They generalize both pushdown (word) automata and the tree automata with constraints of equality between brothers of Bogaert and Tison. Though it has a decidable emptiness problem, the main
Externí odkaz:
https://doaj.org/article/0b4168f2e8464adc8a998c74e0ed08c2
Autor:
Olivier Coutard, Pierre-Olivier Amblard, Claude Amra, Brigitte Bacroix, Pascal Barone, Yannick Barthe, Isabelle Berbezier, Monique Bernard, Marc Billaud, Gudrun Bornette, Didier Bresch, Philippe Cardin, Philippe Claudin, Hubert Comon-Lundh, Didier Demazière, Claude Diebolt, Philippe Faure, Yves Gaudin, Julie Gavard, Raphael Granier De Cassagnac, Anne-Marie Haghiri-Gosnet, Philippe Hapiot, Nabil Hathout, Philippe Hoffmann, Peter Holdsworth, Laurent Kodjabachian, Catherine Leblanc, Francois Lott, Nathalie Luca, Emmanuel Magnier, Antoine Maignan, Eric Marechal, Françoise Massines, Benoit Mosser, Francois Ozanam, Dimitri Peaucelle, Franck Picard, Laurence Pruvost, Laure Quennouëlle-Corre, Hugues Roest Crollius, Jay Rowell, Véronique Schmitt, Laurent Schneider, Isabelle Théry-Parisot, François Trottein, Boris Vauzeilles, Fabrice Vavre
Publikováno v:
HAL
Conférence des Présidents du Comité National
Conférence des Présidents du Comité National, CNRS, 2021, Paris, France
Conférence des Présidents du Comité National
Conférence des Présidents du Comité National, CNRS, 2021, Paris, France
National audience; Le présent bilan de mandature 2016-2021 de la CPCN (Conférence des présidentes et présidents de sections et de commissions interdisciplinaires du Comité national de la recherche scientifique) a une triple finalité. Il constit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::36dedcc2e9dfaa60dfc89f7f462858a6
https://hal.laas.fr/hal-03413289/document
https://hal.laas.fr/hal-03413289/document
Publikováno v:
Information and Computation
Information and Computation, 2017, 255, pp.94-125. ⟨10.1016/j.ic.2017.05.004⟩
Information and Computation, Elsevier, 2017, 255, pp.94-125. ⟨10.1016/j.ic.2017.05.004⟩
Information and Computation, 2017, 255, pp.94-125. ⟨10.1016/j.ic.2017.05.004⟩
Information and Computation, Elsevier, 2017, 255, pp.94-125. ⟨10.1016/j.ic.2017.05.004⟩
We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-type properties, like anonymity, vote-privacy, and unlinkability. Infin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1959b8dcc11b54878e5583e4d66896ec
https://inria.hal.science/hal-01584242
https://inria.hal.science/hal-01584242
Publikováno v:
Information and Computation. 238:106-127
Deducibility constraints represent in a symbolic way the infinite set of possible executions of a finite protocol. Solving a deducibility constraint amounts to finding all possible ways of filling the gaps in a proof. For finite local inference syste
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::34f93244f4b88cbf6842dc95941cb45a
https://doi.org/10.1016/j.ic.2014.07.006
https://doi.org/10.1016/j.ic.2014.07.006
Publikováno v:
JSIAM Letters. 1:28-31
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a1e6f18673d9d388e28141069a76506
https://doi.org/10.14495/jsiaml.1.28
https://doi.org/10.14495/jsiaml.1.28
Autor:
Gergei Bana, Hubert Comon-Lundh
Publikováno v:
2014 ACM SIGSAC Conference on Computer and Communications Security
2014 ACM SIGSAC Conference on Computer and Communications Security, Nov 2014, Scottsdale, United States. pp.609-620, ⟨10.1145/2660267.2660276⟩
ACM Conference on Computer and Communications Security
2014 ACM SIGSAC Conference on Computer and Communications Security, Nov 2014, Scottsdale, United States. pp.609-620, ⟨10.1145/2660267.2660276⟩
ACM Conference on Computer and Communications Security
International audience; We consider the problem of computational indistinguishability of protocols. We design a symbolic model, amenable to automated deduction, such that a successful inconsistency proof implies computational indistinguishability. Co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ea6af04de61299a4bd49c2a9ee2995b1
https://inria.hal.science/hal-01102216
https://inria.hal.science/hal-01102216
Publikováno v:
Hubert Comon-lundh, Helene Kirchner (ed.), Rewriting, Computation and Proof, Essays Dedicated, pp. 89-112
Rewriting, Computation and Proof ISBN: 9783540731467
Rewriting, Computation and Proof
Lecture Notes in Computer Science ; 4600, 89-112. Berlin ; New York : Springer
STARTPAGE=89;ENDPAGE=112;TITLE=Lecture Notes in Computer Science ; 4600
Rewriting, Computation and Proof ISBN: 9783540731467
Rewriting, Computation and Proof
Lecture Notes in Computer Science ; 4600, 89-112. Berlin ; New York : Springer
STARTPAGE=89;ENDPAGE=112;TITLE=Lecture Notes in Computer Science ; 4600
In this paper we review some well-known theory about reduction strategies of various kinds: normalizing, outermost-fair, cofinal, Church-Rosser. A stumbling block in the definition of such strategies is the presence of reduction cycles that may 'trap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2505dd65a38162c461404e2d01d9adcb
https://hdl.handle.net/2066/36395
https://hdl.handle.net/2066/36395
Publikováno v:
CADE'24-24th International Conference on Automated Deduction-2013
CADE'24-24th International Conference on Automated Deduction-2013, Jun 2013, Lake Placid, United States. pp.91-108, ⟨10.1007/978-3-642-38574-2_6⟩
Lecture Notes in Computer Science
Automated Deduction – CADE-24 ISBN: 9783642385735
CADE
CADE'24-24th International Conference on Automated Deduction-2013, Jun 2013, Lake Placid, United States. pp.91-108, ⟨10.1007/978-3-642-38574-2_6⟩
Lecture Notes in Computer Science
Automated Deduction – CADE-24 ISBN: 9783642385735
CADE
International audience; The main contribution of the paper is a PTIME decision procedure for the satisfiability problem in a class of first-order Horn clauses. Our result is an extension of the tractable classes of Horn clauses of Basin & Ganzinger i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1723285e0a1ef9cfae6fc3b017ae4a63
https://hal.inria.fr/hal-00881068
https://hal.inria.fr/hal-00881068
Autor:
Hubert Comon-Lundh
Publikováno v:
LICS
Logic plays an important role in formal aspects of computer security, for instance in access control, security of communications or even intrusion detection. The peculiarity of security problems is the presence of an attacker, whose goal is to break
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::18059d1fa7bcdbeb0dc5cc2d623df860
https://doi.org/10.1109/lics.2013.68
https://doi.org/10.1109/lics.2013.68
Autor:
Gergei Bana, Hubert Comon-Lundh
Publikováno v:
2nd Conference on Principles of Security and Trust (POST 2012)
2nd Conference on Principles of Security and Trust (POST 2012), 2012, Unknown, pp.189-208
Lecture Notes in Computer Science ISBN: 9783642286407
POST
2nd Conference on Principles of Security and Trust (POST 2012), 2012, Unknown, pp.189-208
Lecture Notes in Computer Science ISBN: 9783642286407
POST
International audience; We consider the question of the adequacy of symbolic models versus computational models for the verification of security protocols. We neither try to include properties in the symbolic model that reflect the properties of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::663f23082dd098264edf5511187186de
https://hal.inria.fr/hal-00863380
https://hal.inria.fr/hal-00863380