• 
  Étienne André, Johan Arcile, Engel Lefaucheux. Execution-time opacity problems in one-clock parametric timed automata. FSTTCS 2024, Dec 2024, Gandhinagar, India. ⟨hal-04732521⟩
• 
  Étienne André, Marie Duflot, Laetitia Laversa, Engel Lefaucheux. Execution-time opacity control for timed automata ⋆. SEFM 2024, Nov 2024, Aveiro (Portugal), Portugal. ⟨hal-04732493⟩
• 
  Étienne André, Didier Lime, Dylan Marinho, Jun Sun. Guaranteeing Timed Opacity using Parametric Timed Model Checking. ACM Transactions on Software Engineering and Methodology, 2022, 31 (4), pp.1-36. ⟨10.1145/3502851⟩. ⟨hal-03798157⟩
• 
  Étienne André, Shapagat Bolat, Engel Lefaucheux, Dylan Marinho. strategFTO: Untimed control for timed opacity. 8th International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS 2022), Cyrille Artho; Peter Ölveczky, Dec 2022, Auckland, New Zealand. pp.27-33, ⟨10.1145/3563822.3568013⟩. ⟨hal-03874435⟩
• 
  Sylvie Boldo, François Clément, David Hamelin, Micaela Mayero, Pierre Rousselin. Teaching Divisibility and Binomials with Coq. 13th International Workshop on Theorem proving components for Educational software, Jul 2024, Nancy, France. ⟨hal-04725586⟩
• 
  Chahan Vidal-Gorène, Nadi Tomeh, Victoria Khurshudyan. Cross-Dialectal Transfer and Zero-Shot Learning for Armenian Varieties: A Comparative Analysis of RNNs, Transformers and LLMs. 4th International Conference on Natural Language Processing for Digital Humanities, EMNLP 2024, Nov 2024, Miami, United States. ⟨hal-04722313⟩
• 
  Théophile Buffiere. Théorèmes combinatoires et probabilistes sur certaines familles de polytopes. Informatique [cs]. Université Paris-Nord - Paris XIII, 2023. Français. ⟨NNT : 2023PA131082⟩. ⟨tel-04720366⟩
• 
  Seyed Mohammad Reza Modaresi. Méta-décomposition et processus d'évaluation dans les applications d'apprentissage automatique. Artificial Intelligence [cs.AI]. Université Paris-Nord - Paris XIII, 2023. English. ⟨NNT : 2023PA131046⟩. ⟨tel-04718306⟩
• 
  Étienne André, Sarah Dépernet, Engel Lefaucheux. The Bright Side of Timed Opacity (extended version). ICFEM 2024, Dec 2024, Hiroshima, Japan. ⟨hal-04631012v3⟩
• 
  Damiano Mazza, Luc Pellissier, Pierre Vial. Polyadic approximations, fibrations and intersection types. Proceedings of the ACM on Programming Languages, 2017, 2 (POPL), pp.1-28. ⟨10.1145/3158094⟩. ⟨hal-04709336⟩
• 
  Frédérique Bassino, Cyril Nicaud, Pascal Weil. Random generation of subgroups of the modular group with a fixed isomorphism type. The Electronic Journal of Combinatorics, In press. ⟨hal-04695164⟩
• 
  Christophe Cerin, Mamadou Sow, Muhammad Sanaullah Kayani. Online Machine Learning for Embedded Systems (ESP32) Introduction with the Slides. Compas 2024 Conférence francophone d'informatique en Parallélisme, Architecture et Système, IETR (Institut d’Electronique et des Technologies du numéRique) et le LS2N (Laboratoire des Sciences du Numérique de Nantes) - Nantes Université, Jul 2024, Nantes, France. ⟨hal-04680048v2⟩
• 
  Axel Kerinec, Giulio Manzonetto, Federico Olimpieri. Why Are Proofs Relevant in Proof-Relevant Models?. POPL 2023, Jan 2023, Boston (Mass), United States. pp.218 - 248, ⟨10.1145/3571201⟩. ⟨hal-04676054⟩
• 
  Alexandre Dupont Bouillard. Co-k-plexes et coloration k-defective : polyèdres et algorithmes. Computer Science [cs]. Université Paris-Nord - Paris XIII, 2024. English. ⟨NNT : 2024PA131019⟩. ⟨tel-04672951⟩
• 
  Sebastian Altmeyer, Étienne André, Silvano Dal Zilio, Loïc Fejoz, Michael González Harbour, et al.. From FMTV to WATERS: Lessons Learned from the First Verification Challenge at ECRTS (Invited Paper). 35th Euromicro Conference on Real-Time Systems (ECRTS 2023), Jul 2023, Vienne, Austria. ⟨10.4230/LIPIcs.ECRTS.2023.19⟩. ⟨hal-04654624⟩
• 
  Damiano Mazza, Michele Pagani. The Separation Theorem for Differential Interaction Nets. 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2007), Oct 2007, Yerevan, Armenia. pp.393-407, ⟨10.1007/978-3-540-75560-9_29⟩. ⟨hal-04670297⟩
• 
  Giulio Manzonetto, Michele Pagani. Böhm’s Theorem for Resource Lambda Calculus through Taylor Expansion. 10th International Conference on Typed Lambda Calculi and Applications (TLCA 2011), 2011, Oxford, United Kingdom. pp.153-168, ⟨10.1007/978-3-642-21691-6_14⟩. ⟨hal-04670290⟩
• 
  Pierre Boudes, Fanny He, Michele Pagani. A characterization of the Taylor expansion of lambda-terms. 22nd EACSL Annual Conference Computer Science Logic (CSL 2013), EACSL, Sep 2013, Turin, Italy. pp.101-115, ⟨10.4230/LIPIcs.CSL.2013.101⟩. ⟨hal-04670289⟩
• 
  Thomas Ehrhard, Christine Tasson, Michele Pagani. Probabilistic coherence spaces are fully abstract for probabilistic PCF. The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '14), Jan 2014, San Diego, CA, United States. pp.309-320, ⟨10.1145/2535838.2535865⟩. ⟨hal-04670288⟩
• 
  Flavien Breuvart, Michele Pagani. Modelling Coeffects in the Relational Semantics of Linear Logic. 24th EACSL Annual Conference on Computer Science Logic (CSL 2015), EACSL, Sep 2015, Berlin, Germany. ⟨10.4230/LIPIcs.CSL.2015.567⟩. ⟨hal-04670088⟩

1 180

1 165