( en | de | ru )

 

Disambiguation of "Héam, Pierre-Cyrille"

Author of the publication

copydeleteadd this publication to your clipboard
A Model-Based Testing Approach for Security Protocols.

, , , , and . CSE/EUC/DCABES, page 553-556. IEEE Computer Society, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Cyrille Debris

Cyrille Chavet

Cyrille Barbot

Cyrille Dejemeppe

Cyrille Jégourel

 

Other publications of authors with the same name

Clôtures transitives de semi-commutations et model-checking régulier., , and . Technique et Science Informatiques, 27 (1-2): 7-28 (2008)Shelf schedules for independent moldable tasks to minimize the energy consumption., , , and . SBAC-PAD, page 126-136. IEEE, (2021)Composition of Services with Constraints., , , and . FACS@FMWeek, volume 263 of Electronic Notes in Theoretical Computer Science, page 31-46. Elsevier, (2009)Some complexity results for polynomial rational expressions.. Theor. Comput. Sci., 299 (1-3): 735-741 (2003)A theoretical limit for safety verification techniques with regular fix-point computations., and . Inf. Process. Lett., 108 (1): 1-2 (2008)List and shelf schedules for independent parallel tasks to minimize the energy consumption with discrete or continuous speeds., , , and . J. Parallel Distributed Comput., (April 2023)ELECTOR: Deterministic leader election algorithm for modular robots., , , , , and . SmartWorld/UIC/ScalCom/DigitalTwin/PriComp/Meta, page 1551-1559. IEEE, (2022)A Comparison of Random Task Graph Generation Methods for Scheduling Problems., , and . Euro-Par, volume 11725 of Lecture Notes in Computer Science, page 61-73. Springer, (2019)Automata for Pro-V Topologies.. CIAA, volume 2088 of Lecture Notes in Computer Science, page 135-144. Springer, (2000)A Lower Bound For Reversible Automata.. RAIRO Theor. Informatics Appl., 34 (5): 331-341 (2000)