Michael Guedj
Courriel :
michael.guedj@seineetmarne.cci.fr
Département d'informatique, CFA UTEC - CCI 77, CCI Paris Île-de-France, France.
Recherche
-
Ranking Preferences Deduction Based on Semantic Similarity for the
Stable Marriage Problem.
Michael Guedj.
In: Cognitive Informatics and Cognitive Computing (ICCI*CC).
IEEE. 2016.
-
Levelized Taxonomy Approach for the Job Seeking/Recruitment Problem.
Michael Guedj.
In: Computational Science and Engineering (CSE).
IEEE. 2016.
-
A BSP Algorithm for On-The-Fly Checking CTL* Formulas on Security Protocols.
[HAL]
F. Gava, M. Guedj and F. Pommereau.
Journal of SuperComputing.
Springer. 2014.
-
Deductive Verification of State-Space Algorithms.
J. Fortin, F. Gava and M. Guedj.
In: integrated Formal Methods (iFM), LNCS.
Springer. 2013.
-
A BSP Algorithm for On-The-Fly Checking CTL* Formulas on Security Protocols.
[HAL]
F. Gava, M. Guedj and F. Pommereau.
In: Parallel and Distributed Computing (PDCAT).
IEEE. 2012.
-
A BSP Algorithm for On-The-Fly Checking LTL Formulas on Security Protocols.
[HAL]
F. Gava, M. Guedj and F. Pommereau.
In: Parallel and Distributed Computing (ISPDC).
IEEE. 2012.
-
Performance Evaluations of a BSP Algorithm for State Space Construction of Security Protocols.
[HAL]
F. Gava, M. Guedj and F. Pommereau.
In: Parallel, Distributed, and Network-Based Processing (PDP). pages 170-174.
IEEE. 2012.
-
A BSP Algorithm for the State Space Construction of Security Protocols.
[HAL]
F. Gava, M. Guedj and F. Pommereau.
In: Workshop on Parallel and Distributed Methods in verifiCation (PDMC, affiliated to conference SPIN).
IEEE. 2010.
-
BSP Algorithms for LTL & CTL* Model Checking of Security Protocols.
[HAL]
Michael Guedj.
PhD thesis, LACL.
Université Paris-Est. 2012.
-
Equations et langages formels, le cas quadratique.
Equations and Formal Languages, the Quadratic Case (in French).
[PDF]
Michael Guedj.
Master thesis, LaBRI.
Université de Bordeaux. 2007.