Homepage

• 
  Erwan Le Merrer, Benoît Morgan, Gilles Trédan. Bug ou ban ? Une Perspective Topologique sur le Shadow Banning. ALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2020, Lyon, France. pp.1-4. ⟨hal-02875595⟩
• 
  Jean-Baptiste Raclet, Franck Silvestre, Mika Pons. Mise en oeuvre d’approches pédagogiques fondées sur des pratiques de l’industrie du logiciel pour l’apprentissage de la programmation. DIDAPRO 8 - Colloque de didactique de l’informatique, Feb 2020, Lille, France. ⟨hal-02904169⟩
• 
  Maxim Kolomeets, Amira Benachour, Didier El Baz, Andrey Chechulin, Martin Strecker, et al.. Reference architecture for social networks graph analysis tool. Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications, Innovative Information Science & Technology Research Group (ISYOU), 2019, 10 (4), pp.109-125. ⟨10.22667/JOWUA.2019.12.31.109⟩. ⟨hal-02443865⟩
• 
  Ulrich Berger, Ralph Matthes, Anton Setzer. Martin Hofmann's Case for Non-Strictly Positive Data Types. Peter Dybjer; José Espírito Santo; Luís Pinto. 24th International Conference on Types for Proofs and Programs (TYPES 2018), 130, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp.1:1-1:22, 2019, Leibniz International Proceedings in Informatics (LIPIcs), 978-3-95977-106-1. ⟨10.4230/LIPIcs.TYPES.2018.1⟩. ⟨hal-02365814⟩
• 
  Neeraj Kumar Singh, Yamine Aït-Ameur, Dominique Méry, David Navarre, Philippe Palanque, et al.. Formal Development of Multi-Purpose Interactive Application (MPIA) for ARINC 661. 7th International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS 2019), Nov 2019, Shenzhen, China. pp.21-39, ⟨10.1007/978-3-030-46902-3_2⟩. ⟨hal-02942767⟩
• 
  Florent Chevrou, Aurélie Hurault, Philippe Quéinnec. A Modular Framework for Verifying Versatile Distributed Systems. Journal of Logic and Algebraic Methods in Programming, Elsevier, 2019, 108, pp.24-46. ⟨10.1016/j.jlamp.2019.05.008⟩. ⟨hal-02451058⟩
• 
  Armando Castañeda, Aurélie Hurault, Philippe Quéinnec, Matthieu Roy. Tasks in Modular Proofs of Concurrent Algorithms. 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2019), Oct 2019, Pisa, Italy. pp.69-83, ⟨10.1007/978-3-030-34992-9_6⟩. ⟨hal-02903005⟩
• 
  Dominique Larchey-Wendling, Ralph Matthes. Certification of Breadth-First Algorithms by Extraction. Mathematics of Program Construction. MPC 2019. Lecture Notes in Computer Science, 11825, pp.45-75, 2019, ⟨10.1007/978-3-030-33636-3_3⟩. ⟨hal-02333423⟩
• 
  Ian Malakhovski. Sur le pouvoir expressif des structures applicatives et monadiques indexées. Analyse numérique [cs.NA]. Université Paul Sabatier - Toulouse III, 2019. Français. ⟨NNT : 2019TOU30118⟩. ⟨tel-02735749⟩
• 
  Aurélie Hurault, Philippe Quéinnec. Proving a Non-Blocking Algorithm for Process Renaming with TLA+. 13th International Conference on Tests and Proofs (TAP 2019), part of the 3rd World Congress on Formal Methods, Oct 2019, Porto, Portugal. pp.147-166. ⟨hal-02442015⟩

213