Ranking preferences deduction based on semantic similarity for the stable marriage problem

Autor: Michael Guedj

Publikováno v: ICCI*CC

The stable marriage problem is a well-known problem with many practical applications. Most algorithms to find stable marriages assume that the participants explicitly express a preference ordering. This can be problematic when the number of options i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e5cddc669c7bc7e9a2ec1c880cbdc8f9
https://doi.org/10.1109/icci-cc.2016.7862088

A BSP algorithm for on-the-fly checking CTL* formulas on security protocols

Autor: Frédéric Gava, Franck Pommereau, Michael Guedj

Publikováno v: Journal of Supercomputing
Journal of Supercomputing, 2014, 69 (2), pp.629--672. ⟨10.1007/s11227-014-1099-8⟩
Journal of Supercomputing, Springer Verlag, 2014, 69 (2), pp.629--672. ⟨10.1007/s11227-014-1099-8⟩
PDCAT
Proc. of the 13th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2012)
13th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2012)
13th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2012), Dec 2012, Beijing, China. pp.79--84, ⟨10.1109/PDCAT.2012.12⟩

International audience; This paper presents a distributed (Bulk-Synchronous Parallel or bsp) algorithm to compute on-the-fly whether a structured model of a security protocol satisfies a ctl {Mathematical expression} formula. Using the structured nat

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::63e739f3d486005dcbf245025fbcf3f6
https://hal.science/hal-00950399

A BSP algorithm for on-the-fly checking LTL formulas on security protocols

Autor: Michael Guedj, Franck Pommereau, Frédéric Gava

Publikováno v: Proc. of the 11th International Symposium on Parallel and Distributed Computing (ISPDC 2012)
11th International Symposium on Parallel and Distributed Computing (ISPDC 2012)
11th International Symposium on Parallel and Distributed Computing (ISPDC 2012), Jun 2012, Munich/Garching, Bavaria, Germany. pp.11--18, ⟨10.1109/ISPDC.2012.10⟩
ISPDC

International audience; This paper presents a Bulk-Synchronous Parallel (BSP) algorithm to compute on-the-fly whether a structured model of a security protocol satisfies a LTL formula. Using the structured nature of the security protocols allows us t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0815cc10f8f37301499132faf463a5f8
https://hal.archives-ouvertes.fr/hal-00868689/file/GGP-ISPDC-2012.pdf

A BSP Algorithm for the State Space Construction of Security Protocols

Autor: Franck Pommereau, Michael Guedj, Frédéric Gava

Publikováno v: 2010 Ninth International Workshop on Parallel and Distributed Methods in Verification, and Second International Workshop on High Performance Computational Systems Biology
9th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC, affiliated to conference SPIN 2010)
9th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC, affiliated to conference SPIN 2010), Sep 2010, Enschede, Netherlands. pp.37--44, ⟨10.1109/PDMC-HiBi.2010.14⟩

International audience; This paper presents a Bulk-Synchronous Parallel (BSP) algorithm to compute the discrete state space of structured models of security protocols. The BSP model of parallelism avoids concurrency related problems (mainly deadlocks

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::95ddcffeb236e72a0d1a90d27bd049d0
https://doi.org/10.1109/pdmc-hibi.2010.14