Filter your results
- 20
- 13
- 14
- 9
- 6
- 1
- 1
- 1
- 1
- 4
- 1
- 31
- 1
- 1
- 2
- 3
- 1
- 4
- 2
- 1
- 4
- 3
- 1
- 3
- 1
- 1
- 1
- 1
- 1
- 3
- 1
- 28
- 5
- 27
- 24
- 17
- 16
- 12
- 12
- 11
- 8
- 6
- 5
- 3
- 3
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 33
- 21
- 21
- 16
- 10
- 6
- 5
- 4
- 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
|
|
sorted by
|
Mechanically Proving Termination Using Polynomial InterpretationsJournal of Automated Reasoning, 2005, 34 (4), pp.325-363. ⟨10.1007/s10817-005-9022-x⟩
Journal articles
istex
hal-01984434v1
|
|||
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⟩
Journal articles
hal-03901898v1
|
|||
Automated Certified Proofs with CiME3RTA - 22nd International Conference on Rewriting Techniques and Applications, 2011, Novi Sad, Serbia
Conference papers
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⟩
Conference papers
inria-00535655v1
|
||
Synchronous Gathering without Multiplicity Detection: a Certified AlgorithmTheory of Computing Systems, 2019, 63 (2), pp.200-218. ⟨10.1007/s00224-017-9828-z⟩
Journal articles
hal-01894618v1
|
|||
|
Computer Aided Formal Design of Swarm Robotics Algorithms2021
Preprints, Working Papers, ...
hal-03111541v1
|
||
A Certified Universal Gathering Algorithm for Oblivious Mobile RobotsDistributed Computing (DISC), Sep 2016, Paris, France
Conference papers
hal-01349061v1
|
|||
|
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
Conference papers
hal-03219933v1
|
||
Brief announcement: Certified Universal Gathering in R2 for Oblivious Mobile RobotsACM Conference on Principles of Distributed Computing (PODC), ACM, Jul 2016, Chicago, United States
Conference papers
hal-01349084v1
|
|||
Formal Methods for Mobile RobotsPaola Flocchini; Giuseppe Prencipe; Nicola Santoro. Distributed Computing by Mobile Entities, Current Research in Moving and Computing, 11340, Springer International Publishing, pp.278-313, 2019, Theoretical Computer Science and General Issues, 978-3-030-11071-0. ⟨10.1007/978-3-030-11072-7_12⟩
Book sections
hal-01981634v1
|
|||
Modular & Incremental Automated Termination ProofsJournal of Automated Reasoning, 2004, 32 (4), pp.315-355
Journal articles
hal-01984428v1
|
|||
|
Modular and Incremental Proofs of AC-TerminationJournal of Symbolic Computation, 2004, 38 (1), pp.873-897. ⟨10.1016/j.jsc.2004.02.003⟩
Journal articles
hal-01984429v1
|
||
|
Proving Operational Termination of Membership Equational ProgramsHigher-Order and Symbolic Computation, 2008, 21 (1-2), pp.59-88
Journal articles
inria-00431474v1
|
||
|
Impossibility of Gathering, a Certification[Technical Report] CEDRIC-14-3016, CEDRIC laboratory, CNAM-Paris, France. 2014, pp.10
Reports
hal-00995126v1
|
||
|
A Certified Universal Gathering Algorithm for Oblivious Mobile Robots[Research Report] UPMC, Sorbonne Universites CNRS; CNAM, Paris; College de France; Université Paris Sud. 2015
Reports
hal-01159890v1
|
||
|
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
Reports
hal-01762962v1
|
||
|
Approche incrémentale des preuves automatiques de terminaisonLogique en informatique [cs.LO]. Université Paris 11, 2001. Français. ⟨NNT : 2001PA112227⟩
Theses
tel-02061902v1
|
||
|
Absolute cross sections and asymmetry parameters for photodetachment of excited C$^-$($^2$D)Conference poster hal-03709572v1 |
||
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⟩
Conference papers
hal-01549942v1
|
|||
|
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⟩
Conference papers
hal-03425768v1
|
||
Mechanically proving termination using polynomial interpretations[Intern report] 1382, 2006
Reports
inria-00001167v1
|
|||
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⟩
Conference papers
hal-01937420v1
|
|||
|
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
Conference papers
hal-02871295v1
|
||
|
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
Conference papers
hal-02115611v1
|
||
Brief Announcement: Certified impossibility results for Byzantine-tolerant mobile robotsInternational Symposium on Distributed Computing (DISC2013), Oct 2013, Jerusalem, Israel. pp.2
Conference papers
hal-01126335v1
|
|||
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⟩
Conference papers
hal-01491813v1
|
|||
|
Impossibility of gathering, a certificationInformation Processing Letters, 2015, 115 (3), pp.447-452. ⟨10.1016/j.ipl.2014.11.001⟩
Journal articles
hal-01122869v1
|
||
|
Certified Impossibility Results for Byzantine-Tolerant Mobile Robots[Research Report] 1560, LRI - CNRS, University Paris-Sud. 2013
Reports
hal-00834633v1
|
||
|
Certified Universal Gathering in $R^2$ for Oblivious Mobile Robots[Research Report] UPMC; CNAM. 2016
Reports
hal-01274295v1
|
||
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⟩
Conference papers
hal-02115599v1
|
- 1
- 2