Pierre Courtieu
Publications
Publications
|
|
Comment se rassembler (avec certitude) quand on est confus et désorientéALGOTEL 2025 – 27èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2025, Saint Valery-sur-Somme, France |
|
|
Rendez-vous au Point-Dont-On-Ne-Doit-Pas-Calculer-Les-CoordonnéesALGOTEL 2025 – 27èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2025, Saint Valery-sur-Somme, France |
|
|
Deterministic Color-optimal Self-stabilizing Semi-synchronous Gathering: a Certified AlgorithmSIROCCO 2025, Jun 2025, Delphi, Greece. pp.127-143, ⟨10.1007/978-3-031-91736-3_8⟩ |
|
|
Comment s'assurer de garder le contact (et nos distances)ALGOTEL 2021 - 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, 2021, La Rochelle, France |
|
|
Computer Aided Formal Design of Swarm Robotics AlgorithmsStabilization, Safety, and Security of Distributed Systems. SSS 2021, Nov 2021, Online, Sweden. pp.469-473, ⟨10.1007/978-3-030-91081-5_31⟩ |
|
|
Du discrètement continu au continûment discretALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2020, Lyon, France |
|
|
Manuel de savoir-prouver à l’usage des roboteux et des distributeuxALGOTEL 2019 - 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2019, Saint Laurent de la Cabrerisse, France. pp.1-4 |
|
|
Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots7th International Conference on NETworked sYStems (NETYS 2019), Jun 2019, Marrakech, Morocco. pp.93-09, ⟨10.1007/978-3-030-31277-0_7⟩ |
Les Protocoles de Déplacement de Robots: l’Algorithmique distribuée comme terrain de jeu pour la preuve formelleJFLA 2019. Journées Francophones des Langages Applicatifs, Jan 2019, Les Rousses, France |
|
Brief Announcement Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile RobotsStabilization, Safety, and Security of Distributed Systems. SSS 2018., Xavier Defago, Toshimitsu Masuzawa, Koichi Wada, Nov 2018, Tokyo, Japan. pp.404-408, ⟨10.1007/978-3-030-03232-6_29⟩ |
|
Certified Gathering of Oblivious Mobile Robots: survey of recent results and open problemsFormal Methods for Industrial Critical Systems and Automated Verification of Critical Systems (FMICS/AVOCS), Sep 2017, Turin, Italy. pp.165-181, ⟨10.1007/978-3-319-67113-0_11⟩ |
|
|
|
Une preuve est une histoireVingt-septièmes Journées Francophones des Langages Applicatifs (JFLA 2016), Jan 2016, Saint-Malo, France |
Brief announcement: Certified Universal Gathering in R2 for Oblivious Mobile RobotsACM Conference on Principles of Distributed Computing (PODC), ACM, Jul 2016, Chicago, United States. pp.439-441, ⟨10.1145/2933057.2933070⟩ |
|
|
|
Certified Universal Gathering in $R^2$ for Oblivious Mobile RobotsDistributed Computing (DISC), Sep 2016, Paris, France. pp.187-200, ⟨10.1007/978-3-662-53426-7_14⟩ |
Extended abstract: Towards the Formalization of SPARK 2014 Semantics with Explicit Run-time Checks Using CoqHigh Integrity Language Technology - ACM SIGAda?s Annual International Conference, Nov 2013, X, Australia. pp.2 |
|
Brief Announcement: Certified impossibility results for Byzantine-tolerant mobile robotsInternational Symposium on Distributed Computing (DISC2013), Oct 2013, Jerusalem, Israel. pp.2 |
|
|
|
Certified Impossibility Results for Byzantine-Tolerant Mobile RobotsInternational Symposium on Stabilization, Safety, and Security of Distributed Systems, Nov 2013, Osaka, Japan. pp.178-190, ⟨10.1007/978-3-319-03089-0_13⟩ |
Maximal and Compositional Pattern-Based Loop InvariantsFormal method 2012 (FME), Aug 2012, Paris, France. pp.37-51 |
|
Toward provably robust watermarkingInteractive theorem proving (TPHOLs), Aug 2012, X, France. pp.0-0 |
|
Automated Certified Proofs with CiME3RTA - 22nd International Conference on Rewriting Techniques and Applications, 2011, Novi Sad, Serbia |
|
Structural Analysis of Narratives with the Coq Proof Assistant.Interactive theorem proving (TPHOLs), Aug 2011, Berg en Dal, Netherlands. pp.55--70 |
|
Formal Proofs of Robustness for Watermarking AlgorithmsTYPES WOKSHOP 2011, Sep 2011, X, France |
|
|
|
A3PAT, an Approach for Certified Automated Termination Proofs2010 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, ACM, Jan 2010, Madrid, Spain. pp.63-72, ⟨10.1145/1706356.1706370⟩ |
Improved Matrix InterpretationSOFSEM'10, Int. Conf. on Current Trends in Theory and Practice of Computer Science,, Jan 2010, Spindleruv Ml{\'y}n, Czech Republic. pp.12 |
|
Matrix interpretations revisitedExtended Abstracts of the 10th International Workshop on Termination, WST'09, Leipzig, Germany, Ju, Jan 2009, X, France. pp.4 |
|
Certifying a Termination Criterion Based on Graphs, without GraphsTPHOLs'08 Theorem Proving in Higher Order Logics, Montr?al, Canada, Jan 2008, Montreal, Canada. pp.183-198 |
|
Certification of automated termination proofs6th Int. Symp. on Frontiers of Combining Systems, Liverpool, Royaume-Uni, Jan 2007, X, France. pp.148-162 |
|
Systèmes de confiance et détection d'intrusion répartisLes Journées Informatique de la Région Centre, Jun 2005, Blois, France |
|
Amélioration de la sécurité des grands réseaux par une infrastructure de méta-politique11ème Colloque Francophone sur l'Ingénierie des Protocoles (CFIP'2005), Mar 2005, Bordeaux, France. pp.517-530 |
|
Mandatory Access Control On Distributed Systems: A Metapolicy FrameworkFirst Colloquium on Risk and Security of the Internet and Systems (CRiSIS 2005), Oct 2005, Bourges, France. pp.133-144 |
|
Hardening large-scale networks security through a meta-policy framework3rd Workshop on the Internet, Telecommunications and Signal Processing (WITSP'04), Dec 2004, Adelaïde, Australia. pp.132-137 |
|
A novel approach for distributed updates of MAC policies using a meta-protection framework15th IEEE International Symposium on Software Reliability Engineering (ISSRE 2004), Nov 2004, Saint Malo, France. pp.29-30 |
|
|
|
Normalized TypesComputer Science Logic, Sep 2001, Paris, France |
|
|
Swarms of Mobile Robots: Towards Versatility with SafetyLeibniz Transactions on Embedded Systems, 2022, Distributed Hybrid Systems, 8 (2), pp.02:1-02:36. ⟨10.4230/LITES.8.2.2⟩ |
|
|
Impossibility of gathering, a certificationInformation Processing Letters, 2015, 115 (3), pp.447-452. ⟨10.1016/j.ipl.2014.11.001⟩ |
[Invited Paper] Formal Methods for Mobile Robots: Current Results and Open ProblemsInternational Journal of Informatics Society, 2015, 7 (3), pp.101-114 |
|
|
Computer Aided Formal Design of Swarm Robotics Algorithms2021 |
|
|
Towards Provably Robust Watermarking2012 |
|
|
Continuous vs. Discrete Asynchronous Moves: a Certified Approach for Mobile Robots[Research Report] Sorbonne Université, CNRS, Laboratoire d’Informatique de Paris 6, LIP6, F-75005 Paris, France. 2018, pp.1-12 |
|
|
Certified Universal Gathering in $R^2$ for Oblivious Mobile Robots[Research Report] UPMC; CNAM. 2016 |
|
|
A Certified Universal Gathering Algorithm for Oblivious Mobile Robots[Research Report] UPMC, Sorbonne Universites CNRS; CNAM, Paris; College de France; Université Paris Sud. 2015 |
|
|
Impossibility of Gathering, a Certification[Technical Report] CEDRIC-14-3016, CEDRIC laboratory, CNAM-Paris, France. 2014, pp.10 |
|
|
Certified Impossibility Results for Byzantine-Tolerant Mobile Robots[Research Report] 1560, LRI - CNRS, University Paris-Sud. 2013 |
Maximal and Compositional Pattern-Based Loop Invariants - Definitions and Proofs[Research Report] CEDRIC-12-2555, CEDRIC Lab/CNAM. 2012 |
|
Structural Analysis of Narratives with the Coq Proof Assistant[Research Report] CEDRIC-11-2061, CEDRIC Lab/CNAM. 2011 |
|
Certification of automated termination proofs[Research Report] CEDRIC-07-1185, CEDRIC Lab/CNAM. 2007 |
|
|
Représentation d’algèbres non libres en théorie des typesLogique en informatique [cs.LO]. Université Paris 11, 2001. Français. ⟨NNT : ⟩ |