Filtrer vos résultats
- 29
- 14
- 29
- 8
- 3
- 2
- 1
- 7
- 1
- 42
- 1
- 1
- 2
- 1
- 3
- 2
- 1
- 4
- 3
- 1
- 4
- 4
- 4
- 2
- 1
- 1
- 2
- 3
- 2
- 2
- 35
- 8
- 36
- 21
- 15
- 13
- 11
- 9
- 8
- 6
- 5
- 5
- 3
- 3
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 43
- 25
- 18
- 14
- 8
- 6
- 6
- 6
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
43 résultats
|
|
triés par
|
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
Communication dans un congrès
hal-00083435v1
|
|||
[Invited Paper] Formal Methods for Mobile Robots: Current Results and Open ProblemsInternational Journal of Informatics Society, 2015, 7 (3), pp.101-114
Article dans une revue
hal-01238784v1
|
|||
Swarms of Mobile Robots: Towards Versatility with SafetyLeibniz Transactions on Embedded Systems, 2022, Special Issue on Distributed Hybrid Systems, 8 (2), pp.02:1-02:36. ⟨10.4230/LITES.8.2.2⟩
Article dans une revue
hal-03901898v1
|
|||
|
Une preuve est une histoireVingt-septièmes Journées Francophones des Langages Applicatifs (JFLA 2016), Jan 2016, Saint-Malo, France
Communication dans un congrès
hal-01333581v1
|
||
Automated Certified Proofs with CiME3RTA - 22nd International Conference on Rewriting Techniques and Applications, 2011, Novi Sad, Serbia
Communication dans un congrès
hal-00777669v1
|
|||
|
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⟩
Communication dans un congrès
inria-00535655v1
|
||
Certification of automated termination proofs6th Int. Symp. on Frontiers of Combining Systems, Liverpool, Royaume-Uni, Jan 2007, X, France. pp.148-162
Communication dans un congrès
hal-01125312v1
|
|||
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
Communication dans un congrès
hal-01126336v1
|
|||
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
Communication dans un congrès
hal-01125530v1
|
|||
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⟩
Communication dans un congrès
hal-01549942v1
|
|||
|
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
Communication dans un congrès
hal-02115611v1
|
||
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⟩
Communication dans un congrès
hal-01937420v1
|
|||
Structural Analysis of Narratives with the Coq Proof Assistant.Interactive theorem proving (TPHOLs), Aug 2011, Berg en Dal, Netherlands. pp.55--70
Communication dans un congrès
hal-01125870v1
|
|||
|
Towards Provably Robust Watermarking2012
Pré-publication, Document de travail
hal-00682398v1
|
||
|
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
Communication dans un congrès
hal-02871295v1
|
||
Brief Announcement: Certified impossibility results for Byzantine-tolerant mobile robotsInternational Symposium on Distributed Computing (DISC2013), Oct 2013, Jerusalem, Israel. pp.2
Communication dans un congrès
hal-01126335v1
|
|||
|
Représentation d’algèbres non libres en théorie des typesLogique en informatique [cs.LO]. Université Paris 11, 2001. Français. ⟨NNT : ⟩
Thèse
tel-02346101v1
|
||
|
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⟩
Communication dans un congrès
hal-00930267v1
|
||
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
Communication dans un congrès
hal-00083215v1
|
|||
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
Communication dans un congrès
hal-03131638v1
|
|||
Structural Analysis of Narratives with the Coq Proof Assistant[Research Report] CEDRIC-11-2061, CEDRIC Lab/CNAM. 2011
Rapport
hal-01125850v1
|
|||
Systèmes de confiance et détection d'intrusion répartisLes Journées Informatique de la Région Centre, Jun 2005, Blois, France
Communication dans un congrès
hal-00459971v1
|
|||
|
A Certified Universal Gathering Algorithm for Oblivious Mobile Robots[Research Report] UPMC, Sorbonne Universites CNRS; CNAM, Paris; College de France; Université Paris Sud. 2015
Rapport
hal-01159890v1
|
||
|
Impossibility of Gathering, a Certification[Technical Report] CEDRIC-14-3016, CEDRIC laboratory, CNAM-Paris, France. 2014, pp.10
Rapport
hal-00995126v1
|
||
|
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
Rapport
hal-01762962v1
|
||
Matrix interpretations revisitedExtended Abstracts of the 10th International Workshop on Termination, WST'09, Leipzig, Germany, Ju, Jan 2009, X, France. pp.4
Communication dans un congrès
hal-01125629v1
|
|||
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
Communication dans un congrès
hal-00083400v1
|
|||
Certification of automated termination proofs[Research Report] CEDRIC-07-1185, CEDRIC Lab/CNAM. 2007
Rapport
hal-01125298v1
|
|||
Maximal and Compositional Pattern-Based Loop Invariants - Definitions and Proofs[Research Report] CEDRIC-12-2555, CEDRIC Lab/CNAM. 2012
Rapport
hal-01126139v1
|
|||
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
Communication dans un congrès
hal-01125706v1
|
- 1
- 2