( en | de | ru )

 

Disambiguation of "Garion, Christophe"

Author of the publication

copydeleteadd this publication to your clipboard
Teaching Deductive Verification Through Frama-C and SPARK for Non Computer Scientists.

, , , , and . FMTea, volume 11758 of Lecture Notes in Computer Science, page 23-36. Springer, (2019)

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.

Christophe Kunze

Christophe Bobda

Christophe Huber

Christophe Zerpka

Christophe Schwarz

 

Other publications of authors with the same name

Safety Verification of Neural Network Controlled Systems., , , and . CoRR, (2020)Equation-Directed Axiomatization of Lustre Semantics to Enable Optimized Code Validation., , , and . ACM Trans. Embed. Comput. Syst., 22 (5s): 151:1-151:24 (October 2023)Abstract domains for constraint programming with differential equations., , , , , and . NSAD@SAS, page 2-11. ACM, (2020)A Verified UAV Flight Plan Generator., , , , and . FormaliSE, page 130-140. IEEE, (2023)A Taxonomy of MBSE Approaches by Languages, Tools and Methods., , , and . IEEE Access, (2022)Ability in a Multi-agent Context: A Model in the Situation Calculus., , and . CLIMA, volume 3900 of Lecture Notes in Computer Science, page 23-36. Springer, (2005)Constraint-based Verification of Formation Control., , , , and . CDC, page 7136-7141. IEEE, (2021)Answering Queries Addressed to Several Databases: A Query Evaluator which Implements a Majority Merging Approach., and . ISMIS, volume 2366 of Lecture Notes in Computer Science, page 131-139. Springer, (2002)Strategies for Distributing Goals in a Team of Cooperative Agents., and . ESAW, volume 3451 of Lecture Notes in Computer Science, page 178-190. Springer, (2004)How to Complete Regulations in Multi-agent Systems., , and . IAT, page 285-288. IEEE Computer Society, (2009)978-0-7695-3801-3.