Zobrazeno 1 - 10
of 9 009
pro vyhledávání: '"A. Cheval"'
Autor:
Cheval, Vincent, Fontaine, Caroline
Computer-aided analysis of security protocols heavily relies on equational theories to model cryptographic primitives. Most automated verifiers for security protocols focus on equational theories that satisfy the Finite Variant Property (FVP), for wh
Externí odkaz:
http://arxiv.org/abs/2410.15289
In this paper we introduce holonomic tree automata: a common extension of weighted tree automata and holonomic recurrences. We show that the generating function of the tree series represented by such an automaton is differentially algebraic. Converse
Externí odkaz:
http://arxiv.org/abs/2407.08218
Autor:
Cheval, Horatiu
In this paper, we obtain rates of metastability for the Tikhonov-Mann iteration for countable families of mappings in CAT(0) spaces. This iteration was recently defined by the author in the setting of W-hyperbolic spaces as a generalization of the st
Externí odkaz:
http://arxiv.org/abs/2406.03429
Autor:
Vargas-Solar, Genoveva, Cerquitelli, Tania, Espinosa-Oviedo, Javier A., Cheval, François, Buchaille, Anthelme, Polgar, Luca
This paper proposes a conversational approach implemented by the system Chatin for driving an intuitive data exploration experience. Our work aims to unlock the full potential of data analytics and artificial intelligence with a new generation of dat
Externí odkaz:
http://arxiv.org/abs/2311.06695
We introduce the class of P-finite automata. These are a generalisation of weighted automata, in which the weights of transitions can depend polynomially on the length of the input word. P-finite automata can also be viewed as simple tail-recursive p
Externí odkaz:
http://arxiv.org/abs/2310.14725
Publikováno v:
EPTCS 389, 2023
This volume contains the proceedings of the 7th Working Formal Methods Symposium, which was held at the University of Bucharest, September 21-22, 2023.
Externí odkaz:
http://arxiv.org/abs/2309.12959
Autor:
Cheval, Horaţiu
In this paper we generalize the strongly convergent Krasnoselskii- Mann-type iteration for families of nonexpansive mappings defined recently by Bo\c{t} and Meier in Hilbert spaces to the abstract setting of W - hyperbolic spaces and we compute effec
Externí odkaz:
http://arxiv.org/abs/2304.11366
Autor:
Cheval, Horaţiu, Leuştean, Laurenţiu
In this note we apply a lemma due to Sabach and Shtern to compute linear rates of asymptotic regularity for Halpern-type nonlinear iterations studied in optimization and nonlinear analysis.
Externí odkaz:
http://arxiv.org/abs/2303.05406
Transparency protocols are protocols whose actions can be publicly monitored by observers (such observers may include regulators, rights advocacy groups, or the general public). The observed actions are typically usages of private keys such as decryp
Externí odkaz:
http://arxiv.org/abs/2303.04500
Publikováno v:
TheoretiCS, Volume 3 (March 13, 2024) theoretics:10298
Automated verification has become an essential part in the security evaluation of cryptographic protocols. In this context privacy-type properties are often modelled by indistinguishability statements, expressed as behavioural equivalences in a proce
Externí odkaz:
http://arxiv.org/abs/2211.03225