Filtrer vos résultats
- 27
- 13
- 19
- 9
- 8
- 1
- 1
- 1
- 1
- 6
- 1
- 38
- 1
- 1
- 2
- 3
- 1
- 4
- 2
- 1
- 4
- 3
- 1
- 3
- 2
- 1
- 4
- 3
- 1
- 1
- 3
- 1
- 35
- 5
- 31
- 27
- 17
- 16
- 12
- 12
- 11
- 8
- 6
- 5
- 3
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 40
- 25
- 21
- 16
- 10
- 7
- 6
- 5
- 4
- 4
- 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
40 résultats
|
|
|
triés par
|
[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
|
|||
|
|
The KRAKATOA tool for certificationof JAVA/JAVACARD programs annotated in JMLJournal of Logic and Algebraic Programming, 2004, 58 (1-2), pp.89-106. ⟨10.1016/j.jlap.2003.07.006⟩
Article dans une revue
hal-01984932v1
|
||
|
|
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
|
||
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
|
|||
Automated Certified Proofs with CiME3RTA - 22nd International Conference on Rewriting Techniques and Applications, 2011, Novi Sad, Serbia
Communication dans un congrès
hal-00777669v1
|
|||
Mechanically Proving Termination Using Polynomial InterpretationsJournal of Automated Reasoning, 2005, 34 (4), pp.325-363. ⟨10.1007/s10817-005-9022-x⟩
Article dans une revue
istex
hal-01984434v1
|
|||
|
|
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
|
||
|
|
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
|
|||
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
|
|||
Mechanically proving termination using polynomial interpretations[Intern report] 1382, 2006
Rapport
inria-00001167v1
|
|||
|
|
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
|
||
|
|
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⟩
Communication dans un congrès
hal-03425768v1
|
||
|
|
Absolute cross sections and asymmetry parameters for photodetachment of excited C$^-$($^2$D)Poster de conférence hal-03709572v1 |
||
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
|
|||
Towards a notion of Usable Rule for Context-Sensitive Rewrite SystemsPROLE'07, E. Pimentel ed., Proceedings of 7th Spanish Conference on Programming and Computer Languages, Saragosse, Espagne, Jan 2007, X, France. pp.243--252
Communication dans un congrès
hal-01125366v1
|
|||
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
|
|||
|
|
Approche incrémentale des preuves automatiques de terminaisonLogique en informatique [cs.LO]. Université Paris 11, 2001. Français. ⟨NNT : 2001PA112227⟩
Thèse
tel-02061902v1
|
||
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
|
|||
Formal Proofs of Robustness for Watermarking AlgorithmsTYPES WOKSHOP 2011, Sep 2011, X, France
Communication dans un congrès
hal-01126043v1
|
|||
|
|
Certified Universal Gathering in $R^2$ for Oblivious Mobile Robots[Research Report] UPMC; CNAM. 2016
Rapport
hal-01274295v1
|
||
|
|
Impossibility of gathering, a certificationInformation Processing Letters, 2015, 115 (3), pp.447-452. ⟨10.1016/j.ipl.2014.11.001⟩
Article dans une revue
hal-01122869v1
|
||
|
|
Certified Impossibility Results for Byzantine-Tolerant Mobile Robots[Research Report] 1560, LRI - CNRS, University Paris-Sud. 2013
Rapport
hal-00834633v1
|
||
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⟩
Communication dans un congrès
hal-02115599v1
|
|||
Synchronous Gathering Without Multiplicity Detection: A Certified AlgorithmInternational Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2016), Nov 2016, Lyon, France. pp.7-19, ⟨10.1007/978-3-319-49259-9_2⟩
Communication dans un congrès
hal-01491813v1
|
|||
Certification of automated termination proofs[Research Report] CEDRIC-07-1185, CEDRIC Lab/CNAM. 2007
Rapport
hal-01125298v1
|
|||
|
|
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
Communication dans un congrès
hal-03219933v1
|
||
|
|
Computer Aided Formal Design of Swarm Robotics Algorithms2021
Pré-publication, Document de travail
hal-03111541v1
|
||
Synchronous Gathering without Multiplicity Detection: a Certified AlgorithmTheory of Computing Systems, 2019, 63 (2), pp.200-218. ⟨10.1007/s00224-017-9828-z⟩
Article dans une revue
hal-01894618v1
|
|||
A Certified Universal Gathering Algorithm for Oblivious Mobile RobotsDistributed Computing (DISC), Sep 2016, Paris, France
Communication dans un congrès
hal-01349061v1
|
- 1
- 2