Výsledky vyhledávání - "Francis Klay"

Autor: Florent Jacquemard, Camille Vacher, Francis Klay

Publikováno v: Information and Computation
Information and Computation, Elsevier, 2011, 209 (3), pp.486-512. ⟨10.1016/j.ic.2010.11.015⟩
Information and Computation, 2011, 209 (3), pp.486-512. ⟨10.1016/j.ic.2010.11.015⟩

International audience; We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a restriction on the computation of RTA on trees: RTA

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::85e0300a0a32f2ca622019fe86602399
https://doi.org/10.1016/j.ic.2010.11.015

Zobrazit plný text záznamu

[Untitled]

Autor: Laurent Fribourg, Béatrice Bérard, Jean-François Monin, Francis Klay

Publikováno v: Formal Methods in System Design. 22:59-86

The ABR conformance protocol is a real-time program that controls dataflow rates on ATM networks. A crucial part of this protocol is the dynamical computation of the expected rate of data cells. We present here a modelling of the corresponding progra

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::15586589740120715ef1d40a545c517f
https://doi.org/10.1023/a:1021704214464

Zobrazit plný text záznamu

[Untitled]

Autor: Michaël Rusinowitch, Francis Klay, Sorin Stratulat

Publikováno v: Journal of Automated Reasoning. 30:153-177

The Available Bit Rate protocol (ABR) for ATM networks is well adapted to data traffic by providing minimum rate guarantees and low cell loss to the ABR source end system. An ABR conformance algorithm for controlling the source rates through an inter

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::2c57eaad60654e7acfdbe7b8a6f5bf0d
https://doi.org/10.1023/a:1023251327012

Zobrazit plný text záznamu

Rigid Tree Automata

Autor: Francis Klay, Camille Vacher, Florent Jacquemard

Publikováno v: Third International Conference on Language and Automata Theory and Applications
Third International Conference on Language and Automata Theory and Applications, Apr 2009, Tarragona, Spain. pp.446-457, ⟨10.1007/978-3-642-00982-2_38⟩
Language and Automata Theory and Applications ISBN: 9783642009815
LATA

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f541ce2884df960411a4b779c2415c4d
https://hal.inria.fr/inria-00579001/file/RTA.pdf

Zobrazit plný text záznamu

Automatic Methods for Analyzing Non-repudiation Protocole with an Active Intruder

Autor: Francis Klay, Laurent Vigneron

Publikováno v: 5th International Workshop on Formal Aspects in Security and Trust-FAST 2008
5th International Workshop on Formal Aspects in Security and Trust-FAST 2008, Oct 2008, Malaga, Spain. pp.192-209, ⟨10.1007/978-3-642-01465-9_13⟩
Formal Aspects in Security and Trust ISBN: 9783642014642
Formal Aspects in Security and Trust

Non-repudiation protocols have an important role in many areas where secured transactions with proofs of participation are necessary. Formal methods are clever and without error, therefore using them for verifying such protocols is crucial. In this p

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ffd8a74ad60b6375356cce6b69057ca9
https://hal.inria.fr/inria-00376450/document

Zobrazit plný text záznamu

An incremental method for the design of feature-oriented systems

Autor: Karim Berkani, Francis Klay, Pascale Le Gall

Publikováno v: Language Constructs for Describing Features ISBN: 9781852333928
FIREworks

Telecommunication systems involve many optional features which cannot be combined according to an obvious definition because they can interact together in an unpredictable way. In order to find the best way to combine features, a major difficulty is

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::fefb5f27c961c4aa80be6fc9053fd2a2
https://doi.org/10.1007/978-1-4471-0287-8_4

Zobrazit plný text záznamu

Mechanical Verification of an Ideal Incremental ABR Conformance Algorithm

Autor: Francis Klay, Sorin Stratulat, Michaël Rusinowitch

Publikováno v: 12th International Conference on Computer Aided Verification-CAV'2000
12th International Conference on Computer Aided Verification-CAV'2000, 2000, Chicago, USA, pp.344-357
Computer Aided Verification ISBN: 9783540677703

The Available Bit Rate protocol (ABR) for ATM networks is well-adapted to data traffic by providing minimum rate guarantees and low cell loss to the ABR source end system. An ABR conformance algorithm for controlling the source rates through an inter

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aed3974ef7a5ee6aaaf2279909e34d32
https://hal.inria.fr/inria-00099167

Zobrazit plný text záznamu

Rewriting for Cryptographic Protocol Verification

Autor: Francis Klay, Thomas Genet

Publikováno v: Automated Deduction-CADE-17 ISBN: 9783540676645
CADE

On a case study, we present a new approach for verifying cryptographic protocols, based on rewriting and on tree automata techniques. Protocols are operationally described using Term Rewriting Systems and the initial set of communication requests is

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::acde6563f4dd6827103d5eec9f5e4937
https://doi.org/10.1007/10721959_21

Zobrazit plný text záznamu

Correctness Proof of the Standardized Algorithm for ABR Conformance

Autor: Francis Klay, Jean-François Monin

Publikováno v: FM’99 — Formal Methods ISBN: 9783540665878
World Congress on Formal Methods

Conformance control for ATM cells is based on a real-time reactive algorithm which delivers a value depending on inputs from the network. This value must always agree with a well defined theoretical value. We present here the correctness proof of the

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::bcffab5b388271e7bd9b5fce1d346447
https://doi.org/10.1007/3-540-48119-2_37

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání