index - Laboratoire Méthodes Formelles

Ceci est un dépôt, hébergé par HAL (archives ouvertes), des publications du Laboratoire Méthodes Formelles (LMF).

Daniel Martin Xavier, Ludovic Chamoin, Laurent Fribourg. Training and Generalization Errors for Underparameterized Neural Networks. 2024 American Control Conference, Jul 2024, Toronto, Canada. ⟨hal-04423901v2⟩
Lélia Blin, Gabriel Le Bouder, Franck Petit. Optimal Memory Requirement for Self-Stabilizing Token Circulation. SIROCCO 2024, May 2024, Salerno, Italy. ⟨hal-04448960⟩
Daniel Martin Xavier, Ludovic Chamoin, Laurent Fribourg. Commande garantie pour le contrôle et la prévention de l'endommagement des structures. 16ème Colloque National en Calcul des Structures, May 2024, Giens (Var), France. ⟨hal-04423380⟩
Valentin Blot, Gilles Dowek, Thomas Traversié, Théo Winterhalter. From Rewrite Rules to Axioms in the λΠ-Calculus Modulo Theory. FoSSaCS 2024 - 27th International Conference on Foundations of Software Science and Computation Structures, Apr 2024, Luxembourg City, Luxembourg. pp.3-23, ⟨10.1007/978-3-031-57231-9_1⟩. ⟨hal-04275229v2⟩
Marc Baboulin, Simplice Donfack, Oguz Kaya, Theo Mary, Matthieu Robeyns. Mixed precision randomized low-rank approximation with GPU tensor cores. 2024. ⟨hal-04520893⟩
Nicolas Anciaux, Sabine Frittella, Baptiste Joffroy, Benjamin Nguyen, Guillaume Scerri. A new PET for Data Collection via Forms with Data Minimization, Full Accuracy and Informed Consent. 27th International Conference on Extending Database Technology, EDBT 2024, Mar 2024, Paestum, Italy. ⟨hal-04149000v2⟩
Gustave Cortal. Sequence-to-Sequence Language Models for Character and Emotion Detection in Dream Narratives. 2024. ⟨hal-04512803⟩
Yann Leray, Gaëtan Gilbert, Nicolas Tabareau, Théo Winterhalter. The Rewster: Type Preserving Rewrite Rules for the Coq Proof Assistant. 2024. ⟨hal-04511667⟩
Gustave Cortal. Automatisation du codage des personnages et de leurs émotions dans les récits de rêves avec des modèles de langue. Revue TAL : traitement automatique des langues, 2024, 65 (1), pp.11-35. ⟨hal-04512857⟩
Renaud Vilmart, Marc de Visme. Minimality in Finite-Dimensional ZW-Calculi. 2024. ⟨hal-04496193⟩
Denis Cousineau, Hiroaki Inoue, Claude Marché, David Mentré. A Methodological Guide for the Validation of Logic Modelling of Ladder Instructions. RT-0522, Inria. 2024. ⟨hal-04487766⟩
Théo Winterhalter. Dependent Ghosts Have a Reflection for Free. 2024. ⟨hal-04163836v2⟩
Baptiste Gueuziec, Jean-Pierre Gallois, Frédéric Boulanger. Qualitative Reasoning and Design Space Exploration. MODELSWARD 2024, INSTICC, Feb 2024, Rome, Italy. ⟨hal-04452208⟩
Thiago Felicissimo, Théo Winterhalter. Impredicativity, Cumulativity and Product Covariance in the Logical Framework Dedukti. 2024. ⟨hal-04470850⟩
Alexandre Clément, Noé Delorme, Simon Perdrix, Renaud Vilmart. Quantum Circuit Completeness: Extensions and Simplifications. International Conference on Computer Science Logic CSL 2024, Feb 2024, Naples, Italy. ⟨10.4230/LIPIcs.CSL.2024.20⟩. ⟨hal-04016498v3⟩
Florian Faissole, Paul Geneau de Lamarlière, Guillaume Melquiond. End-to-End Formal Verification of a Fast and Accurate Floating-Point Approximation. 2024. ⟨hal-04515714⟩
Claude Marché, Denis Cousineau. De l'avantage de nuancer les décisions binaires. JFLA 2024 – 35es Journées Francophones des Langages Applicatifs, Jan 2024, Saint-Jacut-de-la-Mer, France. ⟨hal-04342273v2⟩
François Pottier, Armaël Guéneau, Jacques-Henri Jourdan, Glen Mével. Thunks and Debits in Separation Logic with Time Credits. POPL 2024 - 51st ACM SIGPLAN Symposium on Principles of Programming Languages, SIGPLAN, Jan 2024, Londres, United Kingdom. ⟨hal-04238691v2⟩
Claude Stolze, Olivier Hermant, Romain Guillaumé. Towards Formalization and Sharing of Atelier B Proofs with Dedukti. 2024. ⟨hal-04398119⟩
Ugo Nzongani, Pablo Arnault. Adjustable-depth quantum circuit for position-dependent coin operators of discrete-time quantum walks. 2024. ⟨hal-04396459⟩
Philipp G Haselwarter, Benjamin Salling Hvass, Lasse Letager Hansen, Théo Winterhalter, Cătălin Hriţcu, et al.. The Last Yard: Foundational End-to-End Verification of High-Speed Cryptography. CPP 2024 - 13th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2024, London, United Kingdom. pp.30-44, ⟨10.1145/3636501.3636961⟩. ⟨hal-04484598⟩
Amin Timany, Armaël Guéneau, Lars Birkedal. The Logical Essence of Well-Bracketed Control Flow. POPL 2024 - 51st ACM SIGPLAN Symposium on Principles of Programming Languages, SIGPLAN, Jan 2024, Londres, United Kingdom. ⟨hal-04271457⟩
Gilles Dowek. La dynamique des noms propres. 2024. ⟨hal-04476056⟩
Renaud Vilmart. Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing. Logical Methods in Computer Science, 2024, 20 (1), ⟨10.46298/LMCS-20(1:20)2024⟩. ⟨hal-04496100⟩
Georges Aazan, Antoine Girard, Luca Greco, Paolo Mason. An Automata Theoretic Approach to Observer Design for Switched Linear Systems. 2024. ⟨hal-04503485⟩
Jean Goubault-Larrecq, Maurice Pouzet. A Few Characterizations of Topological Spaces with No Infinite Discrete Subspace. Topology and its Applications, 2024, 341, pp.108733. ⟨10.1016/j.topol.2023.108733⟩. ⟨hal-04230848⟩
Nathanaël Fijalkow (Dir.). Games on Graphs: From Logic and Automata to Algorithms. pp.1-491, In press, ⟨10.48550/arXiv.2305.10546⟩. ⟨hal-04273394⟩
Giuseppe Castagna, Mickaël Laurent, Kim Nguyen. Polymorphic Type Inference for Dynamic Languages: Reconstructing Types for Systems Combining Parametric, Ad-Hoc, and Subtyping Polymorphism. Proceedings of the ACM on Programming Languages, In press, 8 (POPL), pp.40. ⟨10.1145/3632882⟩. ⟨hal-04284072⟩
Cezar-Constantin Andrici, Ștefan Ciobâcă, Cătălin Hriţcu, Guido Martínez, Exequiel Rivas, et al.. Securing Verified IO Programs Against Unverified Code in F*. Proceedings of the ACM on Programming Languages, 2024, 8 (POPL), pp.2226-2259. ⟨10.1145/3632916⟩. ⟨hal-04484770⟩
Anas Makdesi, Antoine Girard, Laurent Fribourg. Data-Driven Models of Monotone Systems. IEEE Transactions on Automatic Control, In press, ⟨10.1109/TAC.2023.3346793⟩. ⟨hal-03709123v2⟩
Xavier Denis. Vérification déductive de programmes Rust. Programming Languages [cs.PL]. Université Paris-Saclay, 2023. English. ⟨NNT : 2023UPASG101⟩. ⟨tel-04517581⟩
Antoine Lanco. Stratégies pour la réduction forte. Informatique et langage [cs.CL]. Université Paris-Saclay, 2023. Français. ⟨NNT : 2023UPASG097⟩. ⟨tel-04512443⟩
Alexandrina Korneva. The Cubicle Fuzzy Loop : A Testing Framework for Cubicle. Logic in Computer Science [cs.LO]. Université Paris-Saclay, 2023. English. ⟨NNT : 2023UPASG095⟩. ⟨tel-04505645⟩
Paul Bonnot, Benoît Boyer, Florian Faissole, Claude Marché, Raphaël Rieu-Helft. Formally Verified Bounds on Rounding Errors in Concrete Implementations of Logarithm-Sum-Exponential Functions. RR-9531, Inria. 2023. ⟨hal-04343157v2⟩
Yoan Géran. Encoding impredicative hierarchy of type universes with variables. 2023. ⟨hal-04311936⟩
Daniel Martin Xavier, Ludovic Chamoin, Laurent Fribourg. Data-driven MPC applied to non-linear systems for real-time applications. Modélisation des Systèmes Réactifs (MSR'23), Nov 2023, Toulouse, France. ⟨hal-04423239⟩
Daniel Martin Xavier, Ludovic Chamoin, Laurent Fribourg. Data-driven MPC applied to non-linear systems for real-time applications. Modélisation des Systèmes Réactifs (MSR'23), CNRS, Nov 2023, Toulouse, France. ⟨hal-04465225⟩
Baptiste Gueuziec, Jean-Pierre Gallois, Frédéric Boulanger. Abstraction qualitative et surveillance de systèmes cyber-physiques. Modélisation des Systèmes Réactifs, Nov 2023, Toulouse, France. ⟨hal-04255640⟩
Nick Würdemann, Thomas Chatain, Stefan Haar, Lukas Panneke. Taking Complete Finite Prefixes To High Level, Symbolically. 2023. ⟨hal-04297773⟩
Roman Kniazev. On geometric models of epistemic logic. Computer Science [cs]. Institut Polytechnique de Paris, 2023. English. ⟨NNT : 2023IPPAX132⟩. ⟨tel-04534589⟩
Isa Vialard. On the width of the cartesian product of ordinals. 2023. ⟨hal-04287427⟩
Sylvain Conchon, Alexandrina Korneva. The Cubicle Fuzzy Loop: A Fuzzing-Based Extension for the Cubicle Model Checker. SEFM 2023 - Software Engineering and Formal Methods, Nov 2023, Eindhoven, Netherlands. pp.30-46, ⟨10.1007/978-3-031-47115-5_3⟩. ⟨hal-04394062v2⟩
Thiago Felicissimo. Generic bidirectional typing for dependent type theories. 2023. ⟨hal-04270368⟩
Anas Makdesi, Antoine Girard, Laurent Fribourg. Safe Learning-Based Model Predictive Control Using The Compatible Models Approach. European Journal of Control, 2023, 74, pp.100849. ⟨10.1016/j.ejcon.2023.100849⟩. ⟨hal-04134216⟩
Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Xuan Xie, Benoît Barbot, et al.. Analysis of recurrent neural networks via property-directed verification of surrogate models. International Journal on Software Tools for Technology Transfer, 2023, 25 (3), pp.341-354. ⟨10.1007/S10009-022-00684-W⟩. ⟨hal-04286080⟩
Georges Aazan. Stability of constrained switched systems driven by ω-regular languages. Dynamical Systems [math.DS]. Université Paris-Saclay, 2023. English. ⟨NNT : 2023UPAST137⟩. ⟨tel-04316024⟩
Armaël Guéneau, Johannes Hostert, Simon Spies, Michael Sammler, Lars Birkedal, et al.. Melocoton: A Program Logic for Verified Interoperability Between OCaml and C. OOPSLA 2023 - Object-Oriented Programming, Systems, Languages & Applications 2023, SIGPLAN, Oct 2023, Cascais, Portugal. ⟨10.1145/3622823⟩. ⟨hal-04203298v2⟩
Alain Finkel, Serge Haddad, Lina Ye. Introducing Divergence for Infinite Probabilistic Models. RP 2023 - 17th International Conference on Reachability Problems, Oct 2023, Nice, France. pp.127-140, ⟨10.1007/978-3-031-45286-4_10⟩. ⟨hal-04271224⟩
Hagit Attiya, Armando Castañeda, Thomas Nowak. Topological Characterization of Task Solvability in General Models of Computation. 37th International Symposium on Distributed Computing (DISC 2023), European Association for Theoretical Computer Science, Oct 2023, L'Aquila, Italy. ⟨10.4230/LIPIcs.DISC.2023.5⟩. ⟨hal-04230650⟩
Baptiste Gueuziec, Jean-Pierre Gallois, Frédéric Boulanger. Qualitative reasoning and cyber-physical systems: abstraction, modeling, and optimized simulation. MoDeVVa 2023 - 20th workshop on model driven engineering, verification and validation, Oct 2023, Västerås [Sweden], Sweden. ⟨hal-04188239⟩
Baptiste Gueuziec, Frédéric Boulanger, Jean-Pierre Gallois. Qualitative tendencies for hybrid system simulation. MPM4CPS 2023 - Multi-Paradigm Modelling for Cyber-Physical Systems -26th International conference on model driven engineering languages and systems, Oct 2023, Västerås, Sweden. ⟨hal-04188249⟩
Josué Moreau, Guillaume Melquiond. A Safe Low-level Language for Computer Algebra and its Formally Verified Compiler. 2023. ⟨hal-04485670⟩
Philipp Haselwarter, Exequiel Rivas, Antoine van Muylder, Théo Winterhalter, Carmine Abate, et al.. SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq. ACM Transactions on Programming Languages and Systems (TOPLAS), 2023, 45 (3), pp.1-61. ⟨10.1145/3594735⟩. ⟨hal-04273257⟩
Stéphane Demri, Karin Quaas. First Steps Towards Taming Description Logics with Strings. 18th Edition of the European Conference on Logics in Artificial Intelligence (JELIA'23), Sep 2023, Dresden (GERMANY), Germany. pp.322--337. ⟨hal-04212642⟩
Valentin Fouillard, Nicolas Sabouret, Safouan Taha, Frédéric Boulanger. An incremental diagnosis algorithm of human erroneous decision making. 2nd International Conference on Human and Artificial Rationalities, Sep 2023, Paris, France. ⟨hal-04188221⟩
Raghda El Shehaby, Matthias Függer, Andreas Steininger. On the Susceptibility of QDI Circuits to Transient Faults. FORMATS 2023 - International Conference on Formal Modeling and Analysis of Timed Systems, Sep 2023, Antwerp, Belgium. pp.69-85, ⟨10.1007/978-3-031-42626-1_5⟩. ⟨hal-04266002⟩
Stéphane Demri, Karin Quaas. Constraint Automata on Infinite Data Trees: from CTL(ℤ)/ CTL*(ℤ) to Decision Procedures. 34th International Conference on Concurrency Theory (CONCUR 2023), Sep 2023, Antwerp, Belgium. ⟨10.4230/LIPIcs.CONCUR.2023.29⟩. ⟨hal-04201369⟩
Érik Martin-Dorel, Guillaume Melquiond, Pierre Roux. Enabling Floating-Point Arithmetic in the Coq Proof Assistant. Journal of Automated Reasoning, 2023, 67 (33), ⟨10.1007/s10817-023-09679-x⟩. ⟨hal-04114233v2⟩
Aïna Linn Georges, Armaël Guéneau, Thomas Van Strydonck, Amin Timany, Alix Trieu, et al.. Cerise: Program Verification on a Capability Machine in the Presence of Untrusted Code. Journal of the ACM (JACM), 2023, ⟨10.1145/3623510⟩. ⟨hal-03826854v3⟩
Andrei Paskevich. Flexible Verification Conditions with Continuations and Barriers. 2023. ⟨hal-04115885v3⟩
Aliaume Lopez. First Order Preservation Theorems in Finite Model Theory : Locality, Topology, and Limit Constructions. Computer Science [cs]. Université Paris-Saclay, 2023. English. ⟨NNT : 2023UPASG046⟩. ⟨tel-04534568⟩
Pablo Arrighi, Di Molfetta Giuseppe, Iván Márquez-Martín, Armando Pérez. Dirac equation as a quantum walk over the honeycomb and triangular lattices. 2023. ⟨hal-03594743⟩
Paul Geneau de Lamarlière, Guillaume Melquiond, Florian Faissole. Slimmer Formal Proofs for Mathematical Libraries. 30th IEEE International Symposium on Computer Arithmetic, Sep 2023, Portland (Oregon), United States. pp.4. ⟨hal-04165169⟩
Stéphane Demri, Raine Rönnholm. How to Manage a Budget with ATL+. 20th International Conference on Principles of Knowledge Representation and Reasoning (KR’23), Sep 2023, Rhodes, Greece. pp.188-197, ⟨10.24963/kr.2023/19⟩. ⟨hal-04159432⟩
Léo Andrès, Pierre Chambart, Jean-Christophe Filliâtre. Wasocaml: compiling OCaml to WebAssembly. IFL 2023 - The 35th Symposium on Implementation and Application of Functional Languages, João Saraiva; João Fernandes, Aug 2023, Braga, Portugal. ⟨hal-04311345v2⟩
Isa Vialard. Ordinal measures of the set of finite multisets. MFCS 2023, Aug 2023, Bordeaux, France. ⟨10.4230/LIPIcs⟩. ⟨hal-04287405⟩
Anne-Catherine de la Hamette, Viktoria Kabel, Esteban Castro-Ruiz, Časlav Brukner. Quantum reference frames for an indefinite metric. Communications Physics, 2023, 6 (1), pp.231. ⟨10.1038/s42005-023-01344-4⟩. ⟨hal-04385231⟩
Jean Goubault-Larrecq, Xiaodong Jia, Clément Théron. A Domain-Theoretic Approach to Statistical Programming Languages. Journal of the ACM (JACM), 2023, ⟨10.1145/3611660⟩. ⟨hal-04183840⟩
Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, et al.. Reasoning about Quality and Fuzziness of Strategic Behaviors. ACM Transactions on Computational Logic, 2023, 24 (3), pp.1-38. ⟨10.1145/3582498⟩. ⟨hal-04219131⟩
Amélie Ledein, Valentin Blot, Catherine Dubois. A semantics of K into dedukti. TYPES 2022 - 28th International Conference on Types for Proofs and Programs (TYPES), Jul 2023, Nantes, France. ⟨10.4230/LIPIcs.TYPES.2022.23⟩. ⟨hal-03895834v2⟩
Pablo Arrighi, Amélia Durbec, Pierre Guillon. Graph Subshifts. CiE 2023 - 19th Conference on Computability in Europe, Jul 2023, Batumi, Georgia. pp.261-274, ⟨10.1007/978-3-031-36978-0_21⟩. ⟨hal-04310695⟩
S Akshay, Paul Gastin, R Govind, Aniruddha R Joshi, B Srivathsan. A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation. 35th International Conference on Computer Aided Verification - CAV 2023, Jul 2023, Paris, France. pp.266 - 288, ⟨10.1007/978-3-031-37706-8_14⟩. ⟨hal-04257510⟩
Rébecca Zucchini. Bibliothèque certifiée en Coq pour la provenance des données. Logique en informatique [cs.LO]. Université Paris-Saclay, 2023. Français. ⟨NNT : 2023UPASG040⟩. ⟨tel-04165484⟩
Gustave Cortal, Alain Finkel, Patrick Paroubek, Lina Ye. Automatisation du codage des récits de rêve : une approche basée sur la génération de paraphrases. Affects, Compagnons Artificiels et Interactions, Jul 2023, Strasbourg, France. ⟨hal-04269424⟩
Valentin Blot. Diller-Nahm Bar Recursion. FSCD 2023 - 8th International Conference on Formal Structures for Computation and Deduction, Jul 2023, Rome, Italy. pp.32:1-32:16, ⟨10.4230/LIPIcs.FSCD.2023.32⟩. ⟨hal-04144888⟩
Titouan Carette, Etienne Moutot, Thomas Perez, Renaud Vilmart. Compositionality of planar perfect matchings: A universal and complete fragment of ZW-calculus. 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), Jul 2023, Paderborn, Germany. pp.120:1--120:17, ⟨10.4230/LIPIcs.ICALP.2023.120⟩. ⟨hal-04002282⟩
Jawher Jerray, Laurent Fribourg. Proving the Convergence to Limit Cycles using Periodically Decreasing Jacobian Matrix Measures. 2023. ⟨hal-04142766⟩
Thomas Colcombet, Gaëtan Douéneau-Tabot, Aliaume Lopez. Z-polyregular functions. 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), IEEE, Jun 2023, Boston, United States. ⟨10.1109/LICS56636.2023.10175685⟩. ⟨hal-04324059⟩
Éric Goubault, Roman Kniazev, Jérémy Ledent, Sergio Rajsbaum. Semi-Simplicial Set Models for Distributed Knowledge. Logic in Computer Science, Jun 2023, Boston (MA), United States. ⟨10.1109/lics56636.2023.10175737⟩. ⟨hal-04336328⟩
Titouan Carette, Louis Lemonnier, Vladimir Zamdzhiev. Central Submonads and Notions of Computation: Soundness, Completeness and Internal Languages. 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2023, Boston (MA), United States. ⟨10.1109/LICS56636.2023.10175687⟩. ⟨hal-03662565v4⟩
Alexandre Clément, Nicolas Heurtel, Shane Mansfield, Simon Perdrix, Benoît Valiron. A Complete Equational Theory for Quantum Circuits. 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2023, Boston, United States. pp.1-13, ⟨10.1109/LICS56636.2023.10175801⟩. ⟨hal-03926757⟩
Gaëtan Gilbert, Yann Leray, Nicolas Tabareau, Théo Winterhalter. The Rewster: The Coq Proof Assistant with Rewrite Rules. TYPES 2023 - 29th International Conference on Types for Proofs and Programs, Jun 2023, Valencia, Spain. pp.1-3. ⟨hal-04403667⟩
Philippe Schnoebelen, Julien Veron. On Arch Factorization and Subword Universality for Words and Compressed Words. 14th International Conference Combinatorics on Words (WORDS 2023), Jun 2023, Umea, Sweden. pp.274-287, ⟨10.1007/978-3-031-33180-0_21⟩. ⟨hal-04287016⟩
Assia Mahboubi, Guillaume Melquiond. Manifest Termination. TYPES 2023 - 29th International Conference on Types for Proofs and Programs, Jun 2023, Valencia, Spain. pp.1-3. ⟨hal-04172297⟩
Daniel Martin Xavier, Ludovic Chamoin, Laurent Fribourg. Contrôle en ligne garantissant la sûreté de fonctionnement de structures en mode dégradé. 1er Congrès Annuel de la Société Française d'Automatique, de Génie Industriel et de Productique, SAGIP, Jun 2023, Marseille, France. ⟨hal-04406026⟩
Haniel Barbosa, Chantal Keller, Andrew Reynolds, Arjun Viswanathan, Cesare Tinelli, et al.. An Interactive SMT Tactic in Coq using Abductive Reasoning. 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Jun 2023, Manizales, Colombia. pp.11-22, ⟨10.29007/432m⟩. ⟨hal-04287029⟩
Titouan Carette, Timothée Hoffreumon, Émile Larroque, Renaud Vilmart. Complete Graphical Language for Hermiticity-Preserving Superoperators. 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) 2023, Jun 2023, Boston, United States. pp.1-22, ⟨10.1109/LICS56636.2023.10175712⟩. ⟨hal-04001823⟩
Nachum Dershowitz, Jean-Pierre Jouannaud, Fernando Orejas. Drag Rewriting. 2023. ⟨hal-04143346v3⟩
Gustave Cortal, Alain Finkel, Patrick Paroubek, Lina Ye. Emotion Recognition based on Psychological Components in Guided Narratives for Emotion Regulation. LaTeCH-CLfL2023, 7th Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature, Association for Computational Linguistics, May 2023, Dubrovnik, Croatia. pp.72-81, ⟨10.18653/v1/2023.latechclfl-1.8⟩. ⟨hal-04094814⟩
Sylvie Boldo, Claude-Pierre Jeannerod, Guillaume Melquiond, Jean-Michel Muller. Floating-point arithmetic. Acta Numerica, 2023, 32, pp.203-290. ⟨10.1017/S0962492922000101⟩. ⟨hal-04095151⟩
Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti. On Composing Finite Forests with Modal Logics. ACM Transactions on Computational Logic, 2023, 24 (2), pp.1-46. ⟨10.1145/3569954⟩. ⟨hal-04056877⟩
Pierre Vandenhove. Strategy complexity of zero-sum games on graphs. Computer Science and Game Theory [cs.GT]. Université Paris-Saclay; Université de Mons, 2023. English. ⟨NNT : 2023UPASG029⟩. ⟨tel-04095220⟩
Aliaume Lopez. Fixed Points and Noetherian Topologies. FoSSaCS, Apr 2023, Paris, France. pp.456-476, ⟨10.1007/978-3-031-30829-1_22⟩. ⟨hal-04284124⟩
Xavier Denis, Jacques-Henri Jourdan. Specifying and Verifying Higher-order Rust Iterators. Tools and Algorithms for the Construction and Analysis of Systems (TACAS), ETAPS, Apr 2023, Paris, France. pp.93-110, ⟨10.1007/978-3-031-30820-8_9⟩. ⟨hal-03827702v2⟩
Matthieu Sozeau, Yannick Forster, Meven Lennon-Bertrand, Jakob Botsch Nielsen, Nicolas Tabareau, et al.. Correct and Complete Type Checking and Certified Erasure for Coq, in Coq. 2023. ⟨hal-04077552⟩
Thomas Colcombet, Gaëtan Douéneau-Tabot, Aliaume Lopez. Z-polyregular functions. 2023. ⟨hal-04097227⟩
Jean-Christophe Filliâtre. Why3, une plateforme pour la vérification déductive. Journées FAC 2023, groupe IFSE du RTRA STAE, Apr 2023, Toulouse, France. ⟨hal-04060570⟩
Jean-Christophe Filliâtre. Structures de données semi-persistantes. Doctorat. Séminaire du cours Structures de données persistantes (Xavier Leroy, chaire Sciences du logiciel), Collège de France, France. 2023. ⟨hal-04055882⟩
Nick Würdemann, Thomas Chatain, Stefan Haar. Taking Complete Finite Prefixes To High Level, Symbolically (Full Version). Petri Nets 2023 - 44TH International Conference on Applications and Theory of Petri Nets and Concurrency, R&D Group on Reconfigurable and Embedded Systems at NOVA School of Science and Technology, Mar 2023, Caparica (Lisbonne), Portugal. ⟨hal-04029490⟩
Sylvie Boldo, François Clément, Vincent Martin, Micaela Mayero, Houda Mouhcine. A Coq Formalization of Lebesgue Induction Principle and Tonelli's Theorem. 25th International Symposium on Formal Methods (FM 2023), Mar 2023, Lübeck, Germany. pp.39--55, ⟨10.1007/978-3-031-27481-7_4⟩. ⟨hal-03889276v2⟩
Thibaut Balabonski, Antoine Lanco, Guillaume Melquiond. A strong call-by-need calculus. Logical Methods in Computer Science, 2023, 19 (1), pp.39. ⟨10.46298/lmcs-19(1:21)2023⟩. ⟨hal-03409681v3⟩
Guillaume Melquiond, Raphaël Rieu-Helft. WhyMP, a Formally Verified Arbitrary-Precision Integer Library. Journal of Symbolic Computation, 2023, 115, pp.74-95. ⟨10.1016/j.jsc.2022.07.007⟩. ⟨hal-03233220⟩
Nicolas Heurtel, Andreas Fyrillas, Grégoire De Gliniasty, Raphaël Le Bihan, Sébastien Malherbe, et al.. Perceval: A Software Platform for Discrete Variable Photonic Quantum Computing. Quantum, 2023, 7, pp.931. ⟨10.22331/q-2023-02-21-931⟩. ⟨hal-03874624⟩
Frédéric Blanqui, Gilles Dowek, Emilie Grienenberger, Gabriel Hondet, François Thiré. A modular construction of type theories. Logical Methods in Computer Science, 2023, 19 (1), ⟨10.46298/lmcs-19(1:12)2023⟩. ⟨hal-04317047⟩
Kostia Chardonnet, Alexis Saurin, Benoît Valiron. A Curry-Howard Correspondence for Linear, Reversible Computation. CSL 2023 - 31st EACSL Annual Conference on Computer Science Logic, Bartek Klin and Elaine Pimentel, Feb 2023, Varsovie (Warsaw), Poland. ⟨10.4230/LIPIcs.CSL.2023.13⟩. ⟨hal-04308283⟩
Renaud Vilmart. Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Fragments of Quantum Computation. CSL 2023 - 31st EACSL Annual Conference on Computer Science Logic, Feb 2023, Warsaw, Poland. pp.36:1--36:17, ⟨10.4230/LIPIcs.CSL.2023.36⟩. ⟨hal-03654438v2⟩
Stéphane Demri, Raul Fervari. Model-Checking for Ability-Based Logics with Constrained Plans. 37th AAAI Conference on Artificial Intelligence (AAAI-23), AAAI, Feb 2023, Washignton DC, United States. ⟨hal-03997096⟩
Jean-Pierre Jouannaud, Fernando Orejas. Unification of Drags and Confluence of Drag Rewriting. Journal of Logical and Algebraic Methods in Programming, 2023, 131, pp.26. ⟨10.1016/j.jlamp.2022.100845⟩. ⟨hal-02562152v5⟩
Évelyne Contejean, Andrei Samokish. Formal proofs applied to system models. JFLA 2023 - 34èmes Journées Francophones des Langages Applicatifs, Jan 2023, Praz-sur-Arly, France. pp.121-133. ⟨hal-03936894v2⟩
Louise Dubois de Prisque. Décision de relations inductives pour SMTCoq : Démonstration d'un prototype. JFLA 2023 - 34èmes Journées Francophones des Langages Applicatifs, Jan 2023, Praz-sur-Arly, France. pp.288--290. ⟨hal-04000669⟩
Amélie Ledein, Elliot Butte. Traduire l'univers des mathématiques en Dedukti, sans univers. JFLA 2023 - 34èmes Journées Francophones des Langages Applicatifs, Jan 2023, Praz-sur-Arly, France. pp.172-189. ⟨hal-03936696⟩
Jean-Christophe Filliâtre, Andrei Paskevich. L'arithmétique de séparation. JFLA 2023 - 34èmes Journées Francophones des Langages Applicatifs, Jan 2023, Praz-sur-Arly, France. pp.274-283. ⟨hal-03886759v2⟩
Frédéric Blanqui, Anne Canteaut, Hidde de Jong, Sébastien Imperiale, Nathalie Mitton, et al.. Recommandations sur les « éditeurs de la zone grise ». Inria. 2023, pp.1-3. ⟨hal-04001505⟩
Gustave Cortal, Alain Finkel, Patrick Paroubek, Lina Ye. Détection de l'émotion à partir de ses composantes dans des récits émotionnels. Extraction et Gestion des Connaissances, Jan 2023, Lyon, France. ⟨hal-04269398⟩
Valentin Blot, Denis Cousineau, Enzo Crance, Louise Dubois de Prisque, Chantal Keller, et al.. Compositional pre-processing for automated reasoning in dependent type theory. CPP 2023 - Certified Programs and Proofs, Jan 2023, Boston, United States. pp.1-15, ⟨10.1145/3573105.3575676⟩. ⟨hal-03901019v3⟩
Agustín Borgna. Towards a formal compilation stack-frame in quantum computing. Computer Science [cs]. Université de Lorraine, 2023. English. ⟨NNT : 2023LORR0016⟩. ⟨tel-04102354⟩
Sylvie Boldo, François Clément, Vincent Martin, Micaela Mayero, Houda Mouhcine. Lebesgue Induction and Tonelli's Theorem in Coq. [Research Report] RR-9457, Institut National de Recherche en Informatique et en Automatique (INRIA). 2023, pp.17. ⟨hal-03564379v2⟩
Kostia Chardonnet. Towards a Curry-Howard Correspondence for Quantum Computation. Logic in Computer Science [cs.LO]. Université Paris-Saclay, 2023. English. ⟨NNT : 2023UPASG005⟩. ⟨tel-03959403⟩
Christophe Chareton, Sébastien Bardin, Dong Ho Lee, Benoît Valiron, Renaud Vilmart, et al.. Formal Methods for Quantum Algorithms. Handbook of Formal Analysis and Verification in Cryptography, CRC Press; Taylor and Francis, pp.319-422, 2023, Prospect in Pure and Applied Mathematics, 9780367546656. ⟨cea-04479879⟩
Jean Goubault-Larrecq, Bastien Laboureix. Statures and Sobrification Ranks of Noetherian Spaces. Houston Journal of Mathematics, In press, 49 (1), pp.1-76. ⟨10.48550/arXiv.2112.06828⟩. ⟨hal-04138338⟩
Jean Goubault-Larrecq. Kantorovich-Rubinstein Quasi-Metrics IV: Lenses, Quasi-Lenses and Forks. Topology and its Applications, 2023, 332, pp.108513. ⟨10.1016/j.topol.2023.108513⟩. ⟨hal-03911034⟩
Jean Goubault-Larrecq, Xiaodong Jia. Continuous R-valuations. Electronic Notes in Theoretical Informatics and Computer Science, In press, 2, ⟨10.46298/entics.proceedings.isdt9⟩. ⟨hal-04029481⟩
Thiago Felicissimo, Frédéric Blanqui, Ashish Kumar Barnawal. Translating proofs from an impredicative type system to a predicative one. 31st EACSL Annual Conference on Computer Science Logic (CSL 2023), 2023, Warsaw, Poland. ⟨10.4230/LIPIcs.CSL.2023.19⟩. ⟨hal-03848584v2⟩
Alejandro Díaz-Caro, Gilles Dowek. A New Connective in Natural Deduction, and its Application to Quantum Computing. Theoretical Computer Science, 2023, 957, pp.113840. ⟨10.1016/j.tcs.2023.113840⟩. ⟨hal-04398691⟩
Gilles Dowek. Explanation: from ethics to logic. Annals of the Japan Association for Philosophy of Science, 2023, 32, pp.16. ⟨hal-04055141v5⟩
Daniel Martin Xavier, Ludovic Chamoin, Laurent Fribourg. Training and Generalization Errors for Underparameterized Neural Networks. IEEE Control Systems Letters, 2023, 7, pp.3926 - 3931. ⟨10.1109/LCSYS.2023.3344139⟩. ⟨hal-04357356⟩
Jean Goubault-Larrecq, Simon Halfon, Aliaume Lopez. Infinitary Noetherian Constructions II. Transfinite Words and the Regular Subword Topology. Colloquium Mathematicum, 2023, 173 (2), pp.227-250. ⟨10.4064/cm8793-3-2023⟩. ⟨hal-04283731⟩
Patricia Bouyer, Mickael Randour, Pierre Vandenhove. The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs (Invited Talk). FSTTCS'22, Dec 2022, Chennai (India), France. pp.3:1--3:18, ⟨10.4230/LIPIcs.FSTTCS.2022.3⟩. ⟨hal-04236273⟩
Glen Mével. A mechanized program logic for concurrent programs with the weak memory model of Multicore OCaml. Other [cs.OH]. Université Paris Cité, 2022. English. ⟨NNT : 2022UNIP7173⟩. ⟨tel-04356627⟩
Mathieu Hilaire. Parity games and reachability in infinite-state systems with parameters. Computational Complexity [cs.CC]. Université Paris-Saclay, 2022. English. ⟨NNT : 2022UPASG095⟩. ⟨tel-03964912⟩
Amrita Suresh. Formal Verification of Communicating Automata. Logic in Computer Science [cs.LO]. Université Paris-Saclay, 2022. English. ⟨NNT : 2022UPASG092⟩. ⟨tel-04047037⟩
Valentin Fouillard. La logique des incohérences : un modèle formel pour l'analyse de l'erreur humaine. Intelligence artificielle [cs.AI]. Université Paris-Saclay, 2022. Français. ⟨NNT : 2022UPASG082⟩. ⟨tel-03999313⟩
Thibault Fredon, Julien Zylberman, Pablo Arnault, Fabrice Debbasch. Quantum Spatial Search with Electric Potential: Long-Time Dynamics and Robustness to Noise. Entropy, 2022, 24 (12), pp.1778. ⟨10.3390/e24121778⟩. ⟨hal-03938500⟩
Kevissen Sellapillay, Pablo Arrighi, Di Molfetta Giuseppe. A discrete relativistic spacetime formalism for 1 + 1-QED with continuum limits. Scientific Reports, 2022, 12 (1), pp.2198. ⟨10.1038/s41598-022-06241-4⟩. ⟨hal-03594721⟩
Béatrice Bérard, Benedikt Bollig, Patricia Bouyer, Matthias Függer, Nathalie Sznajder. Synthesis in presence of dynamic links. Information and Computation, 2022, 289 (Part B), pp.104856. ⟨10.1016/j.ic.2021.104856⟩. ⟨hal-03518879⟩
Neha Rino, Thomas Chatain. Timed Alignments with Mixed Moves. 2022. ⟨hal-03831470⟩
Xavier Denis, Jacques-Henri Jourdan, Claude Marché. Creusot: a Foundry for the Deductive Verification of Rust Programs. ICFEM 2022 - 23th International Conference on Formal Engineering Methods, Oct 2022, Madrid, Spain. ⟨hal-03737878⟩
Thomas Chatain, Neha Rino. Timed Alignments. 2022 4th International Conference on Process Mining (ICPM), Oct 2022, Bolzano, Italy. pp.112-119, ⟨10.1109/ICPM57379.2022.9980687⟩. ⟨hal-03703712⟩
Guillaume Girol. Robust reachability and model counting for software security. Cryptography and Security [cs.CR]. Université Paris-Saclay, 2022. English. ⟨NNT : 2022UPASG071⟩. ⟨tel-03865452⟩
Josué Moreau. Compilation formellement vérifiée d'un langage pour le calcul formel. 2022. ⟨hal-03824148⟩
Jean-Christophe Filliâtre, Clément Pascutto. Optimizing Prestate Copies in Runtime Verification of Function Postconditions. RV 2022 - 22nd International Conference on Runtime Verification, Sep 2022, Tbilisi, Georgia. ⟨hal-03690675v2⟩
Gabriel Hondet. Expressing predicate subtyping in computational logical frameworks. Logic in Computer Science [cs.LO]. Université Paris-Saclay, 2022. English. ⟨NNT : 2022UPASG070⟩. ⟨tel-03855351⟩
Giann Karlo Aguirre-Samboní, Stefan Haar, Loïc Paulevé, Stefan Schwoon, Nick Würdemann. Avoid One's Doom: Finding Cliff-Edge Configurations in Petri Nets. GandALF 2022 - Games, Automata, Logics, and Formal Verification, Sep 2022, Madrid, Spain. ⟨10.4204/EPTCS.370.12⟩. ⟨hal-03773855⟩
Igor Khmelnitsky, Serge Haddad, Lina Ye, Benoît Barbot, Benedikt Bollig, et al.. Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise. GandALF 2022 - 13th International Symposium on Games, Automata, Logics and Formal Verification, Sep 2022, Madrid, Spain. pp.81-96, ⟨10.4204/EPTCS.370.6⟩. ⟨hal-03794320⟩
Fabricio Cravo, Matthias Függer, Thomas Nowak, Gayathri Prakash. MobsPy: A Meta-species Language for Chemical Reaction Networks. CMSB 2022 - International Conference on Computational Methods in Systems Biology, Sep 2022, Bucharest, Romania. pp.277-285, ⟨10.1007/978-3-031-15034-0_14⟩. ⟨hal-03876041⟩
Lulu He, Philippe Dague, Lina Ye. Using Delay Blocks to Make Non-Diagnosable Discrete Event Systems Diagnosable. DX 2022 - 33rd International Workshop on Principle of Diagnosis, LAAS-CNRS-ANITI, Sep 2022, Toulouse, France. ⟨hal-03773712⟩
S. Akshay, Paul Gastin, R. Govind, B. Srivathsan. Simulations for Event-Clock Automata. 33rd International Conference on Concurrency Theory (CONCUR 2022), Sep 2022, Varsovie, Poland. pp.13, ⟨10.4230/LIPIcs.CONCUR.2022.13⟩. ⟨hal-03772227⟩
Gustave Cortal, Alain Finkel, Patrick Paroubek, Lina Ye. Natural Language Processing for Cognitive Analysis of Emotions. Semantics, Memory, and Emotion 2022, Sep 2022, Paris, France. ⟨hal-03805702⟩
Gustave Cortal, Alain Finkel, Patrick Paroubek, Lina Ye. Natural Language Processing for Cognitive Analysis of Emotions. EMPG - Meeting of the EUROPEAN MATHEMATICAL PSYCHOLOGY GROUP 2022, Sep 2022, Rovereto, Italy. ⟨hal-03805768⟩
Georges Aazan, Antoine Girard, Luca Greco, Paolo Mason. Stability of Shuffled Switched Linear Systems: A Joint Spectral Radius Approach. Automatica, 2022, 143, pp.110434. ⟨10.1016/j.automatica.2022.110434⟩. ⟨hal-03257026v3⟩
Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil. Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages. 33rd International Conference on Concurrency Theory (CONCUR 2022), Sep 2022, Warszawa, Poland. pp.28:1-28:19, ⟨10.4230/LIPIcs.CONCUR.2022.28⟩. ⟨hal-03770358⟩
Jean Goubault-Larrecq. Kantorovich-Rubinstein Quasi-Metrics III: Spaces of Sublinear and Superlinear Previsions. Topology and its Applications, 2022, pp.108259. ⟨10.1016/j.topol.2022.108259⟩. ⟨hal-03787192⟩
Gilles Dowek. Proofs in theories. Master. France. 2022, pp.154. ⟨hal-04057037⟩
Amit Pathania, Corbin Hopper, Amir Pandi, Matthias Függer, Thomas Nowak, et al.. A synthetic communication system uncovers extracellular immunity that self-limits bacteriophage transmission. 2022. ⟨hal-03670575v2⟩
Kostia Chardonnet, Alexis Saurin, Benoît Valiron. A Curry-Howard Correspondence for Linear, Reversible Computation. 2022. ⟨hal-03747425⟩
Gilles Dowek. From the Universality of Mathematical Truth to the Interoperability of Proof Systems. IJCAR 2022 - International Joint Conference on Automated Reasoning, Aug 2022, Haifa, Israel. ⟨10.1007/978-3-031-10769-6_2⟩. ⟨hal-03959359⟩
Thomas Van Strydonck, Aïna Linn Georges, Armaël Guéneau, Alix Trieu, Amin Timany, et al.. Proving full-system security properties under multiple attacker models on capability machines. CSF 2022 - 35th IEEE Computer Security Foundations Symposium, Aug 2022, Haifa, Israel. ⟨hal-03826851⟩
Benjamin Bordais, Damien Busatto-Gaston, Shibashis Guha, Jean-François Raskin. Strategy Synthesis for Global Window PCTL. 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), Aug 2022, Paris, France. pp.115:1--115:20, ⟨10.4230/LIPIcs.ICALP.2022.115⟩. ⟨hal-04442282⟩
Kostia Chardonnet, Marc de Visme, Benoît Valiron, Renaud Vilmart. The Many-Worlds Calculus. 2022. ⟨hal-03654190v2⟩
Thiago Felicissimo. Adequate and Computational Encodings in the Logical Framework Dedukti. FSCD 2022 - 7th International Conference on Formal Structures for Computation and Deduction, Aug 2022, Haifa, Israel. ⟨10.4230/LIPIcs.FSCD.2022.25⟩. ⟨hal-03956666⟩
Paul Gastin, Luc Dartois, R. Govind, Shankara Narayanan Krishna. Efficient Construction of Reversible Transducers from Regular Transducer Expressions. 37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS ’22), Aug 2022, Haifa, Israel. ⟨hal-03772628⟩
Aliaume Lopez. When Locality Meets Preservation. Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science, 2022, pp.1-14. ⟨10.1145/3531130.3532498⟩. ⟨hal-03883990⟩
Alejandro Díaz-Caro, Gilles Dowek. Linear Lambda-Calculus is Linear. FSCD 2022 - 7th International Conference on Formal Structures for Computation and Deduction, Tel Aviv University, Aug 2022, Haifa, Israel. ⟨10.4230/LIPIcs.FSCD.2022.21⟩. ⟨hal-03959343⟩
Valentin Blot. A direct computational interpretation of second-order arithmetic via update recursion. LICS 2022 - 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Aug 2022, Haïfa, Israel. ⟨10.1145/3531130.3532458⟩. ⟨hal-03698879⟩
Valentin Blot, Gilles Dowek, Thomas Traversié. An Implementation of Set Theory with Pointed Graphs in Dedukti. LFMTP 2022 - International Workshop on Logical Frameworks and Meta-Languages : Theory and Practice, Aug 2022, Haïfa, Israel. ⟨hal-03740004⟩
Bartosz Bednarczyk, Stéphane Demri. Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard?. Logical Methods in Computer Science, 2022, 18 (3), pp.5:1--5:46. ⟨10.46298/lmcs-18(3:5)2022⟩. ⟨hal-03749464⟩
Louise Ben Salem-Knapp, Sylvie Boldo, William Weens. Bounding the Round-Off Error of the Upwind Scheme for Advection. IEEE Transactions on Emerging Topics in Computing, 2022, 10 (3), ⟨10.1109/TETC.2022.3191472⟩. ⟨hal-03329933⟩
Dongho Lee. Formal Methods for Quantum Programming Languages. Formal Languages and Automata Theory [cs.FL]. Université Paris-Saclay, 2022. English. ⟨NNT : 2022UPASG059⟩. ⟨tel-03895847⟩
Giann Karlo Aguirre-Samboní, Cédric Gaucherel, Stefan Haar, Franck Pommereau. Reset Petri Net Unfolding Semantics for Ecosystem Hypergraphs. PNSE 2023 - International Workshop on Petri Nets and Software Engineering, Jul 2022, Bergen, Norway. pp.213--214. ⟨hal-03750233⟩
Aleks Kissinger, Renaud Vilmart, John van de Wetering. Classical simulation of quantum circuits with partial and graphical stabiliser decompositions. 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022), Jul 2022, Urbana-Champaign, United States. pp.5:1 - 5:13, ⟨10.4230/LIPIcs.TQC.2022.5⟩. ⟨hal-03606226⟩
Zujany Salazar, Fatiha Zaidi, Wissam Mallouli, Ana Rosa Cavalli, Huu Nghia Nguyen, et al.. A Formal Approach for Complex Attacks Generation based on Mutation of 5G Network Traffic. International Conference on Software and Data Technologies, University of Fribourg, Switzerland ; University of Twente, Netherlands ; Wroclaw University of Economics and Business, Poland and Macquarie University, Sydney, Australia, Jul 2022, Lisbonne, Portugal. pp.P. 234 - 241, ⟨10.5220/0011319000003266⟩. ⟨hal-04007862⟩
Pablo Arnault. Clifford algebra from quantum automata and unitary Wilson fermions. Physical Review A, 2022, 106, pp.012201. ⟨10.1103/PhysRevA.106.012201⟩. ⟨hal-03577279⟩
Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil. Asynchronous wreath product and cascade decompositions for concurrent behaviours. Logical Methods in Computer Science, 2022, ⟨10.46298/LMCS-18(2:22)2022⟩. ⟨hal-03709692⟩
Chantal Keller, Timothy Bourke, Sandrine Blazy, Frédéric Bour, Guillaume Bury, et al. (Dir.). 33èmes journées francophones des langages applicatifs. Chantal Keller; Timothy Bourke. , pp.1-292, 2022. ⟨hal-03689075⟩
Léo Andrès, Raja Boujbel, Louis Gesbert, Dario Pinto. Connecter l'écosystème OCaml à Software Heritage via opam. 33èmes Journées Francophones des Langages Applicatifs, Jun 2022, Saint-Médard-d'Excideuil, France. pp.227-234. ⟨hal-03626845⟩
Amélie Ledein, Valentin Blot, Catherine Dubois. Vers une traduction de K en Dedukti. JFLA 2022 - Journées Francophones des Langages Applicatifs (JFLA), Jun 2022, Saint-Médard-d'Excideuil, France. ⟨hal-03604962⟩
Çagdas Bozman, Mohamed Iguernlala, Michael Laporte, Maxime Levillain, Alain Mebsout, et al.. Jouez à Faire Consensus Avec MITTEN (démonstration). 33èmes Journées Francophones des Langages Applicatifs, Jun 2022, Saint-Médard-d'Excideuil, France. pp.248-250. ⟨hal-03626847⟩
Valentin Blot, Louise Dubois de Prisque, Chantal Keller, Pierre Vial. Bécassine à la chasse au Coq (démonstration). JFLA 2022 - Journées Francophones des Langages Applicatifs, Jun 2022, Saint-Médard-d'Excideuil, France. ⟨hal-03604902⟩
Valentin Fouillard, Nicolas Sabouret, Safouan Taha, Frédéric Boulanger. Le problème du décor revisité : un modèle logique pour le diagnostic d'erreurs humaines. Conférence Nationale en Intelligence Artificielle 2022, Jun 2022, Saint-Etienne, France. ⟨hal-03752151⟩
Jawher Jerray, Adnane Saoud, Laurent Fribourg. Using Euler's Method to Prove the Convergence of Neural Networks. IEEE Control Systems Letters, 2022, ⟨10.1109/lcsys.2022.3184040⟩. ⟨hal-03816597⟩
Jawher Jerray, Adnane Saoud, Laurent Fribourg. Asymptotic Error in Euler’s Method with a Constant Step Size. European Journal of Control, 2022, 68, pp.100694. ⟨10.1016/j.ejcon.2022.100694⟩. ⟨hal-03816598⟩
Andrei Paskevich. Continuation Passing as an Abstract Syntax for Deductive Verification. 2022. ⟨hal-03115120v2⟩
Cas Cremers, Caroline Fontaine, Charlie Jacomme. A Logic and an Interactive Prover for the Computational Post-Quantum Security of Protocols. S&P 2022 - 43rd IEEE Symposium on Security and Privacy, May 2022, San Francisco / Virtual, United States. ⟨hal-03620358v3⟩
Lulu He. Formal verification at design stage of diagnosis related properties for discrete event and real-time systems. Automatic Control Engineering. Université Paris-Saclay, 2022. English. ⟨NNT : 2022UPASG037⟩. ⟨tel-03736216⟩
Georges Aazan, Antoine Girard, Paolo Mason, Luca Greco. Stability of discrete-time switched linear systems with ω-regular switching sequences. HSCC 2022 - 25th ACM International Conference on Hybrid Systems : Computation and Control, May 2022, Milan, Italy. ⟨10.1145/3501710.3519543⟩. ⟨hal-03649665⟩
Véronique Benzaken, Évelyne Contejean, Mohammed Houssem Hachmaoui, Chantal Keller, Louis Mandel, et al.. Translating canonical SQL to imperative code in Coq. Proceedings of the ACM on Programming Languages, 2022, 6 (OOPSLA1), pp.1-27. ⟨10.1145/3527327⟩. ⟨hal-03876233⟩
Mathieu Montin, Amélie Ledein, Catherine Dubois. LibNDT: towards a formal library on spreadable properties over linked nested datatypes. Ninth Workshop on Mathematically Structured Functional Programming (MSFP), Jeremy Gibbons; Max S. New, Apr 2022, Munich, Germany. pp.27-44, ⟨10.4204/eptcs.360.2⟩. ⟨hal-04316452⟩
Giuseppe Castagna, Victor Lanvin, Mickaël Laurent, Kim Nguyen. Revisiting Occurrence Typing. Science of Computer Programming, 2022, 217 (102781), ⟨10.1016/j.scico.2022.102781⟩. ⟨hal-02181137v5⟩
Béatrice Bérard, Serge Haddad. Revisiting Reachability in Polynomial Interrupt Timed Automata. Information Processing Letters, 2022, 174, pp.106208. ⟨10.1016/j.ipl.2021.106208⟩. ⟨hal-03390569⟩
Victoria Andaur, Janna Burman, Matthias Függer, Manish Kushwaha, Bilal Manssouri, et al.. Reaching Agreement in Competitive Microbial Systems. 2022. ⟨hal-03545888⟩
Igor Khmelnitsky. Verification of Infinite-State Systems and Machine Learning. Computer science. Université Paris-Saclay, 2022. English. ⟨NNT : 2022UPASG001⟩. ⟨tel-04054017⟩
Quentin Garchery. Certification de la transformation de tâches de preuve. Logique en informatique [cs.LO]. Université Paris-Saclay, 2022. Français. ⟨NNT : 2022UPASG006⟩. ⟨tel-03560564⟩
Alejandro Díaz-Caro, Gilles Dowek. A New Connective in Natural Deduction, and its Application to Quantum Computing. 2022. ⟨hal-03540150⟩
Gilles Dowek, Gaspard Férey, Jean-Pierre Jouannaud, Jiaxiang Liu. Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs. Mathematical Structures in Computer Science, 2022, pp.1-36. ⟨10.1017/S0960129522000044⟩. ⟨hal-03126111v3⟩
Michael Färber. Safe, Fast, Concurrent Proof Checking for the lambda-Pi Calculus Modulo Rewriting. 11th ACM SIGPLAN International Conference on Certified Programs and Proofs (CCP'22), Jan 2022, Philadelphia, PA, United States. ⟨10.1145/3497775.3503683⟩. ⟨hal-03143359v3⟩
Alain Finkel, Serge Haddad, Igor Khmelnitsky. Coverability, Termination, and Finiteness in Recursive Petri Nets. Fundamenta Informaticae, 2022, 183, pp.33 - 66. ⟨10.3233/fi-2021-2081⟩. ⟨hal-04270919⟩
Matthias Függer. Computing at the border of abstractions: the power of timed, non-binary, distributed circuits. Computer Science [cs]. ENS Paris-Saclay, France, 2022. ⟨tel-04308490⟩
Matthias Függer, Attila Kinali, Christoph Lenzen, Ben Wiederhake. Fast All-Digital Clock Frequency Adaptation Circuit for Voltage Droop Tolerance. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2022, 41 (8), pp.2518-2531. ⟨10.1109/TCAD.2021.3097599⟩. ⟨hal-03536906⟩
Benedikt Becker, Nicolas Jeannerod, Claude Marché, Yann Régis-Gianas, Mihaela Sighireanu, et al.. The CoLiS Platform for the Analysis of Maintainer Scripts in Debian Software Packages. International Journal on Software Tools for Technology Transfer, 2022. ⟨hal-03737886⟩
Sylvie Boldo, François Clément, Louise Leclerc. A Coq Formalization of the Bochner integral. [Research Report] RR-9456, Inria Saclay - Île de France; Inria de Paris. 2022. ⟨hal-03516749v2⟩
Jean Goubault-Larrecq. Probabilistic Powerdomains and Quasi-Continuous Domains. Topology Proceedings, 2022, 60, pp.1-16. ⟨hal-03260383⟩
Vrunda Dave, Paul Gastin, Shankara Narayanan. Regular Transducer Expressions for Regular Transformations. Information and Computation, 2022, 282, pp.104655. ⟨10.1016/j.ic.2020.104655⟩. ⟨hal-03709884⟩
Cláudio Belo Lourenço, Denis Cousineau, Florian Faissole, Claude Marché, David Mentré, et al.. Automated Formal Analysis of Temporal Properties of Ladder Programs. International Journal on Software Tools for Technology Transfer, 2022, 24 (6), pp.977-997. ⟨10.1007/s10009-022-00680-0⟩. ⟨hal-03737869⟩
Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron, Simon Martiel, Cyril Allouche. Decoding techniques applied to the compilation of CNOT circuits for NISQ architectures. Science of Computer Programming, 2022, 214, pp.102726. ⟨10.1016/j.scico.2021.102726⟩. ⟨hal-03547113⟩
Sylvie Boldo, François Clément, Florian Faissole, Vincent Martin, Micaela Mayero. A Coq Formalization of Lebesgue Integration of Nonnegative Functions. Journal of Automated Reasoning, 2022, 66, pp.175-213. ⟨10.1007/s10817-021-09612-0⟩. ⟨hal-03471095⟩
Jean Goubault-Larrecq. Infinitary Noetherian Constructions I. Infinite Words. Colloquium Mathematicum, 2022, 168, pp.257-286. ⟨10.4064/cm8077-4-2021⟩. ⟨hal-03414552v2⟩
Giuseppe Castagna, Mickael Laurent, Kim Nguyen, Matthew Lutze. On Type-Cases, Union Elimination, and Occurrence Typing. Proceedings of the ACM on Programming Languages, 2022, 49th ACM SIGPLAN Symposium on Principles of Programming Languages, 6 (POPL), pp.75. ⟨10.1145/3498674⟩. ⟨hal-03426711v2⟩
Georges Aazan, Antoine Girard, Luca Greco, Paolo Mason. On the Joint Spectral Radius of Shuffled Switched Linear Systems. International Symposium on Mathematical Theory of Networks and Systems, 2022, Bayreuth, Germany. ⟨hal-03727152⟩
Yusuke Matsushita, Xavier Denis, Jacques-Henri Jourdan, Derek Dreyer. RustHornBelt: a semantic foundation for functional verification of Rust programs with unsafe code. PLDI 2022 - 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2022, San Diego CA USA, United States. pp.841-856, ⟨10.1145/3519939.3523704⟩. ⟨hal-03777103⟩
Pascal Lefèvre, Philippe Carré, Caroline Fontaine, Philippe Gaborit, Jiwu Huang. Efficient image tampering localization using semi-fragile watermarking and error control codes. Signal Processing, 2022, 190, pp.108342. ⟨10.1016/j.sigpro.2021.108342⟩. ⟨hal-03359426⟩
Jean Goubault-Larrecq. Kantorovich-Rubinstein Quasi-Metrics II: Hyperspaces and Powerdomains. Topology and its Applications, 2022, 305, pp.107885. ⟨10.1016/j.topol.2021.107885⟩. ⟨hal-03383036⟩
Titouan Carette, Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart. Completeness of Graphical Languages for Mixed State Quantum Mechanics. ACM Transactions on Quantum Computing, 2021, ACM Transactions on Quantum Computing, 2 (4), pp.1-28. ⟨10.1145/3464693⟩. ⟨hal-04082921⟩
Yaëlle Vinçont. Software security : combining fuzzing and symbolic methods for vulnerability detection. Cryptography and Security [cs.CR]. Université Paris-Saclay, 2021. English. ⟨NNT : 2021UPASG112⟩. ⟨tel-03652389⟩
Jawher Jerray. Guaranteed properties of dynamical systems under perturbations. Mobile Computing. Université Paris-Nord - Paris XIII, 2021. English. ⟨NNT : 2021PA131064⟩. ⟨tel-03875227⟩
Benedikt Bollig, Arnaud Sangnier, Olivier Stietel. Local First-Order Logic with Two Data Values. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021), Dec 2021, Goa, India. pp.39:1-39:15. ⟨hal-03353214⟩
Xavier Denis, Jacques-Henri Jourdan, Claude Marché. The CREUSOT Environment for the Deductive Verification of Rust Programs. [Research Report] RR-9448, Inria Saclay - Île de France. 2021. ⟨hal-03526634v2⟩
Francesco Belardinelli, Stéphane Demri. Strategic Reasoning with a Bounded Number of Resources: the Quest for Tractability. Artificial Intelligence, 2021, 300, pp.103557. ⟨10.1016/j.artint.2021.103557⟩. ⟨hal-03298703⟩
Mathilde Boltenhagen, Thomas Chatain, Josep Carmona. An A*-Algorithm for Computing Discounted Anti-Alignments in Process Mining. 3rd International Conference on Process Mining, Oct 2021, Eindhoven, Netherlands. ⟨hal-03229744v2⟩
Matthias Függer, Thomas Nowak, Manfred Schwarz. Tight Bounds for Asymptotic and Approximate Consensus. Journal of the ACM (JACM), 2021, ⟨10.1145/3485242⟩. ⟨hal-03408731⟩
Mathilde Boltenhagen. Partitionnement d’instances de processus basé sur les techniques de conformité de modèles. Other [cs.OH]. Université Paris-Saclay, 2021. English. ⟨NNT : 2021UPASG060⟩. ⟨tel-03461959⟩
Paolo Crisafulli, Safouan Taha, Burkhart Wolff. Modelling and Proving Safety in Autonomous Cars Scenarios in HOL-CSP. [Research Report] 1, University Paris-Saclay; IRT SystemX, Palaiseau. 2021, pp.81. ⟨hal-03429597v2⟩
Valentin Fouillard, Nicolas Sabouret, Safouan Taha, Frédéric Boulanger. Catching cognitive biases in an erroneous decision making process. IEEE International Conference on Systems, Man, and Cybernetics, Oct 2021, Melbourne (virtual), Australia. ⟨hal-03505246⟩
Jean-Christophe Filliâtre, Andrei Paskevich. Abstraction and Genericity in Why3. ISoLA 2021 - 9th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation, Oct 2021, Rhodes, Greece. ⟨10.1007/978-3-030-61362-4_7⟩. ⟨hal-02696246v2⟩
Valentin Fouillard, Nicolas Sabouret, Safouan Taha, Frédéric Boulanger. Capturer les biais cognitifs dans un processus de prise de décision erroné. WACAI 2021, Centre National de la Recherche Scientifique [CNRS], Oct 2021, Saint Pierre d'Oléron, France. ⟨hal-03377541⟩
Jean-Christophe Filliâtre, Clément Pascutto. Ortac: Runtime Assertion Checking for OCaml. RV'21 - 21st International Conference on Runtime Verification, Oct 2021, Los Angeles, CA, United States. ⟨hal-03252901v2⟩
Philippe Dague. Metabolic Pathway Analysis in the Presence of Biological Constraints. Computation, 2021, 9 (10), pp.111. ⟨10.3390/computation9100111⟩. ⟨hal-03467719⟩
Da-Jung Cho, Matthias Függer, Corbin Hopper, Manish Kushwaha, Thomas Nowak, et al.. Distributed computation with continual population growth. Distributed Computing, 2021, ⟨10.1007/s00446-021-00404-8⟩. ⟨hal-03519002⟩
Anirban Majumdar. Verification and synthesis of parameterized concurrent systems. Other [cs.OH]. Université Paris-Saclay, 2021. English. ⟨NNT : 2021UPASG059⟩. ⟨tel-03412980⟩
Yann Leray. M1 Internship Report Translating proofs between Isabelle and Dedukti. [Internship report] Deducteam - Inria Paris-Saclay / ENS Paris-Saclay. 2021. ⟨hal-03348486⟩
Gaspard Férey, Jean-Pierre Jouannaud. Confluence in UnTyped Higher-Order Theories by means of Critical Pairs. 2021. ⟨hal-03126102v3⟩
Yacine El Haddad. Integrating Automated Theorem Provers in Proof Assistants. Automatic Control Engineering. Université Paris-Saclay, 2021. English. ⟨NNT : 2021UPASG052⟩. ⟨tel-03387912v2⟩
Thiago Felicissimo. Representing Agda and coinduction in the λΠ-calculus modulo rewriting. Logic in Computer Science [cs.LO]. 2021. ⟨hal-03343699⟩
Gaspard Férey, Jean-Pierre Jouannaud. Confluence in Non-Left-Linear Untyped Higher-Order Rewrite Theories. PPDP 2021 - 23rd International Symposium on Principles and Practice of Declarative Programming, Sep 2021, Tallin, Estonia. ⟨10.1145/3479394.3479403⟩. ⟨hal-03126115v6⟩
Mathilde Boltenhagen, Thomas Chatain, Josep Carmona. A Discounted Cost Function for Fast Alignments of Business Processes. BPM 2021 - 19th International Conference on Business Process Management, Sep 2021, Rome, France. ⟨10.1007/978-3-030-85469-0_17⟩. ⟨hal-03362277⟩
Yoan Géran. Mathématiques inversées de Coq : L'exemple de GeoCoq. Logique en informatique [cs.LO]. 2021. ⟨hal-04319183⟩
Benedikt Bollig, Cinzia Di Giusto, Alain Finkel, Laetitia Laversa, Etienne Lozes, et al.. A Unifying Framework for Deciding Synchronizability. CONCUR 2021 - 32nd International Conference on Concurrency Theory, Aug 2021, Paris, France. pp.1-33. ⟨hal-03278370⟩
Renaud Vilmart. Quantum Multiple-Valued Decision Diagrams in Graphical Calculi. MFCS 2021 - 46th International Symposium on Mathematical Foundations of Computer Science, Aug 2021, Tallinn, Estonia. pp.89:1--89:15, ⟨10.4230/LIPIcs.MFCS.2021.89⟩. ⟨hal-03277262⟩
Kostia Chardonnet, Benoît Valiron, Renaud Vilmart. Geometry of Interaction for ZX-Diagrams. MFCS 2021 - 46th International Symposium on Mathematical Foundations of Computer Science, Aug 2021, Tallinn, Estonia. pp.30:1--30:16, ⟨10.4230/LIPIcs.MFCS.2021.30⟩. ⟨hal-03154573⟩
Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Igor Khmelnitsky, et al.. Extracting Context-Free Grammars from Recurrent Neural Networks using Tree-Automata Learning and A* Search. ICGI 2021 - 15th International Conference on Grammatical Inference, Aug 2021, New York City / Virtual, United States. pp.113-129. ⟨hal-03285433⟩
Nicolas Osborne, Clément Pascutto. Leveraging Formal Specifications to Generate Fuzzing Suites. OCaml Users and Developers Workshop, co-located with the 26th ACM SIGPLAN International Conference on Functional Programming, Aug 2021, Virtual, United States. ⟨hal-03328646⟩
Glen Mével, Jacques-Henri Jourdan. Formal Verification of a Concurrent Bounded Queue in a Weak Memory Model. ICFP 2021 - 26th ACM SIGPLAN International Conference on Functional Programming, Aug 2021, Virtual, Japan. ⟨10.1145/3473571⟩. ⟨hal-03298759⟩
Stéphane Demri, Etienne Lozes, Alessio Mansutti. A Complete Axiomatisation for Quantifier-Free Separation Logic. Logical Methods in Computer Science, 2021, 17 (3), pp.17:1--17:64. ⟨10.46298/lmcs-17(3:17)2021⟩. ⟨hal-03005864⟩
Cláudio Lourenço, Denis Cousineau, Florian Faissole, Claude Marché, David Mentré, et al.. Automated Verification of Temporal Properties of Ladder Programs. FMICS 2021 - Formal Methods for Industrial Critical Systems, Aug 2021, Paris, France. ⟨10.1007/978-3-030-85248-1_2⟩. ⟨hal-03281580⟩
S Akshay, Paul Gastin, Karthik R Prakash. Fast zone-based algorithms for reachability in pushdown timed automata. 33rd International Conference on Computer-Aided Verification (CAV'2021), Jul 2021, Los Angeles, United States. ⟨hal-03283051⟩
William Weens, Thibaud Vazquez-Gonzalez, Louise Ben Salem-Knapp. Modeling round-off errors in hydrodynamic simulations. NSV 2021 - 14th International Workshop on Numerical Software Verification, Jul 2021, Los Angeles, United States. ⟨hal-03351754⟩
Frédéric Blanqui, Gilles Dowek, Émilie Grienenberger, Gabriel Hondet, François Thiré. Some Axioms for Mathematics. FSCD 2021 - 6th International Conference on Formal Structures for Computation and Deduction, Jul 2021, Buenos Aires / Virtual, Argentina. ⟨10.4230/LIPIcs.FSCD.2021.20⟩. ⟨hal-03279749⟩
Thibaut Balabonski, Antoine Lanco, Guillaume Melquiond. A strong call-by-need calculus. FSCD 2021 - 6th International Conference on Formal Structures for Computation and Deduction, Jul 2021, Buenos Aires, Argentina. pp.1-22, ⟨10.4230/LIPIcs.FSCD.2021.9⟩. ⟨hal-03149692v2⟩
Pablo Arrighi, Amélia Durbec, Pierre Guillon. Graph Subshifts. 27th International Workshop on Cellular Automata and Discrete Complex Systems, Jul 2021, Marseille, France. ⟨hal-03238087v3⟩
Valentin Blot, Louise Dubois de Prisque, Chantal Keller, Pierre Vial. General Automation in Coq through Modular Transformations. Seventh Workshop on Proof Exchange in Theorem Proving, Jul 2021, Pittsburgh, United States. ⟨10.4204/EPTCS.336.3⟩. ⟨hal-03328935⟩
Jawher Jerray, Laurent Fribourg. Determination of limit cycles using stroboscopic set-valued maps. Proceedings of the 7th IFAC Conference on Analysis and Design of Hybrid Systems (ADHS 2021), Jul 2021, Brussels, Belgium. pp.139-144, ⟨10.1016/j.ifacol.2021.08.488⟩. ⟨hal-03249763⟩
Chantal Keller, Mathias Fleury. PxTP 2021 - Seventh Workshop on Proof eXchange for Theorem Proving. Electronic Proceedings in Theoretical Computer Science, 336, 61 p., 2021, ⟨10.4204/eptcs.336⟩. ⟨hal-03443742⟩
Juraj Kolcak. Dépliages et interprétation abstraite pour réseaux de régulation biologiques paramétrés. Bioinformatics [q-bio.QM]. Université Paris-Saclay, 2021. English. ⟨NNT : 2021UPASG048⟩. ⟨tel-03338961⟩
Stéphane Demri, Karin Quaas. Concrete domains in logics: a survey. ACM SIGLOG News, 2021, 8 (3), pp.6-29. ⟨10.1145/3477986.3477988⟩. ⟨hal-03313291⟩
Sylvie Boldo, Christoph Q. Lauter, Jean-Michel Muller. Emulating round-to-nearest ties-to-zero "augmented" floating-point operations using round-to-nearest ties-to-even arithmetic. IEEE Transactions on Computers, 2021, 70 (7), pp.1046 - 1058. ⟨10.1109/TC.2020.3002702⟩. ⟨hal-02137968v4⟩
Anas Makdesi, Antoine Girard, Laurent Fribourg. Efficient Data-Driven Abstraction of Monotone Systems with Disturbances. 7th IFAC Conference on Analysis and Design of Hybrid Systems, Jul 2021, Brussels, Belgium. ⟨10.1016/j.ifacol.2021.08.473⟩. ⟨hal-03216649⟩
Gaspard Ferey. Higher-Order Confluence and Universe Embedding in the Logical Framework. Other [cs.OH]. Université Paris-Saclay, 2021. English. ⟨NNT : 2021UPASG032⟩. ⟨tel-03418761⟩
Paul Gastin, Amaldev Manuel, R Govind. Reversible Regular Languages: Logical and Algebraic Characterisations. Fundamenta Informaticae, 2021, 180, pp.333 - 350. ⟨10.3233/fi-2021-2045⟩. ⟨hal-03710241⟩
Luc Dartois, Paul Gastin, Shankara Narayanan. SD-Regular Transducer Expressions for Aperiodic Transformations. 36th Annual Symposium on Logic in Computer Science (LICS'2021), Jun 2021, Rome, Italy. ⟨10.1109/LICS52264.2021.9470738⟩. ⟨hal-03283013⟩
Kostia Chardonnet, Benoît Valiron, Renaud Vilmart. Geometry of Interaction for ZX-Diagrams. TLLA 2021 - 5th International Workshop on Trends in Linear Logic and Applications, Jun 2021, Rome / Virtual, Italy. ⟨lirmm-03272411⟩
Kostia Chardonnet, Alexis Saurin, Benoît Valiron. Towards a Curry-Howard Correspondence for Linear, Reversible Computation. 5th International Workshop on Trends in Linear Logic and Applications (TLLA 2021), Jun 2021, Rome (virtual), Italy. ⟨lirmm-03271484⟩
Serge Haddad, Didier Lime, Olivier H Roux. A Turn-Based Approach for Qualitative Time Concurrent Games. PETRI NETS 2021 - 42nd International Conference on Applications and Theory of Petri Nets and Concurrency, Jun 2021, Paris, France. pp.76-92, ⟨10.1007/978-3-030-76983-3_5⟩. ⟨hal-03561748⟩
Jürgen Maier, Daniel Öhlinger, Ulrich Schmid, Matthias Függer, Thomas Nowak. A Composable Glitch-Aware Delay Model. GLSVLSI '21: Great Lakes Symposium on VLSI 2021, Jun 2021, Virtual Event, United States. pp.147-154, ⟨10.1145/3453688.3461519⟩. ⟨hal-03451070⟩
Stéphane Demri, Etienne Lozes, Alessio Mansutti. The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic. ACM Transactions on Computational Logic, 2021, 22 (2), pp.14:1--14:56. ⟨10.1145/3448269⟩. ⟨hal-03215795⟩
David Baelde, Stéphanie Delaune, Charlie Jacomme, Adrien Koutsos, Solène Moreau. Extending the SQUIRREL meta-logic for reasoning over security protocols: Work in Progress. 2021. ⟨hal-03264227⟩
Louise Ben Salem-Knapp, Thibaud Vazquez-Gonzalez, William Weens. La double précision suffit-elle à l'exascale ?. AFADL 2021 - 20èmes journées Approches Formelles dans l'Assistance au Développement de Logiciels, Jun 2021, Vannes, France. ⟨hal-03351615⟩
Sylvie Boldo, Guillaume Melquiond. Some Formal Tools for Computer Arithmetic: Flocq and Gappa. ARITH 2021 - 28th IEEE International Symposium on Computer Arithmetic, Jun 2021, Online, Italy. ⟨hal-03233227⟩
Idir Ait-Sadoune. OntoEventB: A Generator of Event-B contexts from Ontologies. 9th Rodin User and Developer Workshop, Jun 2021, Ulm, Germany. ⟨hal-03265730⟩
Anas Makdesi, Antoine Girard, Laurent Fribourg. Data-Driven Abstraction of Monotone Systems. Learning for Dynamics and Control Conference, Jun 2021, Zurich, Switzerland. ⟨hal-03216643⟩
Jean-Christophe Filliâtre. Compte-rendu de fin de projet ANR-15-CE25-0008 "VOCaL" : Programme CE25 2015. [Rapport de recherche] LMF - Laboratoire Méthodes Formelles. 2021. ⟨hal-03326775⟩
Jean-Christophe Filliâtre. Simpler Proofs with Decentralized Invariants. Journal of Logical and Algebraic Methods in Programming, 2021, 121, ⟨10.1016/j.jlamp.2021.100645⟩. ⟨hal-02518570⟩
Mihaela Sighireanu. SL-COMP: competition of solvers for separation logic. International Journal on Software Tools for Technology Transfer, 2021, 23, pp.895 - 903. ⟨10.1007/s10009-021-00628-w⟩. ⟨hal-04425491⟩
Guillaume Melquiond. Plotting in a Formally Verified Way. Proceedings of the 6th Workshop on Formal Integrated Development Environment, May 2021, Online, United States. pp.39-45, ⟨10.4204/EPTCS.338.6⟩. ⟨hal-03168208v2⟩
Benedikt Becker, Cláudio Belo Lourenço, Claude Marché. Explaining Counterexamples with Giant-Step Assertion Checking. F-IDE 2021 - 6th Workshop on Formal Integrated Development Environments, May 2021, Virtual, United States. ⟨10.4204/EPTCS.338.10⟩. ⟨hal-03217393⟩
David Baelde, Stéphanie Delaune, Charlie Jacomme, Adrien Koutsos, Solène Moreau. An Interactive Prover for Protocol Verification in the Computational Model. SP 2021 - 42nd IEEE Symposium on Security and Privacy, May 2021, San Fransisco / Virtual, United States. ⟨hal-03172119⟩
Wolfgang Dür, Matthias Függer, Andreas Steininger. Generation of a fault-tolerant clock through redundant crystal oscillators. Microelectronics Reliability, 2021, 120, pp.114088. ⟨10.1016/j.microrel.2021.114088⟩. ⟨hal-03329844⟩
Thomas Chatain, Mathilde Boltenhagen, Josep Carmona. Anti-Alignments -- Measuring The Precision of Process Models and Event Logs. Information Systems, 2021, ⟨10.1016/j.is.2020.101708⟩. ⟨hal-02383546v3⟩
Jean Goubault-Larrecq. Kantorovich-Rubinstein Quasi-Metrics I: Spaces of Measures and of Continuous Valuations. Topology and its Applications, 2021, ⟨10.1016/j.topol.2021.107673⟩. ⟨hal-03186371⟩
Yann Regis-Gianas, Chantal Keller (Dir.). JFLA 2021 - 32 èmes Journées Francophones des Langages Applicatifs. 2021. ⟨hal-03190426v2⟩
Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas. Polynomial interrupt timed automata: Verification and expressiveness. Information and Computation, 2021, 277, pp.104580. ⟨10.1016/j.ic.2020.104580⟩. ⟨hal-02862629⟩
Cláudio Lourenço, Denis Cousineau, Florian Faissole, Claude Marché, David Mentré, et al.. Formal Analysis of Ladder Programs using Deductive Verification. [Research Report] RR-9402, Inria. 2021, pp.25. ⟨hal-03199464⟩
Ralf Jung, Jacques-Henri Jourdan, Robbert Krebbers, Derek Dreyer. Safe Systems Programming in Rust: The Promise and the Challenge. Communications of the ACM, 2021, 64 (4), pp.144-152. ⟨10.1145/3418295⟩. ⟨hal-03021536⟩
Sylvie Boldo, François Clément, Florian Faissole, Vincent Martin, Micaela Mayero. A Coq Formalization of Lebesgue Integration of Nonnegative Functions. [Research Report] RR-9401, Inria, France. 2021, pp.38. ⟨hal-03194113v2⟩
Benedikt Becker, Cláudio Belo Lourenço, Claude Marché. Giant-step Semantics for the Categorisation of Counterexamples. [Research Report] RR-9407, Inria. 2021, pp.43. ⟨hal-03213438⟩
Patricia Bouyer, Léo Henry, Samy Jaziri, Thierry Jéron, Nicolas Markey. Diagnosing timed automata using timed markings. International Journal on Software Tools for Technology Transfer, 2021, 23 (2), pp.229-253. ⟨10.1007/s10009-021-00606-2⟩. ⟨hal-03321763⟩
Renaud Vilmart. The Structure of Sum-Over-Paths, its Consequences, and Completeness for Clifford. Foundations of Software Science and Computation Structures (FoSSaCS) 2021, Mar 2021, Luxembourg, Luxembourg. pp.531-550, ⟨10.1007/978-3-030-71995-1_27⟩. ⟨hal-02651473⟩
Christophe Chareton, Sébastien Bardin, François Bobot, Valentin Perrelle, Benoît Valiron. An automated deductive verification framework for circuit-building quantum programs. Lecture Notes in Computer Science, 2021, Lecture Notes in Computer Science, 12648, pp.148-177. ⟨10.1007/978-3-030-72019-3_6⟩. ⟨cea-04479195⟩
Diane Gallois-Wong. Formalisation en Coq des algorithmes de filtre numérique calculés en précision finie. Traitement du signal et de l'image [eess.SP]. Université Paris-Saclay, 2021. Français. ⟨NNT : 2021UPASG016⟩. ⟨tel-03202580⟩
David Baelde. Contributions to the Verification of Cryptographic Protocols. Computer Science [cs]. Université Paris-Saclay, 2021. ⟨tel-04549522⟩
Charlie Jacomme, Steve Kremer. An Extensive Formal Analysis of Multi-factor Authentication Protocols. ACM Transactions on Privacy and Security, 2021, 24 (2), pp.1-34. ⟨10.1145/3440712⟩. ⟨hal-03468848⟩
Benedikt Bollig, Marie Fortin, Paul Gastin. Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic. Journal of Computer and System Sciences, 2021, 115, pp.22-53. ⟨10.1016/j.jcss.2020.06.006⟩. ⟨hal-03334813⟩
Aliaume Lopez. Preservation Theorems Through the Lens of Topology. 29th EACSL Annual Conference on Computer Science Logic (CSL 2021), Jan 2021, Ljubljana, Slovenia. pp.32:1--32:17, ⟨10.4230/LIPIcs.CSL.2021.32⟩. ⟨hal-03883987⟩
Benedikt Bollig, Fedor Ryabinin, Arnaud Sangnier. Reachability in Distributed Memory Automata. Computer Science Logic (CSL) 2021, Jan 2021, Ljubljana, Slovenia. ⟨10.4230/LIPIcs.CSL.2021.13⟩. ⟨hal-02983089⟩
Adrien Koutsos. Decidability of a Sound Set of Inference Rules for Computational Indistinguishability. ACM Transactions on Computational Logic, 2021, 22 (1), pp.1 - 44. ⟨10.1145/3423169⟩. ⟨hal-03469091⟩
Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, et al.. Computer Aided Formal Design of Swarm Robotics Algorithms. 2021. ⟨hal-03111541⟩
Véronique Benzaken, Sarah Cohen-Boulakia, Évelyne Contejean, Chantal Keller, Rébecca Zucchini. A Coq formalization of data provenance. Certified Programs and Proofs, ACM, Jan 2021, Virtual Event, Denmark. ⟨10.1145/3437992.3439920⟩. ⟨hal-03380459⟩
Bartosz Bednarczyk, Stéphane Demri, Alessio Mansutti. A Framework for Reasoning about Dynamic Axioms in Description Logics. Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, Jan 2021, Yokohama, Japan. ⟨hal-03005848⟩
Gilles Dowek. Interacting Safely with an Unsafe Environment. Logical Frameworks and Meta-Languages, 2021, Pittsburgh, United States. 337, pp.30 - 38, 2021, ⟨10.4204/eptcs.337.3⟩. ⟨hal-03540149⟩
Adnane Saoud, Antoine Girard, Laurent Fribourg. Assume-guarantee contracts for continuous-time systems. Automatica, 2021, 134, ⟨10.1016/j.automatica.2021.109910⟩. ⟨hal-02196511v3⟩
Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron, Simon Martiel, Cyril Allouche. Gaussian elimination versus Greedy methods for the synthesis of linear reversible circuits. ACM Transactions on Quantum Computing, 2021, 2 (3), pp.11. ⟨10.1145/3474226⟩. ⟨hal-03547117⟩
Stéphane Demri, Raul Fervari, Alessio Mansutti. Internal Proof Calculi for Modal Logics with Separating Conjunction. Journal of Logic and Computation, 2021, 31 (3), pp.832-891. ⟨10.1093/logcom/exab016⟩. ⟨hal-03185457⟩
Yaëlle Vinçont, Sébastien Bardin, Michaël Marcozzi. A tight integration of symbolic execution and fuzzing. Lecture Notes in Computer Science, 2021, FPS 2021 - The 14th International Symposium on Foundations & Practice of Security, 13291, ⟨10.1007/978-3-031-08147-7_20⟩. ⟨cea-04232795⟩
Sylvain Conchon, Alexandrina Korneva, Çagdas Bozman, Mohamed Iguernlala, Alain Mebsout. Formally Documenting Tenderbake. Open Access Series in Informatics, In press, ⟨10.4230/OASIcs.FMBC.2021.5⟩. ⟨hal-03398884⟩
Timothee Goubault De Brugiere, Marc Baboulin, Benoît Valiron, Simon Martiel, Cyril Allouche. Reducing the depth of linear reversible quantum circuits. IEEE Transactions on Quantum Engineering, In press, 2, pp.3102422. ⟨10.1109/TQE.2021.3091648⟩. ⟨hal-03553916⟩
Philippe Schnoebelen. On flat lossy channel machines. 29th EACSL Conference on Computer Science Logic, Jan 2021, Ljubljana, Slovenia. ⟨10.4230/LIPIcs.CSL.2021.37⟩. ⟨hal-03441933⟩
Daniel Öhlinger, Jürgen Maier, Matthias Függer, Ulrich Schmid. The Involution Tool for Accurate Digital Timing and Power Analysis. Systems Integration, 2021, 76, pp.87-98. ⟨10.1016/j.vlsi.2020.09.007⟩. ⟨hal-03070269⟩
Giovanni Bacci, Patricia Bouyer, Uli Fahrenberg, Kim Larsen, Nicolas Markey, et al.. Optimal and robust controller synthesis using energy timed automata with uncertainty. Formal Aspects of Computing, 2021, 33 (1), pp.3-25. ⟨10.1007/s00165-020-00521-4⟩. ⟨hal-03240104⟩
Alain Finkel, Serge Haddad, Igor Khmelnitsky. Commodification of accelerations for the Karp and Miller Construction.. Discrete Event Dynamic Systems, 2021, 31 (2), pp.251-270. ⟨hal-03137054⟩
Adnane Saoud, Antoine Girard, Laurent Fribourg. Contract-based Design of Symbolic Controllers for Safety in Distributed Multiperiodic Sampled-Data Systems. IEEE Transactions on Automatic Control, 2021, 66 (3), pp.1055-1070. ⟨10.1109/tac.2020.2992446⟩. ⟨hal-02132070v2⟩
Michael Blondin, Matthias Englert, Alain Finkel, Stefan Göller, Christoph Haase, et al.. The Reachability Problem for Two-Dimensional Vector Addition Systems with States. Journal of the ACM (JACM), 2021, 68 (5), pp.1-43. ⟨10.1145/3464794⟩. ⟨hal-04270941⟩
Robin Pelle. Contribution à la modélisation formelle d'essaims de robots mobiles. Système multi-agents [cs.MA]. Université Paris-Saclay, 2020. Français. ⟨NNT : 2020UPASG062⟩. ⟨tel-03201867⟩
Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar. Synthesizing safe coalition strategies. FSTTCS'20, Dec 2020, on line, India. ⟨hal-02917538⟩
Alessio Mansutti. Logiques de séparation : complexité, expressivité, calculs. Logique en informatique [cs.LO]. Université Paris-Saclay, 2020. Français. ⟨NNT : 2020UPASG050⟩. ⟨tel-03094373⟩
Guillaume Genestier. Dependently-Typed Termination and Embedding of Extensional Universe-Polymorphic Type Theory using Rewriting. Computation and Language [cs.CL]. Université Paris-Saclay, 2020. English. ⟨NNT : 2020UPASG045⟩. ⟨tel-03167579⟩
Vassil Todorov. Automotive embedded software design using formal methods. Modeling and Simulation. Université Paris-Saclay, 2020. English. ⟨NNT : 2020UPASG026⟩. ⟨tel-03082647⟩
François Thiré. Interoperability between proof systems using the logical framework Dedukti. Programming Languages [cs.PL]. Université Paris-Saclay, 2020. English. ⟨NNT : 2020UPASG053⟩. ⟨tel-03224039v3⟩
Wenbo Zhou, Philippe Dague, Lei Liu, Lina Ye, Fatiha Zaïdi. A Coloured Petri Nets Based Attack Tolerance Framework. 27th Asia-Pacific Software Engineering Conference (APSEC 2020), IEEE, Dec 2020, Singapore, Singapore. ⟨hal-03133790⟩
Nathalie Bertrand, Serge Haddad, Engel Lefaucheux. Diagnosis and Degradation Control for Probabilistic Systems. Discrete Event Dynamic Systems, 2020, 30 (4), pp.695-723. ⟨10.1007/s10626-020-00320-2⟩. ⟨hal-03095652⟩
Marie Fortin. Expressivité de la logique du premier ordre, de la logique dynamique propositionnelle sans étoile et des automates communicants. Autre [cs.OH]. Université Paris-Saclay, 2020. Français. ⟨NNT : 2020UPASG046⟩. ⟨tel-03079438⟩
Hubert Comon, Charlie Jacomme, Guillaume Scerri. Oracle simulation: a technique for protocol composition with long term shared secrets. ACM CCS 2020, Nov 2020, Orlando, United States. pp.1427-1444. ⟨hal-02913866⟩
Raphaël Rieu. Development and verification of arbitrary-precision integer arithmetic libraries. Computer Arithmetic. Université Paris-Saclay, 2020. English. ⟨NNT : 2020UPASG023⟩. ⟨tel-03032942⟩
Mathilde Boltenhagen, Thomas Chatain, Josep Carmona. Model-based trace variant analysis of event logs. Information Systems, 2020, pp.101675. ⟨10.1016/j.is.2020.101675⟩. ⟨hal-03132606⟩
Timothée Goubault de Brugière. Methods for optimizing the synthesis of quantum circuits. Quantum Physics [quant-ph]. Université Paris-Saclay, 2020. English. ⟨NNT : 2020UPASG018⟩. ⟨tel-03127089⟩
Mohammed Houssem Eddine Hachmaoui. Traduction mécanisée et certifiée en Coq d'une algèbre relationnelle étendue pour SQL vers une algèbre imbriquée. Langage de programmation [cs.PL]. Université Paris-Saclay, 2020. Français. ⟨NNT : 2020UPASG021⟩. ⟨tel-03026835⟩
Charlie Jacomme. Preuves de protocoles cryptographiques : méthodes symboliques et attaquants puissants. Cryptographie et sécurité [cs.CR]. Université Paris-Saclay, 2020. Français. ⟨NNT : 2020UPASG005⟩. ⟨tel-02972373⟩
Mathilde Boltenhagen, Benjamin Chetioui, Laurine Huber. An Alignment Cost-Based Classification of Log Traces Using Machine-Learning. ML4PM2020 - First International Workshop on Leveraging Machine Learning in Process Mining, Oct 2020, Padua/ Virtual, Italy. ⟨10.1007/978-3-030-72693-5_11⟩. ⟨hal-03134114⟩
Johannes Bund, Matthias Függer, Christoph Lenzen, Moti Medina. Synchronizer-free Digital Link Controller. IEEE Transactions on Circuits and Systems I: Regular Papers, 2020, 67 (10), pp.3562-3573. ⟨10.1109/TCSI.2020.2989552⟩. ⟨hal-03070312⟩
Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière, Pierre Vandenhove. Decisiveness of Stochastic Systems and its Application to Hybrid Models. 11th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'20), Sep 2020, Brussels, Belgium. ⟨hal-02917546⟩
Béatrice Bérard, Benedikt Bollig, Patricia Bouyer, Matthias Függer, Nathalie Sznajder. Synthesis in Presence of Dynamic Links. GandALF'20 - 11th International Symposium on Games, Automata, Logics, and Formal Verification, Sep 2020, Brussels (online), Belgium. ⟨hal-02917542⟩
Stefan Haar, Loïc Paulevé, Stefan Schwoon. Drawing the Line: Basin Boundaries in Safe Petri Nets. CMSB 2020 - 18th International Conference on Computational Methods in Systems Biology, Sep 2020, Konstanz / Online, Germany. ⟨10.1007/978-3-030-60327-4_17⟩. ⟨hal-02898841⟩
Hai Nguyen Van, Frédéric Boulanger, Burkhart Wolff. TESL: a Model with Metric Time for Modeling and Simulation. 27th International Symposium on Temporal Representation and Reasoning, Sep 2020, Bozen-Bolzano, Italy. ⟨10.4230/LIPIcs.TIME.2020.15⟩. ⟨hal-02931401⟩
Sani Mohammadreza Fani, Mathilde Boltenhagen, Aalst Wil van Der. Prototype Selection using Clustering and Conformance Metrics for Process Discovery. BPI’20 - 16th International Workshop on Business Process Intelligence, Sep 2020, Sevilla, Spain. ⟨hal-03134093⟩
Xavier Denis. Deductive program verification for a language with a Rust-like typing discipline. [Internship report] Université de Paris. 2020. ⟨hal-02962804⟩
Louise Dubois de Prisque. Transformations logiques pour SMTCoq. Informatique [cs]. 2020. ⟨hal-04486654⟩
Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove. Games Where You Can Play Optimally with Arena-Independent Finite Memory. 31st International Conference on Concurrency Theory (CONCUR'20), Sep 2020, Vienna, Austria. ⟨10.4230/LIPIcs.CONCUR.2020.18⟩. ⟨hal-02917552⟩
Hai Nguyen Van, Thibaut Balabonski, Frédéric Boulanger, Chantal Keller, Benoît Valiron, et al.. On the Semantics of Polychronous Polytimed Specifications. 18th International Conference on Formal Modeling and Analysis of Timed Systems, Sep 2020, Vienna, Austria. pp.23-40, ⟨10.1007/978-3-030-57628-8_2⟩. ⟨hal-02931403⟩
Benedikt Bollig, Alain Finkel, Amrita Suresh. Bounded Reachability Problems are Decidable in FIFO Machines. 31st International Conference on Concurrency Theory (CONCUR 2020), Sep 2020, Vienna, Austria. ⟨hal-02900813⟩
Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil. Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces. 31st International Conference on Concurrency Theory, Sep 2020, Vienna, Austria. pp.19:1 -19: 17, ⟨10.4230/LIPIcs.CONCUR.2020.19⟩. ⟨hal-02905961⟩
Francesco Belardinelli, Stéphane Demri. Reasoning with a Bounded Number of Resources in ATL+. 24th European Conference on Artificial Intelligence, Aug 2020, Santiago de Compostela, Spain. pp.624--631, ⟨10.3233/FAIA200147⟩. ⟨hal-03005853⟩
Vassil Todorov, Safouan Taha, Frédéric Boulanger. Specification Quality Metrics Based on Mutation and Inductive Incremental Model Checking. NASA Formal Methods - 12th International Symposium, NFM 2020, Moffett Field, CA, USA, May 11-15, 2020, Proceedings, pp.187-203, 2020, ⟨10.1007/978-3-030-55754-6_11⟩. ⟨hal-02956436⟩
Alain Finkel, Jean Goubault-Larrecq. Forward analysis for WSTS, part I: completions. Mathematical Structures in Computer Science, 2020, 30 (7), pp.752-832. ⟨10.1017/S0960129520000195⟩. ⟨hal-03186488⟩
Jean Goubault-Larrecq. Some topological properties of spaces of Lipschitz continuous maps on quasi-metric spaces. Topology and its Applications, 2020, 282, pp.107281. ⟨10.1016/j.topol.2020.107281⟩. ⟨hal-03187651⟩
Guillaume Melquiond, Raphaël Rieu-Helft. WhyMP, a Formally Verified Arbitrary-Precision Integer Library. ISSAC 2020 - 45th International Symposium on Symbolic and Algebraic Computation, Jul 2020, Kalamata, Greece. pp.352-359, ⟨10.1145/3373207.3404029⟩. ⟨hal-02566654v2⟩
Hugo Herbelin, Étienne Miquey. A calculus of expandable stores: Continuation-and-environment-passing style translations. LICS 2020 - 35th ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken / Virtual, Germany. pp.564-577, ⟨10.1145/3373718.3394792⟩. ⟨hal-02557823v2⟩
Gilles Barthe, Charlie Jacomme, Steve Kremer. Universal equivalence and majority of probabilistic programs over finite fields. ACM/IEEE LICS 2020 - 35th Annual Symposium on Logic in Computer Science, Jul 2020, Saarbrücken / Virtual, Germany. pp.155-166, ⟨10.1145/3373718.3394746⟩. ⟨hal-02961583⟩
Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti. Modal Logics with Composition on Finite Forests. 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbruecken, Germany. ⟨10.1145/3373718.3394787⟩. ⟨hal-03005865⟩
Jean-Christophe Filliâtre. a Coq retrospective - at the heart of Coq architecture, the genesis of version 7.0. The Coq Workshop 2020, Jul 2020, virtual, France. ⟨hal-02890460⟩
Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron, Simon Martiel, Cyril Allouche. Quantum CNOT Circuits Synthesis for NISQ Architectures Using the Syndrome Decoding Problem. Reversible Computation, Jul 2020, Oslo, Norway. ⟨10.1007/978-3-030-52482-1_11⟩. ⟨hal-04349410⟩
Gabriel Hondet, Frédéric Blanqui. The New Rewriting Engine of Dedukti. FSCD 2020 - 5th International Conference on Formal Structures for Computation and Deduction, Jun 2020, Paris, France. pp.16, ⟨10.4230/LIPIcs.FSCD.2020.35⟩. ⟨hal-02981561v2⟩
Guillaume Genestier. Encoding Agda Programs Using Rewriting. FSCD - 5th International Conference on Formal Structures for Computation and Deduction, Jun 2020, Paris, France. ⟨10.4230/LIPIcs.FSCD.2020.31⟩. ⟨hal-03838613⟩
Stéphane Le Roux. Time-aware uniformization of winning strategies. Computability in Europe 2020, Jun 2020, Fisciano, Italy. pp.193-204, ⟨10.1007/978-3-030-51466-2_17⟩. ⟨hal-04479517⟩
Frédéric Blanqui. Type safety of rewrite rules in dependent types. FSCD 2020 - 5th International Conference on Formal Structures for Computation and Deduction, Jun 2020, Paris, France. pp.14, ⟨10.4230/LIPIcs.FSCD.2020.13⟩. ⟨hal-02981528⟩
Bruno Barras, Valentin Maestracci. Implementation of Two Layers Type Theory in Dedukti and Application to Cubical Type Theory. LFMPT 2020 - Logical Frameworks and Meta-Languages: Theory and Practice 2020, Jun 2020, Paris, France. ⟨hal-03138145⟩
Serge Haddad, Igor Khmelnitsky. Dynamic Recursive Petri Nets. PETRI NETS 2020 - 41st International Conference on Application and Theory of Petri Nets and Concurrency, Jun 2020, Paris, France. ⟨hal-02511321⟩
David Baelde, Stéphanie Delaune, Solène Moreau. A Method for Proving Unlinkability of Stateful Protocols. 33rd IEEE Computer Security Foundations Symposium, Jun 2020, Boston, United States. ⟨hal-02459984⟩
Sylvie Boldo, Diane Gallois-Wong, Thibault Hilaire. A Correctly-Rounded Fixed-Point-Arithmetic Dot-Product Algorithm. ARITH 2020 - IEEE 27th Symposium on Computer Arithmetic, Jun 2020, Portland, United States. pp.9-16, ⟨10.1109/ARITH48897.2020.00011⟩. ⟨hal-02982017⟩
Alexandre Gonzalvez. Affiner la déobfuscation symbolique et concrète de programmes protégés par des prédicats opaques. Cryptographie et sécurité [cs.CR]. Ecole nationale supérieure Mines-Télécom Atlantique, 2020. Français. ⟨NNT : 2020IMTA0187⟩. ⟨tel-02927808⟩
Hai Nguyen Van, Frédéric Boulanger, Burkhart Wolff. Timed Discrete-Event Simulation of Aviation Scenarios. SNE Simulation Notes Europe, 2020, 30 (2), pp.51-60. ⟨10.11128/sne.30.tn.10512⟩. ⟨hal-02881889⟩
Guillaume Burel. Linking focusing and resolution with selection. ACM Transactions on Computational Logic, 2020, 21 (3), pp.1-30. ⟨10.1145/3373276⟩. ⟨hal-02908808⟩
Sergiu Carpov, Caroline Fontaine, Damien Ligier, Renaud Sirdey. Illuminating the Dark or how to recover what should not be seen in FE-based classifiers. Proceedings on Privacy Enhancing Technologies, 2020, 2020 (2), pp.5-23. ⟨10.2478/popets-2020-0015⟩. ⟨hal-02413588⟩
David Oudart. Application de l'ingénierie dirigée par les modèles à la conception de Smart Grids : approche par cosimulation avec FMI. Modélisation et simulation. Institut Polytechnique de Paris, 2020. Français. ⟨NNT : 2020IPPAS002⟩. ⟨tel-03064950⟩
Adrien Le Coënt, Laurent Fribourg, Jonathan Vacher, Rafael Wisniewski. Probabilistic reachability and control synthesis for stochastic switched systems using the tamed Euler method. Nonlinear Analysis: Hybrid Systems, 2020, 36 (100860), ⟨10.1016/j.nahs.2020.100860⟩. ⟨hal-02987885⟩
Mathieu Roget, Stéphane Guillet, Pablo Arrighi, Di Molfetta Giuseppe. Grover Search as a Naturally Occurring Phenomenon. Physical Review Letters, 2020, 124 (18), pp.180501. ⟨10.1103/PhysRevLett.124.180501⟩. ⟨hal-03594726v2⟩
Benedikt Becker, Nicolas Jeannerod, Claude Marché, Yann Régis-Gianas, Mihaela Sighireanu, et al.. Analysing installation scenarios of Debian packages. TACAS 2020 - 26th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Apr 2020, The conference took place on-line, because it couldn't be held in Dublin, Ireland. pp.235-253, ⟨10.1007/978-3-030-45237-7_14⟩. ⟨hal-02355602v2⟩
Alain Finkel, Serge Haddad, Igor Khmelnitsky. Minimal Coverability Tree Construction Made Complete and Efficient. FoSSaCS 2020 - 23rd International Conference on Foundations of Software Science and Computation Structures, Apr 2020, Dublin, Ireland. ⟨hal-02479879⟩
Diego Diverio, Cláudio Lourenço, Claude Marché. You-Know-Why: an Early-Stage Prototype of a Key Server Developed using Why3. VerifyThis 2020 - Long-term Challenge, Apr 2020, Dublin, Ireland. pp.4--7. ⟨hal-03002187⟩
Matthias Függer, Manish Kushwaha, Thomas Nowak. Digital Circuit Design for Biological and Silicon Computers. Advances in Synthetic Biology, Springer Singapore, pp.153-171, 2020, ⟨10.1007/978-981-15-0081-7_9⟩. ⟨hal-02549707⟩
Anastasia Volkova, Thibault Hilaire, Christoph Lauter. Arithmetic approaches for rigorous design of reliable Fixed-Point LTI filters. IEEE Transactions on Computers, 2020, 69 (4), pp.489 - 504. ⟨10.1109/TC.2019.2950658⟩. ⟨hal-01918650v2⟩
Patrick Gardy, Patricia Bouyer, Nicolas Markey. Dependences in Strategy Logic. Theory of Computing Systems, 2020, 64 (3), pp.467-507. ⟨10.1007/s00224-019-09926-y⟩. ⟨hal-02917561⟩
Juraj Kolčák, Jérémy Dubut, Ichiro Hasuo, Shin-Ya Katsumata, David Sprunger, et al.. Relational Differential Dynamic Logic. TACAS 2020, Apr 2020, Dublin, Ireland. ⟨hal-02458085⟩
Jean Goubault-Larrecq. $\Pi^0_2$ Subsets of Domain-Complete Spaces and Countably Correlated Spaces. Topology Proceedings, 2020, pp.13-22. ⟨hal-03187687⟩
Dietmar Berwanger, Laurent Doyen. Observation and Distinction. Representing Information in Infinite Games. 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Mar 2020, Grenoble, France. ⟨10.4230/LIPIcs.STACS.2020.48⟩. ⟨hal-03081949⟩
Gabriel Hondet, Frédéric Blanqui. Encoding of Predicate Subtyping with Proof Irrelevance in the λΠ-Calculus Modulo Theory. TYPES 2020 - 26th International Conference on Types for Proofs and Programs, Mar 2020, Turino, Italy. ⟨10.4230/LIPIcs.TYPES.2020.6⟩. ⟨hal-03279766v2⟩
Georges-Axel Jaloyan, Claire Dross, Maroua Maalej, Yannick Moy, Andrei Paskevich. Verification of Programs with Pointers in SPARK. ICFEM 2020 - 22nd International Conference on Formal Engineering Methods, Mar 2020, Singapore / Virtual, Singapore. pp.55-72, ⟨10.1007/978-3-030-63406-3_4⟩. ⟨hal-03094566⟩
David Oudart, Jérôme Cantenot, Frédéric Boulanger, Sophie Chabridon. The smart grid simulation framework: model-driven engineering applied to cyber-physical systems. MODELSWARD 2020: 8th international conference on Model-Driven Engineering and Software Development, Feb 2020, Valletta, Malta. pp.3-25, ⟨10.1007/978-3-030-67445-8_1⟩. ⟨hal-03216723⟩
David Oudart, Jérôme Cantenot, Frédéric Boulanger, Sophie Chabridon. A model based toolchain for the cosimulation of cyber-physical systems with FMI. MODELSWARD 2020: 8th International Conference on Model-Driven Engineering and Software Development, Feb 2020, Valletta, Malta. pp.15-25, ⟨10.5220/0008875400150025⟩. ⟨hal-02530289⟩
Natasha Alechina, Stéphane Demri, Brian Logan. Parameterised Resource-Bounded ATL. The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, Feb 2020, New York, United States. ⟨hal-03005859⟩
Wanyun Su, Zhilin Wu, Mihaela Sighireanu. Deciding Separation Logic with Pointer Arithmetic and Inductive Definitions. 2020. ⟨hal-04481369⟩
Jean-Christophe Filliâtre. Mesurer la hauteur d'un arbre. JLFA 2020 - Journées Francophones des Langages Applicatifs, Jan 2020, Gruissan, France. ⟨hal-02315541v2⟩
Quentin Garchery, Chantal Keller, Claude Marché, Andrei Paskevich. Des transformations logiques passent leur certificat. JFLA 2020 - Journées Francophones des Langages Applicatifs, Jan 2020, Gruissan, France. ⟨hal-02384946v2⟩
Thierry Lecomte, David Déharbe, Denis Sabatier, Etienne Prun, Patrick Péronne, et al.. Low Cost High Integrity Platform: regular paper. ERTS 2020 - 10th European Congress on Embedded Real Time Systems, Jan 2020, Toulouse, France. ⟨hal-02446132⟩
Martin Clochard, Claude Marché, Andrei Paskevich. Deductive Verification with Ghost Monitors. POPL 2020 - 47th ACM SIGPLAN Symposium on Principles of Programming Languages, Jan 2020, New Orleans, United States. ⟨10.1145/3371070⟩. ⟨hal-02368284⟩
Stéphane Demri, Etienne Lozes, Alessio Mansutti. Internal Calculi for Separation Logic. Computer Science Logic, Jan 2020, Barcelona, Spain. ⟨10.4230/LIPIcs.CSL.2020.19⟩. ⟨hal-02883558⟩
Jean Goubault-Larrecq, Simon Halfon, Prateek Karandikar, K. Narayan Kumar, Philippe Schnoebelen. The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings. Well Quasi-Orders in Computation, Logic, Language and Reasoning, 53, Springer, pp.55-105, 2020, Trends in Logic, 978-3-030-30228-3. ⟨10.1007/978-3-030-30229-0_3⟩. ⟨hal-03083290⟩
Matthias Függer, Thomas Nowak, Kyrill Winkler. On the Radius of Nonsplit Graphs and Information Dissemination in Dynamic Networks. Discrete Applied Mathematics, 2020. ⟨hal-02946849⟩
Loïc Paulevé, Juraj Kolčák, Thomas Chatain, Stefan Haar. Reconciling Qualitative, Abstract, and Scalable Modeling of Biological Networks. Nature Communications, 2020, 11, ⟨10.1038/s41467-020-18112-5⟩. ⟨hal-02518582v2⟩
Gilles Dowek. Les réseaux condition nécessaire du confinement et nouvel outil de santé publique. 2020. ⟨hal-04054797⟩
Jean Goubault-Larrecq, Frédéric Mynard. Convergence without Points. Houston Journal of Mathematics, 2020, 46 (1), pp.227-282. ⟨hal-03185186⟩
Gilles Dowek, François Thiré. Logipedia: a multi-system encyclopedia of formal proofs. 2020. ⟨hal-04060141⟩
Rémy Chrétien, Véronique Cortier, Antoine Dallon, Stéphanie Delaune. Typing messages for free in security protocols. ACM Transactions on Computational Logic, 2020, 21 (1), ⟨10.1145/3343507⟩. ⟨hal-02268400⟩
Diane Gallois-Wong, Sylvie Boldo, Pascal Cuoq. Optimal Inverse Projection of Floating-Point Addition. Numerical Algorithms, In press, 83 (3), pp.957--986. ⟨10.1007/s11075-019-00711-z⟩. ⟨hal-01939097⟩
Mirna Džamonja, Sylvain Schmitz, Philippe Schnoebelen. On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders. Peter M. Schuster; Monika Seisenberger; Andreas Weiermann. Well-Quasi Orders in Computation, Logic, Language and Reasoning, 53, Springer, 2020, Trends in Logic, ⟨10.1007/978-3-030-30229-0_2⟩. ⟨halshs-01625981⟩
Benedikt Becker, Jean-Christophe Filliâtre, Claude Marché. Rapport d'avancement sur la vérification formelle des algorithmes de ParcourSup. [Rapport Technique] Université Paris-Saclay. 2020. ⟨hal-02447409⟩
Da-Jung Cho, Matthias Függer, Corbin Hopper, Manish Kushwaha, Thomas Nowak, et al.. Distributed Computation with Continual Population Growth. DISC 2020 - 34th International Symposium on DIStributed Computing, 2020, virtual, Germany. p. 1-17, ⟨10.4230/LIPIcs.DISC.2020.6⟩. ⟨hal-02946883⟩
Thomas Chatain, Stefan Haar, Juraj Kolčák, Loïc Paulevé, Aalok Thakkar. Concurrency in Boolean networks. Natural Computing, 2020, 19 (1), pp.91--109. ⟨10.1007/s11047-019-09748-4⟩. ⟨hal-01893106v2⟩
Vassil Todorov, Safouan Taha, Frédéric Boulanger, Armando Hernandez. Proving Properties of Discrete-Valued Functions Using Deductive Proof: Application to the Square Root. Modeling and Analysis of Information Systems, 2019, 26 (4), pp.520-533. ⟨10.18255/1818-1015-2019-4-520-533⟩. ⟨hal-02668283⟩
Mattias Roux. Extensions de l’algorithme d’atteignabilité arrière dans le cadre de la vérification de modèles modulo théories. Logique en informatique [cs.LO]. Université Paris Saclay (COmUE), 2019. Français. ⟨NNT : 2019SACLS582⟩. ⟨tel-02496033⟩
Wil M.P. van Der Aalst, Josep Carmona, Thomas Chatain, Boudewijn F. van Dongen. A Tour in Process Mining: From Practice to Algorithmic Challenges. LNCS Transactions on Petri Nets and Other Models of Concurrency, 2019, ⟨10.1007/978-3-662-60651-3_1⟩. ⟨hal-02419141⟩
Albin Coquereau. [ErgoFast] Amélioration de performances du solveur SMT Alt-Ergo grâce à l’intégration d’un solveur SAT efficace. Informatique et langage [cs.CL]. Université Paris-Saclay, 2019. Français. ⟨NNT : 2019SACLY007⟩. ⟨tel-02504894⟩
Florian Faissole. Formalisations d’analyses d’erreurs en analyse numérique et en arithmétique à virgule flottante. Logique en informatique [cs.LO]. Université Paris Saclay (COmUE), 2019. Français. ⟨NNT : 2019SACLS594⟩. ⟨tel-02470728⟩
Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar. Concurrent parameterized games. FSTTCS 2019 - 39th IARCS Annual Conference on. Foundations of Software Technology and Theoretical Computer Science, Dec 2019, Bombay, India. pp.1-15. ⟨hal-02351236⟩
Adnane Saoud, Elena A. Ivanova, Antoine Girard. Efficient Synthesis for Monotone Transition Systems and Directed Safety Specifications. 58th IEEE Conference on Decision and Control (CDC 2019), Dec 2019, Nice, France. ⟨10.1109/CDC40024.2019.9029784⟩. ⟨hal-02281945v2⟩
Alain Finkel, Ekanshdeep Gupta. The Well Structured Problem for Presburger Counter Machines. 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019), Arkadev Chattopadhyay; Paul Gastin, Dec 2019, Mumbai, India. ⟨hal-02305639⟩
Adrien Le Coënt, Laurent Fribourg. Guaranteed optimal reachability control of reaction-diffusion equations using one-sided Lipschitz constants and model reduction. 2019. ⟨hal-02193769v3⟩
Gaspard Ferey, Jean-Pierre Jouannaud. Confluence in (Un)Typed Higher-Order Theories by means of Critical Pairs. 2019. ⟨hal-02096540v3⟩
Juraj Kolčák, David Šafránek, Stefan Haar, Loïc Paulevé. Parameter Space Abstraction and Unfolding Semantics of Discrete Regulatory Networks. Theoretical Computer Science, 2019, 765, pp.120-144. ⟨10.1016/j.tcs.2018.03.009⟩. ⟨hal-01734805⟩
Stéphane Demri, Raul Fervari. The Power of Modal Separation Logics. Journal of Logic and Computation, 2019, 29 (8), pp.1139--1184. ⟨10.1093/logcom/exz019⟩. ⟨hal-03005862⟩
Nathalie Bertrand, Serge Haddad, Engel Lefaucheux. A Tale of Two Diagnoses in Probabilistic Systems. Information and Computation, 2019, 269, pp.1-33. ⟨10.1016/j.ic.2019.104441⟩. ⟨hal-02430814⟩
Gilbert Bergna-Diaz, Daniele Zonetti, Santiago Sanchez, Romeo Ortega, Elisabetta Tedeschi. PI Passivity-Based Control and Performance Analysis of MMC Multi-terminal HVDC Systems. IEEE Journal of Emerging and Selected Topics in Power Electronics, 2019, 7 (4), pp.2453-2466. ⟨10.1109/JESTPE.2018.2889152⟩. ⟨hal-02419459⟩
Alain Finkel, Serge Haddad, Igor Khmeniltsky. Réification des accélérations pour la construction de Karp et Miller. Modélisation des Systèmes Réactifs (MSR 19), Nov 2019, Angers, France, Nov 2019, Angers, France. ⟨hal-02431913⟩
Alain Finkel, Serge Haddad, Igor Khmelnitsky. Réification des accélérations pour la construction de Karp et Miller. MSR 2019 - 12ème Colloque sur la Modélisation des Systèmes Réactifs, Nov 2019, Angers, France. ⟨hal-02319755⟩
Lina Ye, Philippe Dague, Lulu He. Manifestability Verification of Discrete Event Systems. DX 2019 - 30th International Workshop on Principles of Diagnosis, Nov 2019, Klagenfurt, Austria. pp.1-9. ⟨hal-02425146⟩
Sylvain Conchon, Mattias Roux. Reasoning about Universal Cubes in MCMT. ICFEM 2019 - 21st International Conference on Formal Engineering Methods, Nov 2019, Shenzhen, China. pp.270--285. ⟨hal-02420588⟩
Patricia Bouyer. A Note on Game Theory and Verification. 17th International Symposium Automated Technology for Verification and Analysis (ATVA'19), Oct 2019, Taipei, Taiwan. pp.3-22, ⟨10.1007/978-3-030-31784-3_1⟩. ⟨hal-02352524⟩
Nicolas Jeannerod, Claude Marché, Yann Régis-Gianas, Mihaela Sighireanu, Ralf Treinen. Specification of UNIX Utilities. [Technical Report] ANR. 2019. ⟨hal-02321691⟩
Benedikt Becker, Nicolas Jeannerod, Claude Marché, Ralf Treinen. Revision 2 of CoLiS language: formal syntax, semantics, concrete and symbolic interpreters. [Technical Report] ANR. 2019. ⟨hal-02321743⟩
Patricia Bouyer. On the computation of Nash equilibria in games on graphs. 26th International Symposium on Temporal Representation and Reasoning (TIME'19), Oct 2019, Málaga, Spain. ⟨10.4230/LIPIcs.CVIT.2016.23⟩. ⟨hal-02352529⟩
David Baelde, Amy Felty, Gopalan Nadathur, Alexis Saurin. A special issue on structural proof theory, automated reasoning and computation in celebration of Dale Miller’s 60th birthday. Mathematical Structures in Computer Science, 29 (8), pp.1007-1008, 2019, ⟨10.1017/S0960129519000136⟩. ⟨hal-02408211⟩
Arthur Charguéraud, Jean-Christophe Filliâtre, Cláudio Lourenço, Mário Pereira. GOSPEL -Providing OCaml with a Formal Specification Language. FM 2019 - 23rd International Symposium on Formal Methods, Oct 2019, Porto, Portugal. ⟨hal-02157484v2⟩
Adnane Saoud. Compositional and Efficient Controller Synthesis for Cyber-Physical Systems. Automatic. Université Paris Saclay (COmUE), 2019. English. ⟨NNT : 2019SACLC076⟩. ⟨tel-02317723⟩
Susanna Donatelli, Serge Haddad. Autonomous Transitions Enhance CSLTA Expressiveness and Conciseness. [Research Report] Inria Saclay Ile de France; LSV, ENS Cachan, CNRS, INRIA, Université Paris-Saclay, Cachan (France); Universita degli Studi di Torino. 2019. ⟨hal-02306021⟩
Adrien Koutsos. Preuves symboliques de propriétés d’indistinguabilité calculatoire. Informatique et langage [cs.CL]. Université Paris Saclay (COmUE), 2019. Français. ⟨NNT : 2019SACLN029⟩. ⟨tel-02317745⟩
Samy Jaziri. Automate sur les structures temporisée. Automatique. Université Paris Saclay (COmUE), 2019. Français. ⟨NNT : 2019SACLN039⟩. ⟨tel-02384274⟩
Guillaume Burel, Guillaume Bury, Raphaël Cauderlier, David Delahaye, Pierre Halmagrand, et al.. First-order automated reasoning with theories: when deduction modulo theory meets practice. Journal of Automated Reasoning, 2019, 64 (6), pp.1001-1050. ⟨10.1007/s10817-019-09533-z⟩. ⟨hal-02305831⟩
Hugues Mandon, Cui Su, Stefan Haar, Jun Pang, Loïc Paulevé. Sequential Reprogramming of Boolean Networks Made Practical. CMSB 2019 - 17th International Conference on Computational Methods in Systems Biology, Sep 2019, Trieste, France. pp.3--19, ⟨10.1007/978-3-030-31304-3_1⟩. ⟨hal-02178917v2⟩
Daniele Zonetti, Adnane Saoud, Antoine Girard, Laurent Fribourg. Decentralized monotonicity-based voltage control of DC microgrids with ZIP loads. NecSys 2019 - 8th IFAC Workshop on Distributed Estimation and Control in Networked Systems, Sep 2019, Chicago, United States. ⟨10.1016/j.ifacol.2019.12.148⟩. ⟨hal-02208665⟩
Julien Lopez. Breaking boundaries between programming languages and databases. Databases [cs.DB]. Université Paris Saclay (COmUE), 2019. English. ⟨NNT : 2019SACLS235⟩. ⟨tel-02309327⟩
Mathilde Boltenhagen, Thomas Chatain, Josep Carmona. Encoding Conformance Checking Artefacts in SAT. BPI 2019 - 15th International Workshop on Business Process Intelligence, Sep 2019, Wien, Austria. ⟨hal-02419980⟩
Matthias Függer, Robert Najvirt, Thomas Nowak, Ulrich Schmid. A Faithful Binary Circuit Model. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2019, ⟨10.1109/TCAD.2019.2937748⟩. ⟨hal-02395251⟩
Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar. Reconfiguration and message losses in parameterized broadcast networks. CONCUR 2019 - 30th International Conference on Concurrency Theory, Aug 2019, Amsterdam, Netherlands. pp.1 - 15, ⟨10.4230/LIPIcs.CONCUR.2019.32⟩. ⟨hal-02191382⟩
Léo Andrès. Vérification par preuve formelle de propriétés fonctionnelles d'algorithme de classification. [Rapport de recherche] Université Paris Sud (Paris 11) - Université Paris Saclay. 2019. ⟨hal-02421484⟩
Alain Finkel, M. Praveen. Verification of Flat FIFO Systems. CONCUR 2019, Aug 2019, AMSTERDAM, Netherlands. ⟨hal-02267453⟩
Mauricio Gonzalez, Patricia Bouyer, Samson Lasaulce, Nicolas Markey. Optimisation en présence de contraintes en probabilité et processus markoviens contrôlés. GRETSI 2019 - XXVIIème Colloque francophone de traitement du signal et des images, Aug 2019, Lille, France. pp.1-4. ⟨hal-02268161⟩
Mohamed Yacine El Haddad, Guillaume Burel, Frédéric Blanqui. Ekstrakto A tool to reconstruct Dedukti proofs from TSTP files (extended abstract). PxTP 2019 - Sixth Workshop on Proof eXchange for Theorem Proving (PxTP), Aug 2019, Natal, Brazil. pp.27-35, ⟨10.4204/EPTCS.301.5⟩. ⟨hal-02200548⟩
Paul Gastin, Amaldev Manuel, R. Govind. Logics for Reversible Regular Languages and Semigroups with Involution. Developments in Language Theory (DLT'19), Aug 2019, WARSAW, Poland. pp.182-191, ⟨10.1007/978-3-030-24886-4_13⟩. ⟨hal-04539835⟩
Jean Goubault-Larrecq. Formal ball monads. Topology and its Applications, 2019, 263, pp.372-391. ⟨10.1016/j.topol.2019.06.044⟩. ⟨hal-03189480⟩
Vassil Todorov, Safouan Taha, Frédéric Boulanger, Armando Hernandez. Improved Invariant Generation for Industrial Software Model Checking of Time Properties. 2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS), Jul 2019, Sofia, Bulgaria. pp.334-341, ⟨10.1109/QRS.2019.00050⟩. ⟨hal-02322576⟩
Benedikt Becker, Claude Marché. Ghost Code in Action: Automated Verification of a Symbolic Interpreter. VSTTE 2019 - 11th Working Conference on Verified Software: Tools, Techniques and Experiments, Jul 2019, New York, United States. ⟨10.1007/978-3-030-41600-3_8⟩. ⟨hal-02276257⟩
Anthony Lick. Logique de requêtes à la XPath : systèmes de preuve et pertinence pratique. Logique en informatique [cs.LO]. Université Paris Saclay (COmUE), 2019. Français. ⟨NNT : 2019SACLN016⟩. ⟨tel-02276423⟩
Daniel Ohlinger, Jürgen Maier, Matthias Függer, Ulrich Schmid. The Involution Tool for Accurate Digital Timingand Power Analysis. PATMOS 2019 - 29th International Symposium on Power and Timing Modeling, Optimization and Simulation, Jul 2019, Rhodes, Greece. ⟨10.1109/PATMOS.2019.8862165⟩. ⟨hal-02395242⟩
Sylvain Schmitz. The Parametric Complexity of Lossy Counter Machines. ICALP 2019, Jul 2019, Patras, Greece. pp.129:1--129:15, ⟨10.4230/LIPIcs.ICALP.2019.129⟩. ⟨hal-02020728v2⟩
Francesco Belardinelli, Stephane Demri. Resource-bounded ATL : the Quest for Tractable Fragments En quête de fragments mécanisables pour ATL avec ressources Keywords Logics for agents and multi-agent systems, verification techniques for multi-agent systems, model-checking, vec- tor addition systems with states. Conférence Nationale en Intelligence Artificielle, Jul 2019, Toulouse, France. ⟨hal-02328812⟩
David Baelde, Anthony Lick, Sylvain Schmitz. Decidable XPath Fragments in the Real World. 38th ACM Symposium on Principles of Database Systems (PODS'19), Jun 2019, Amsterdam, Netherlands. ⟨10.1145/3294052.3319685⟩. ⟨hal-01852475⟩
Guillaume Genestier. SizeChangeTool: A Termination Checker for Rewriting Dependent Types. HOR 2019 - 10th International Workshop on Higher-Order Rewriting, Jun 2019, Dortmund, Germany. pp.14-19. ⟨hal-02442465⟩
Anthony Lick. A Hypersequent Calculus with Clusters for Data Logic over Ordinals. 2019. ⟨hal-02165359⟩
Zohra Kader, Adnane Saoud, Antoine Girard. Safety controller design for incrementally stable switched systems using event-based symbolic models. ECC 2019 - European Control Conference, Jun 2019, Naples, Italy. ⟨10.23919/ECC.2019.8796232⟩. ⟨hal-02054930⟩
Adrien Koutsos. Decidability of a Sound Set of Inference Rules for Computational Indistinguishability. 2019 IEEE 32nd Computer Security Foundations Symposium (CSF), Jun 2019, Hoboken, France. pp.48-4813, ⟨10.1109/CSF.2019.00011⟩. ⟨hal-04392610⟩
Gilles Barthe, Benjamin Grégoire, Charlie Jacomme, Steve Kremer, Pierre-Yves Strub. Symbolic Methods in Computational Cryptography Proofs. CSF2019 - 32nd IEEE Computer Security Foundations Symposium, Jun 2019, Hoboken, United States. pp.136-13615, ⟨10.1109/CSF.2019.00017⟩. ⟨hal-02404701⟩
Daniele Zonetti, Adnane Saoud, Antoine Girard, Laurent Fribourg. A symbolic approach to voltage stability and power sharing in time-varying DC microgrids. ECC 2019 - European control conference, Jun 2019, Naples, Italy. ⟨10.23919/ecc.2019.8796095⟩. ⟨hal-02070070⟩
Frédéric Blanqui, Guillaume Genestier, Olivier Hermant. Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting. FSCD 2019 - 4th International Conference on Formal Structures for Computation and Deduction, Jun 2019, Dortmund, Germany. ⟨10.4230/LIPIcs.FSCD.2019.9⟩. ⟨hal-01943941v4⟩
S. Akshay, Paul Gastin, Vincent Juge, Shankara Narayanan Krishna. Timed Systems through the Lens of Logic. 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2019, Vancouver, Canada. ⟨10.1109/LICS.2019.8785684⟩. ⟨hal-03185736⟩
Alejandro Díaz-Caro, Gilles Dowek. Proof Normalisation in a Logic Identifying Isomorphic Propositions. FSCD 2019 - International Conference on Formal Structures for Computation and Deduction, Jun 2019, Dortmund, Germany. ⟨hal-02909135⟩
Bartosz Bednarczyk, Stéphane Demri. Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard?. 34th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'19), Jun 2019, Vancouver, France. ⟨10.1109/LICS.2019.8785656⟩. ⟨hal-02350328⟩
Alain Finkel, Serge Haddad, Igor Khmelnitsky. Coverability and Termination in Recursive Petri Nets. Petri Nets 2019 / ACSD 2019 - 40th International Conference on Application and Theory of Petri Nets and Concurrency, Jun 2019, Aachen, Germany. ⟨hal-02081019⟩
Mathilde Boltenhagen, Thomas Chatain, Josep Carmona. Generalized Alignment-Based Trace Clustering of Process Behavior. Petri Nets 2019 / ACSD 2019 - 40th International Conference on Application and Theory of Petri Nets and Concurrency, Jun 2019, Aachen, Germany. ⟨hal-02176771⟩
François Thiré. Cumulative Types Systems and Levels. LFMTP 2019 - Logical Frameworks and Meta-Languages: Theory and Practice, Jun 2019, Vancouver, Canada. ⟨hal-02150179⟩
Adrien Koutsos. The 5G-AKA Authentication Protocol Privacy. EuroS&P 2019 - IEEE European Symposium on Security and Privacy, Jun 2019, Stockholm, Sweden. pp.464-479, ⟨10.1109/EuroSP.2019.00041⟩. ⟨hal-03155483⟩
Florian Faissole. Formalisation en Coq des erreurs d'arrondi de méthodes de Runge-Kutta pour les systèmes matriciels. AFADL 2019 - 18e journées Approches Formelles dans l'Assistance au Développement de Logiciels, Jun 2019, Toulouse, France. ⟨hal-02391924⟩
Christophe Chareton, Sébastien Bardin, François Bobot, Valentin Perelle, Benoît Valiron. Qbricks, un environnement pour la vérification formelle en informatique quantique *. 18e journées Approches Formelles dans l'Assistance au Développement de Logiciels, Jun 2019, Toulouse, France. ⟨hal-02175079⟩
Frédéric Blanqui, Guillaume Genestier, Olivier Hermant. Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting. TYPES 2019 - 25th International Conference on Types for Proofs and Programs, Jun 2019, Oslo, Norway. pp.30-31. ⟨hal-02442484⟩
Thibault Hilaire, Hacène Ouzia, Benoit Lopez. Optimal Word-Length Allocation for the Fixed-Point Implementation of Linear Filters and Controllers. ARITH 2019 - IEEE 26th Symposium on Computer Arithmetic, Jun 2019, Kyoto, Japan. pp.175-182, ⟨10.1109/ARITH.2019.00040⟩. ⟨hal-02393851⟩
Lucca Hirschi, David Baelde, Stéphanie Delaune. A method for unbounded verification of privacy-type properties. Journal of Computer Security, 2019, 27 (3), pp.277-342. ⟨10.3233/JCS-171070⟩. ⟨hal-02368832⟩
Guillaume Melquiond, Raphaël Rieu-Helft. Formal Verification of a State-of-the-Art Integer Square Root. ARITH-26 2019 - 26th IEEE 26th Symposium on Computer Arithmetic, Jun 2019, Kyoto, Japan. pp.183-186, ⟨10.1109/ARITH.2019.00041⟩. ⟨hal-02092970⟩
Cláudio Belo Lourenço, Maria João Frade, Jorge Sousa Pinto. A Generalized Program Verification Workflow Based on Loop Elimination and SA Form. FormaliSE 2019 - 7th International Conference on Formal Methods in Software Engineering, May 2019, Montreal, Canada. ⟨hal-02431769⟩
Francesco Belardinelli, Stephane Demri. Resource-bounded ATL: the Quest for Tractable Fragments. 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2019, May 2019, Montreal, Canada. pp.206--214. ⟨hal-02362636⟩
Jürgen Maier, Matthias Függer, Thomas Nowak, Ulrich Schmid. Transistor-Level Analysis of Dynamic Delay Models. ASYNC 2019 - 25th IEEE International Symposium on Asynchronous Circuits and Systems, May 2019, Hirosaki, Japan. pp.76-85, ⟨10.1109/ASYNC.2019.00019⟩. ⟨hal-02395229⟩
Stephane Demri, Raul Fervari, Alessio Mansutti. Axiomatising logics with separating conjunctions and modalities. 16th European Conference on Logics in Artificial Intelligence (JELIA'19), May 2019, Rende, Italy. ⟨10.1007/978-3-030-19570-0_45⟩. ⟨hal-02362648⟩
David Baelde, Anthony Lick, Sylvain Schmitz. XPath Parser. 2019, ⟨swh:1:dir:081194c82832b17c4d1229313e85753dfb3ec4cd;origin=https://hal.archives-ouvertes.fr/hal-02079276;visit=swh:1:snp:c65e2c93c0e93ba5789ad3560b50492c942776ff;anchor=swh:1:rev:bac735336055e1e5fe24e87d33b42a802112e7df;path=/⟩. ⟨hal-02079276⟩
Mihaela Sighireanu, Juan Navarro Pérez, Andrey Rybalchenko, Nikos Gorogiannis, Radu Iosif, et al.. SL-COMP: Competition of Solvers for Separation Logic. Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Apr 2019, Prague, Czech Republic. pp.116-132, ⟨10.1007/978-3-030-17502-3_8⟩. ⟨hal-02388022⟩
Florian Steinberg, Laurent Théry, Holger Thies. Quantitative continuity and computable analysis in Coq. 2019. ⟨hal-02088293⟩
Anastasia Volkova, Matei Istoan, Florent de Dinechin, Thibault Hilaire. Towards Hardware IIR Filters Computing Just Right: Direct Form I Case Study. IEEE Transactions on Computers, 2019, 68 (4), pp.597 - 608. ⟨10.1109/TC.2018.2879432⟩. ⟨hal-01561052v3⟩
Guillaume Melquiond. Formal Verification for Numerical Computations, and the Other Way Around. Computer Arithmetic. Université Paris Sud, 2019. ⟨tel-02194683⟩
Anthony Lick, David Baelde, Sylvain Schmitz. XPath Benchmark. 2019, ⟨swh:1:dir:1ea68cf5bb3f9f3f2fe8c7995f1802ebadf17fb5;origin=https://hal.archives-ouvertes.fr/hal-02079114;visit=swh:1:snp:7c7faf214f78660c34ea8392a4748f22faf7b432;anchor=swh:1:rev:39b305d6b703c1d2c2557d8c7aa1ae27a5d9e6a6;path=/⟩. ⟨hal-02079114⟩
Adrien Le Coënt, Laurent Fribourg. Controlled Recurrence of a Biped with Torso. 2019. ⟨hal-02076800⟩
Adrien Le Coënt, Laurent Fribourg. Guaranteed Control of Sampled Switched Systems using Semi-Lagrangian Schemes and One-Sided Lipschitz Constants. 2019. ⟨hal-02066896⟩
Florian Steinberg, Holger Thies. Some formal proofs of isomorphy and discontinuity. MLA 2019 - Third Workshop on Mathematical Logic and its Applications, Mar 2019, Nancy, France. ⟨hal-02019174⟩
David Oudart, Jérôme Cantenot, Frédéric Boulanger, Sophie Chabridon. An approach to design smart grids and their IT system by cosimulation. MODELSWARD 2019: 7th International Conference on Model-Driven Engineering and Software Development, Feb 2019, Prague, Czech Republic. pp.372 - 379, ⟨10.5220/0007407003720379⟩. ⟨hal-02070535⟩
Assia Mahboubi, Guillaume Melquiond, Thomas Sibut-Pinote. Formally Verified Approximations of Definite Integrals. Journal of Automated Reasoning, 2019, 62 (2), pp.281-300. ⟨10.1007/s10817-018-9463-7⟩. ⟨hal-01630143v2⟩
Valentin Blot, Amina Bousalem, Quentin Garchery, Chantal Keller. SMTCoq: automatisation expressive et extensible dans Coq. JFLA 2019 - Journées Francophones des Langages Applicatifs, Jan 2019, Les Rousses, France. ⟨hal-02369249⟩
Guillaume Melquiond. Arithmétique des Ordinateurs et Preuves Formelles. JFLA 2019 - 30èmes Journées Francophones des Langages Applicatifs, Jan 2019, Les Rousses, France. ⟨hal-02013540⟩
Diane Gallois-Wong. Formalisation en Coq d'algorithmes de filtres numériques. JFLA 2019 - Journées Francophones des Langages Applicatifs, Nicolas Magaud, Jan 2019, Les Rousses, France. ⟨hal-01929531v2⟩
Raphaël Rieu-Helft. Un mécanisme de preuve par réflexion pour Why3 et son application aux algorithmes de GMP. JFLA 2019 - 30èmes Journées Francophones des Langages Applicatifs, Jan 2019, Rousses, France. ⟨hal-01943010⟩
Simon Colin, Rodolphe Lepigre, Gabriel Scherer. Unboxing Mutually Recursive Type Definitions in OCaml. JFLA 2019 - 30 èmes journées francophones des langages applicatifs, Jan 2019, Les Rousses, France. ⟨hal-01929508⟩
Marieke Huisman, Rosemary Monahan, Peter Müller, Andrei Paskevich, Gidon Ernst. VerifyThis 2018: A Program Verification Competition. [Research Report] Université Paris-Saclay. 2019. ⟨hal-01981937⟩
Véronique Benzaken, Évelyne Contejean. A Coq Mechanised Formal Semantics for Realistic SQL Queries: Formally Reconciling SQL and Bag Relational Algebra. CPP 19, ACM, Jan 2019, Cascais, Portugal. pp.249-261, ⟨10.1145/3293880.3294107⟩. ⟨hal-01955433⟩
Stefan Haar, Juraj Kolčák, Loïc Paulevé. Combining Refinement of Parametric Models with Goal-Oriented Reduction of Dynamics. VMCAI 2019 - 20th International Conference on Verification, Model Checking, and Abstract Interpretation, Jan 2019, Lisbon, Portugal. pp.555-576, ⟨10.1007/978-3-030-11245-5_26⟩. ⟨hal-01940174⟩
Frédéric Gilbert. Verifiable certificates for predicate subtyping. 2019. ⟨hal-01977585⟩
Guillaume Bury. Integrating rewriting, tableau and superposition into SMT. Automatic Control Engineering. Université Sorbonne Paris Cité, 2019. English. ⟨NNT : 2019USPCC036⟩. ⟨tel-02612985⟩
Gilles Dowek. Two consequences of the hypothesis that we are within the world. 2019. ⟨hal-04055137⟩
Hugues Mandon, Cui Su, Jun Pang, Soumya Paul, Stefan Haar, et al.. Algorithms for the Sequential Reprogramming of Boolean Networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2019, 16 (5), pp.1610-1619. ⟨10.1109/TCBB.2019.2914383⟩. ⟨hal-02113864⟩
Jean Goubault-Larrecq. Spaces with no Infinite Discrete Subspace. Topology Proceedings, 2019, 53. ⟨hal-01804970⟩
Raphaël Rieu-Helft. A Why3 proof of GMP algorithms. Journal of Formalized Reasoning, 2019, ⟨10.6092/issn.1972-5787/9730⟩. ⟨hal-02477578⟩
Alejandro Díaz-Caro, Gilles Dowek, Juan Pablo Rinaldi. Two linearities for quantum computing in the lambda calculus. BioSystems, 2019. ⟨hal-02909128⟩
Denis Kuperberg, Anirban Majumdar. Computing the Width of Non-deterministic Automata. Logical Methods in Computer Science, 2019, 15, ⟨10.23638/LMCS-15(4:10)2019⟩. ⟨hal-02383115⟩
Gilles Dowek. Instinct, language, and artificial intelligence. 2019. ⟨hal-04054594⟩
Philippe Dague, Lulu He, Lina Ye. How to be sure a faulty system does not always appear healthy?: Fault manifestability analysis for discrete event and timed systems. Innovations in Systems and Software Engineering, In press, ⟨10.1007/s11334-019-00357-z⟩. ⟨hal-02425142⟩
Quentin Bouillaguet, Francois Bobot, Mihaela Sighireanu, Boris Yakobowski. Exploiting pointer analysis in memory models for deductive verification. Lecture Notes in Computer Science, 2019, 11388, pp.160-182. ⟨10.1007/978-3-030-11245-5_8⟩. ⟨cea-04491532⟩
Gilles Dowek. How the physical Church-Turing thesis changed the concept of machine. 2019. ⟨hal-04054606⟩
Vassil Todorov, Safouan Taha, Frédéric Boulanger, Armando Hernandez. PROVING PROPERTIES OF DISCRETE-VALUED FUNCTIONS USING DEDUCTIVE PROOF: APPLICATION TO THE SQUARE ROOT. System Informatics, 2019, 14, ⟨10.31144/si.2307-6410.2019.n14.p45-54⟩. ⟨hal-02322645⟩
Sylvie Boldo, Florian Faissole, Alexandre Chapoutot. Round-off error and exceptional behavior analysis of explicit Runge-Kutta methods. IEEE Transactions on Computers, 2019, ⟨10.1109/TC.2019.2917902⟩. ⟨hal-01883843v3⟩
Ying Jiang, Jian Liu, Gilles Dowek, Kailiang Ji. Towards Combining Model Checking and Proof Checking. The Computer Journal, In press, ⟨10.1093/comjnl/bxy112⟩. ⟨hal-01970274⟩
Georges Ouffoué Ouffoué. Attack tolerance for services-based applications in the Cloud. Web. Université Paris Saclay (COmUE), 2018. English. ⟨NNT : 2018SACLS562⟩. ⟨tel-02422395⟩
Slim Medimegh. Analyse formelle de spécifications hybrides à partir de modèles SysML pour la validation fonctionnelle des systèmes embarqués. Autre. Université Paris Saclay (COmUE), 2018. Français. ⟨NNT : 2018SACLC093⟩. ⟨tel-02017872⟩
Adnane Saoud, Antoine Girard, Laurent Fribourg. Contract Based Design of Symbolic Controllers for Interconnected Multiperiodic Sampled-Data Systems. 57th IEEE Conference on Decision and Control (CDC 2018), Dec 2018, Miami Beach, FL, United States. ⟨10.1109/CDC.2018.8619099⟩. ⟨hal-01857389⟩
Mário José Parreira Pereira. Tools and Techniques for the Verification of Modular Stateful Code. Logic in Computer Science [cs.LO]. Université Paris Saclay (COmUE), 2018. English. ⟨NNT : 2018SACLS605⟩. ⟨tel-01980343⟩
Béatrice Bérard, Stefan Haar, Loïc Hélouët. Hyper Partial Order Logic. FSTTCS 2018 - Foundations of Software Technology and Theoretical Computer Science, Dec 2018, Ahmedabad, India. pp.20:1--20:21, ⟨10.4230/LIPIcs.FSTTCS.2018.20⟩. ⟨hal-01884390⟩
David Baelde, Anthony Lick, Sylvain Schmitz. A Hypersequent Calculus with Clusters for Tense Logic over Ordinals. FSTTCS 2018 - 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2018, Ahmedabad, India. pp.15:1--15:19, ⟨10.4230/LIPIcs.FSTTCS.2018.15⟩. ⟨hal-01852077v2⟩
Alain Finkel, Jérôme Leroux, Grégoire Sutre. Reachability for Two-Counter Machines with One Test and One Reset. FSTTCS 2018 - 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2018, Ahmedabad, India. pp.31:1-31:14, ⟨10.4230/LIPIcs.FSTTCS.2018.31⟩. ⟨hal-01848554v2⟩
Adrien Le Coënt, Julien Alexandre Dit Sandretto, Alexandre Chapoutot, Laurent Fribourg. An improved algorithm for the control synthesis of nonlinear sampled switched systems. Formal Methods in System Design, 2018, 53 (3), pp.363-383. ⟨10.1007/s10703-017-0305-8⟩. ⟨hal-01399337v2⟩
Antoine Dallon. Vérification de propriétés d'indistinguabilité pour les protocoles cryptographiques. Autre [cs.OH]. Université Paris Saclay (COmUE), 2018. Français. ⟨NNT : 2018SACLN044⟩. ⟨tel-01949500⟩
Yann Duplouy. Applying Formal Methods to Autonomous Vehicle Control. Mathematical Software [cs.MS]. Université Paris Saclay (COmUE), 2018. English. ⟨NNT : 2018SACLN048⟩. ⟨tel-01960966⟩
Nachum Dershowitz, Jean-Pierre Jouannaud. Graph Path Orderings. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Nov 2018, Awassa, Ethiopia. pp.1-18. ⟨hal-01903086⟩
Stephane Demri. Reasoning about reversal-bounded counter machines. Ewa Orlowska on Relational Methods in Logic and Computer Science, volume 17 of Outstanding Contributions to Logic, Springer, 2018., pp.441--479, 2018, ⟨10.1007/978-3-319-97879-6_17⟩. ⟨hal-02366668⟩
Patricia Bouyer, Samy Jaziri, Nicolas Markey. Efficient timed diagnosis using automata with timed domains. RV 2018 - 18th International Conference on Runtime Verification, Nov 2018, Limassol, Cyprus. pp.205-221, ⟨10.1007/978-3-030-03769-7_12⟩. ⟨hal-01889030⟩
Fabrice Kordon, Hubert Garavel, Lom Hillah, Emmanuel Paviot-Adet, Loïg Jezequel, et al.. MCC’2017 - The Seventh Model Checking Contest. LNCS Transactions on Petri Nets and Other Models of Concurrency, 11090, pp.181-209, 2018, Lecture Notes in Computer Science, ⟨10.1007/978-3-662-58381-4_9⟩. ⟨hal-01917492⟩
Sylvain Schmitz. Systèmes de preuve : Notes de révision pour l'agrégation. Master. Préparation à l'agrégation de mathématiques, option informatique, France. 2018. ⟨cel-01903833⟩
Matthias Függer, Thomas Nowak. Fast Multidimensional Asymptotic and Approximate Consensus. International Symposium on DIStributed Computing (DISC) 2018, Oct 2018, New Orleans, United States. ⟨10.4230/LIPIcs.DISC.2018.27⟩. ⟨hal-01936316⟩
Gilles Barthe, Xiong Fan, Joshua Gancher, Benjamin Grégoire, Charlie Jacomme, et al.. Symbolic Proofs for Lattice-Based Cryptography. CCS 2018 - Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security Canada, October 15-19, 2018, Oct 2018, Toronto, Canada. pp.538-555, ⟨10.1145/3243734.3243825⟩. ⟨hal-01959391v2⟩
Damien Ligier. Functional encryption applied to privacy-preserving classification : practical use, performances and security. Cryptography and Security [cs.CR]. Ecole nationale supérieure Mines-Télécom Atlantique, 2018. English. ⟨NNT : 2018IMTA0040⟩. ⟨tel-02389839⟩
Stephane Demri. On Temporal and Separation Logics. 25th International Symposium on Temporal Representation and Reasoning, TIME 2018, Warsaw, Poland., Oct 2018, Varsovie, Poland. pp.1:1--1:4, ⟨10.4230/LIPIcs.TIME.2018.1⟩. ⟨hal-02366656⟩
Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder. Round-Bounded Control of Parameterized Systems. 16th International Symposium on Automated Technology for Verification and Analysis (ATVA 2018), Oct 2018, Los Angeles, California, United States. pp.370-386, ⟨10.1007/978-3-030-01090-4_22⟩. ⟨hal-01849206⟩
Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Etienne Lozes. Multi-buffer simulations: Decidability and complexity. Information and Computation, 2018, 262, pp.280 - 310. ⟨10.1016/j.ic.2018.09.008⟩. ⟨hal-01920584⟩
Martin Clochard, Andrei Paskevich, Claude Marché. Deductive Verification via Ghost Debugging. [Research Report] RR-9219, Inria Saclay Ile de France. 2018. ⟨hal-01907894⟩
Sylvain Schmitz. Logique propositionnelle : Notes de révision pour l'agrégation. Master. Préparation à l'agrégation de mathématiques, option informatique, France. 2018. ⟨cel-01903823⟩
Hai Nguyen Van. Formalizing Time and Causality in Polychronous Polytimed Models. Modeling and Simulation. Université Paris Saclay (COmUE), 2018. English. ⟨NNT : 2018SACLS282⟩. ⟨tel-01892649⟩
Frédéric Boulanger, Dominique Marcadet, Martin Rayrole, Benoît Valiron, Safouan Taha. A time synchronization protocol for A664-P7. Digital Avionics Systems Conference, Sep 2018, London, United Kingdom. ⟨hal-01890134⟩
Patricia Bouyer, Mauricio Gonzalez, Nicolas Markey, Mickaël Randour. Multi-weighted Markov Decision Processes with Reachability Objectives. Gandalf 2018 - Ninth International Symposium on Games, Automata, Logics, and Formal Verification, Sep 2018, Sarrebruck, Germany. pp.250 - 264, ⟨10.4204/EPTCS.277.18⟩. ⟨hal-01889020⟩
Lina Ye, Philippe Dague, Delphine Longuet, Laura Brandán Briones, Agnes Madalinski. How to be Sure a Faulty System Does not Always Appear Healthy?. 12th International Conference on Verification and Evaluation of Computer and Communication Systems, Sep 2018, Grenoble, France. ⟨hal-01818314⟩
Nathan Grosshans. The limits of Nečiporuk's method and the power of programs over monoids taken from small varieties of finite monoids. Other [cs.OH]. Université Paris Saclay (COmUE); Université de Montréal, 2018. English. ⟨NNT : 2018SACLN028⟩. ⟨tel-01935719⟩
David Declerck. Vérification par model-checking de programmes concurrents paramétrés sur des modèles mémoires faibles. Langage de programmation [cs.PL]. Université Paris Saclay (COmUE), 2018. Français. ⟨NNT : 2018SACLS336⟩. ⟨tel-01900842⟩
Engel Lefaucheux. Controlling information in Probabilistic Systems. Computer Science [cs]. Université Rennes 1, 2018. English. ⟨NNT : ⟩. ⟨tel-01946840⟩
Slim Medimegh, Jean-Yves Pierron, Frédéric Boulanger. A New Qualitative Language for Qualitative Simulation. International Symposium on Computer Science and Intelligent Control, Sep 2018, Stockholm, Sweden. ⟨hal-01890473⟩
Jean-Christophe Filliâtre. Parcours d'un informaticien. Séminaires Pour Tous, École Normale Supérieure - Paris, Sep 2018, Paris, France. ⟨hal-04524016⟩
Da-Jung Cho, Yo-Sub Han, Hwee Kim, Kai Salomaa. Site-Directed Deletion. 22nd International Conference on Developments in Language Theory (DLT 2018), Sep 2018, Tokyo, Japan. ⟨hal-01937635⟩
Véronique Cortier, Antoine Dallon, Stéphanie Delaune. Efficiently deciding equivalence for standard primitives and phases. ESORICS 2018 - 23rd European Symposium on Research in Computer Security, Sep 2018, Barcelona, Spain. ⟨hal-01900083⟩
Guillaume Burel. Linking focusing and resolution with selection. 43rd International Symposium on Mathematical Foundations of Computer Science(MFCS), Aug 2018, Liverpool, United Kingdom. pp.9:1-9:14, ⟨10.4230/LIPIcs.MFCS.2018.9⟩. ⟨hal-01670476v3⟩
Stephane Demri, Raul Fervari. On the Complexity of Modal Separation Logics. Advances in Modal Logic, Bern, 2018, Aug 2018, Bern, Switzerland. ⟨hal-02366671⟩
Diane Gallois-Wong, Sylvie Boldo, Thibault Hilaire. A Coq formalization of digital filters. CICM 2018 - 11th Conference on Intelligent Computer Mathematics, Aug 2018, Hagenberg, Austria. pp.87--103, ⟨10.1007/978-3-319-96812-4_8⟩. ⟨hal-01728828v2⟩
David Baelde, Stéphanie Delaune, Lucca Hirschi. POR for Security Protocol Equivalences: Beyond Action-Determinism. ESORICS, pp.385-405, 2018, ⟨10.1007/978-3-319-99073-6_19⟩. ⟨hal-02390219⟩
Alain Finkel, Etienne Lozes. Synchronizability of Communicating Finite State Machines is not Decidable. 2018. ⟨hal-01474722v5⟩
Alejandro Díaz-Caro, Gilles Dowek. A logic identifying isomorphic propositions. 2018. ⟨hal-01109104v5⟩
Raphael Chane-Yack-Fa, Marc Frappier, Amel Mammar, Alain Finkel. Parameterized verification of monotone information systems. Formal Aspects of Computing, 2018, 30 (3-4), pp.463 - 489. ⟨10.1007/s00165-018-0460-8⟩. ⟨hal-01847131⟩
Jean Goubault-Larrecq, Jean-Philippe Lachance. On the complexity of monitoring Orchids signatures, and recurrence equations. Formal Methods in System Design, 2018, 53 (1), pp.6-32. ⟨10.1007/s10703-017-0303-x⟩. ⟨hal-03189484⟩
David Baelde, Anthony Lick, Sylvain Schmitz. A Hypersequent Calculus with Clusters for Linear Frames. Twefth Conference on Advances in Modal Logic, Jul 2018, Bern, Switzerland. pp.36--55. ⟨hal-01756126v2⟩
Da-Jung Cho, Yo-Sub Han, Kai Salomaa, Taylor J. Smith. Site-Directed Insertion: Decision Problems, Maximality and Minimality. 20th International Conference on Descriptional Complexity of Formal Systems, Jul 2018, Halifax, Canada. ⟨hal-01937654⟩
Matthias Függer, Thomas Nowak, Manfred Schwarz. Tight Bounds for Asymptotic and Approximate Consensus. ACM Symposium on Principles of Distributed Computing (PODC'18), Jul 2018, Egham, United Kingdom. ⟨10.1145/3212734.3212762⟩. ⟨hal-01799039⟩
Frédéric Blanqui, Guillaume Genestier. Termination of λΠ modulo rewriting using the size-change principle (work in progress). 16th International Workshop on Termination, Jul 2018, Oxford, United Kingdom. pp. 10-14. ⟨hal-01944731⟩
Quentin Ye. Comparaison des termes avec partage. [Rapport de recherche] LSV, ENS Cachan, CNRS, INRIA, Université Paris-Saclay, Cachan (France). 2018. ⟨hal-01973539⟩
Giovanni Bacci, Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, et al.. Optimal and Robust Controller Synthesis: Using Energy Timed Automata with Uncertainty. FM 2018 - International Symposium on Formal Methods, Jul 2018, Oxford, United Kingdom. pp.203-221, ⟨10.1007/978-3-319-95582-7_12⟩. ⟨hal-01889222⟩
Sylvain Conchon, David Declerck, Fatiha Zaïdi. Cubicle-W: Parameterized Model Checking on Weak Memory. IJCAR 2018 - International Joint Conference on Automated Reasoning, Jul 2018, Oxford, United Kingdom. pp.152-160. ⟨hal-02420590⟩
Guillaume Melquiond, Raphaël Rieu-Helft. A Why3 Framework for Reflection Proofs and its Application to GMP's Algorithms. 9th International Joint Conference on Automated Reasoning, Jul 2018, Oxford, United Kingdom. pp.178-193, ⟨10.1007/978-3-319-94205-6_13⟩. ⟨hal-01699754v2⟩
Sylvain Conchon, Albin Coquereau, Mohamed Iguernlala, Alain Mebsout. Alt-Ergo 2.2. SMT Workshop: International Workshop on Satisfiability Modulo Theories, Jul 2018, Oxford, United Kingdom. ⟨hal-01960203⟩
Guillaume Bury, Simon Cruanes, David Delahaye. SMT Solving Modulo Tableau and Rewriting Theories. SMT 2018 - 16th International Workshop on Satisfiability Modulo Theories, Jul 2018, Oxford, United Kingdom. ⟨hal-02083232⟩
Zohra Kader, Antoine Girard, Adnane Saoud. Symbolic models for incrementally stable switched systems with aperiodic time sampling. 6th IFAC Conference on Analysis and Design of Hybrid System, ADHS 2018, Jul 2018, Oxford, United Kingdom. ⟨10.1016/j.ifacol.2018.08.043⟩. ⟨hal-01760789⟩
Adrien Le Coënt, Laurent Fribourg, Jonathan Vacher. Control Synthesis for Stochastic Switched Systems using the Tamed Euler Method.. 6th IFAC Conference on Analysis and Design of Hybrid Systems ADHS 2018 ADHS'18,, Jul 2018, Oxford, United Kingdom. ⟨10.1016/j.ifacol.2018.08.044⟩. ⟨hal-01959845⟩
Véronique Benzaken, Évelyne Contejean, Chantal Keller, Eunice Martins. A Coq formalisation of SQL's execution engines. ITP 2018 - International Conference on Interactive Theorem Proving, Jul 2018, Oxford, United Kingdom. pp.88-107, ⟨10.1007/978-3-319-94821-8_6⟩. ⟨hal-01716048⟩
Nachum Dershowitz, Jean-Pierre Jouannaud. Drags: A Simple Algebraic Framework For Graph Rewriting. TERMGRAPH 2018 - 10th International Workshop on Computing with Terms and Graphs, Jul 2018, Oxford, United Kingdom. ⟨hal-01853836⟩
Béatrice Bérard, Stefan Haar, Sylvain Schmitz, Stefan Schwoon. The Complexity of Diagnosability and Opacity Verification for Petri Nets. Fundamenta Informaticae, 2018, 161 (4), pp.317--349. ⟨10.3233/FI-2018-1706⟩. ⟨hal-01852119⟩
Joshua A Bockenek, Peter Lammich, Yakoub Nemouchi, Burkhart Wolff. Using Isabelle/UTP for the Verification of Sorting Algorithms A Case Study. 2018. ⟨hal-04504877⟩
François Thiré. Sharing a Library between Proof Assistants: Reaching out to the HOL Family *. Electronic Proceedings in Theoretical Computer Science, 2018, 274, pp.57 - 71. ⟨10.4204/EPTCS.274.5⟩. ⟨hal-01929714⟩
Serge Haddad, Benjamin Monmege. Interval Iteration Algorithm for MDPs and IMDPs. Theoretical Computer Science, 2018, 735, pp.111 - 131. ⟨10.1016/j.tcs.2016.12.003⟩. ⟨hal-01809094⟩
François Bobot, Stéphane Graham-Lengrand, Bruno Marre, Guillaume Bury. Centralizing equality reasoning in MCSAT. 16th International Workshop on Satisfiability Modulo Theories (SMT 2018), Jul 2018, Oxford, United Kingdom. ⟨hal-01935591⟩
Simon Halfon. On Effective Representations of Well Quasi-Orderings. Other [cs.OH]. Université Paris Saclay (COmUE), 2018. English. ⟨NNT : 2018SACLN021⟩. ⟨tel-01945232⟩
David Baelde, Stéphanie Delaune, Lucca Hirschi. Porridge, an OCaml library implementing POR techniques for checking trace equivalence of security protocols. 2018, ⟨swh:1:dir:cf31343fd5744d56d7126b6cb99e96d29f5c0376;origin=https://hal.archives-ouvertes.fr/hal-01821474;visit=swh:1:snp:7cade104d9b67487e422fe6cafbe53e5255c7804;anchor=swh:1:rev:f202e6b3543e7c3c14250b038e236868671d8d10;path=/⟩. ⟨hal-01821474v2⟩
Chantal Keller. Tactic Program-based Testing and Bounded Verification in Isabelle/HOL. Tests and Proofs, Jun 2018, Toulouse, France. ⟨hal-01884960⟩
Sylvie Boldo, Florian Faissole, Vincent Tourneur. A Formally-Proved Algorithm to Compute the Correct Average of Decimal Floating-Point Numbers. 25th IEEE Symposium on Computer Arithmetic, Jun 2018, Amherst, MA, United States. ⟨hal-01772272⟩
Engel Lefaucheux, Alessandro Giua, Carla Seatzu. Basis Coverability Graph for Partially Observable Petri Nets with Application to Diagnosability Analysis. Petri Nets 2018 - International Conference on Applications and Theory of Petri Nets and Concurrency, Jun 2018, Bratislava, Slovakia. pp.164-183, ⟨10.1007/978-3-319-91268-4_9⟩. ⟨hal-01882129⟩
Véronique Cortier, Antoine Dallon, Stéphanie Delaune. Efficiently deciding equivalence for standard primitives and phases. 2018. ⟨hal-01819366⟩
Olivier Carton, Bruno Guillon, Fabian Reiter. Counter Machines and Distributed Automata. 24th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2018, Ghent, Belgium. pp.13-28, ⟨10.1007/978-3-319-92675-9_2⟩. ⟨hal-01824873⟩
Thomas Chatain, Stefan Haar, Loïc Paulevé. Boolean Networks: Beyond Generalized Asynchronicity. AUTOMATA 2018 - 24th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, Jun 2018, Ghent, Belgium. pp.29-42, ⟨10.1007/978-3-319-92675-9_3⟩. ⟨hal-01768359v2⟩
David Oudart, Jérôme Cantenot, Frédéric Boulanger, Sophie Chabridon. Démarche de conception d'un réseau électrique intelligent et de son système d'information par cosimulation. CIEL 2018 : 7ème Conférence en IngénieriE du Logiciel, Jun 2018, Grenoble, France. pp.9-1 - 9-5. ⟨hal-01821675⟩
Guillaume Bury, Simon Cruanes, David Delahaye, Pierre-Louis Euvrard. An Automation-Friendly Set Theory for the B Method. ABZ 2018 - 6th International Conference on Abstract State Machines, Alloy, B, TLA, VDM, and Z, Jun 2018, Southampton, United Kingdom. pp.409-414, ⟨10.1007/978-3-319-91271-4_32⟩. ⟨hal-02082755⟩
Yamine Aït-Ameur, Idir Ait-Sadoune, Pierre Castéran, John Paul Gibson, Kahina Hacid, et al.. On the importance of explicit domain modelling in refinement-based modelling design: experiments with Event-B. 6th International Conference on Abstract State Machines, Alloy, B, TLA, VDM, and Z (ABZ 2018), Jun 2018, Southampton, United Kingdom. pp.425--430, ⟨10.1007/978-3-319-91271-4_35⟩. ⟨hal-01797538⟩
Vassil Todorov, Frédéric Boulanger, Safouan Taha. Formal verification of automotive embedded software. FORMALISE: 6th International Conference on Formal Methods in Software Engineering, Jun 2018, Gothenburg, Sweden. ⟨10.1145/3193992.3194003⟩. ⟨hal-01768687⟩
Loïg Jezequel, Agnes Madalinski, Stefan Schwoon. Distributed computation of vector clocks in Petri nets unfolding for test selection. Workshop on Discrete Event Systems (WODES), May 2018, Sorrento, Italy. ⟨hal-01735406⟩
Matthias Függer, Attila Kinali, Christoph Lenzen, Ben Wiederhake. Fast All-Digital Clock Frequency Adaptation Circuit for Voltage Droop Tolerance. 24th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC), May 2018, Wien, Austria. ⟨hal-01936403⟩
Sylvain Conchon, Giorgio Delzanno, Angelo Ferrando. Parameterized Verification of Topology-sensitive Distributed Protocols goes Declarative. International Conference on Networked Systems (NETYS), May 2018, Essaouira, Morocco. ⟨hal-02001652⟩
Véronique Benzaken, Giuseppe Castagna, Laurent Daynes, Julien Lopez, Kim Nguyen, et al.. Language-Integrated Queries: a BOLDR Approach. WWW 2018 - International World Wide Web Conference, Apr 2018, Lyon, France. pp.1-16, ⟨10.1145/3184558.3185973⟩. ⟨hal-01717995v2⟩
Frédéric Blanqui. Size-based termination of higher-order rewriting. Journal of Functional Programming, 2018, ⟨10.1017/S0956796818000072⟩. ⟨hal-01424921v5⟩
Amr Sabry, Benoît Valiron, Juliana Kaizer Vizzotto. From Symmetric Pattern-Matching to Quantum Control. 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Apr 2018, Thessalonique, Greece. ⟨hal-01763568⟩
Pierre Roux, Mohamed Iguernelala, Sylvain Conchon. A Non-linear Arithmetic Procedure for Control-Command Software Verification. 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Apr 2018, Thessalonique, Greece. pp.132-151. ⟨hal-01737737⟩
Adnane Saoud, Antoine Girard, Laurent Fribourg. Contract based Design of Symbolic Controllers for Vehicle Platooning. 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week), Apr 2018, Porto, Portugal. pp.277-278, ⟨10.1145/3178126.3187001⟩. ⟨hal-02287002⟩
Frédéric Gilbert. Extending higher-order logic with predicate subtyping: Application to PVS. Logic in Computer Science [cs.LO]. Université Sorbonne Paris Cité; Université Paris Diderot, 2018. English. ⟨NNT : ⟩. ⟨hal-01673518v2⟩
Loïg Jezequel, Thomas Chatain, Maurice Comlan, David Delfieu, Olivier Henri Roux. Pomsets and Unfolding of Reset Petri Nets. LATA 2018 - 12th International Conference on Language and Automata Theory and Applications, Apr 2018, Ramat Gan, Israel. ⟨hal-01766530⟩
Patricia Bouyer, Uli Fahrenberg, Kim G. Larsen, Nicolas Markey, Joël Ouaknine, et al.. Model Checking Real-Time Systems. Handbook of model checking, Springer-Verlag, pp.1001-1046, 2018, 978-3-319-10574-1. ⟨10.1007/978-3-319-10575-8_29⟩. ⟨hal-01889280⟩
Martin Clochard. Méthodes et outils pour la spécification et la preuve de propriétés difficiles de programmes séquentiels. Autre [cs.OH]. Université Paris Saclay (COmUE), 2018. Français. ⟨NNT : 2018SACLS071⟩. ⟨tel-01787689⟩
Rémy Chrétien, Véronique Cortier, Antoine Dallon, Stéphanie Delaune. Typing messages for free in security protocols. [Research Report] LSV, ENS Cachan, CNRS, INRIA, Université Paris-Saclay, Cachan (France). 2018, pp.1-49. ⟨hal-01741172⟩
Matthias Függer, Jürgen Maier, Robert Najvirt, Thomas Nowak, Ulrich Schmid. A Faithful Binary Circuit Model with Adversarial Noise. DATE 2018 - Design, Automation and Test in Europe Conference and Exhibition, Mar 2018, Dresden, Germany. ⟨10.23919/DATE.2018.8342219⟩. ⟨hal-01738254⟩
Benoît Barbot, Béatrice Bérard, Yann Duplouy, Serge Haddad. Integrating Simulink Models into the Model Checker Cosmos. [Research Report] LSV, ENS Cachan, CNRS, INRIA, Université Paris-Saclay, Cachan (France); LIP6, Sorbonne Université, CNRS, UMR 7606; LACL, Université Paris-Est. 2018. ⟨hal-01725835⟩
Stephan Friedrichs, Matthias Függer, Christoph Lenzen. Metastability-Containing Circuits. IEEE Transactions on Computers, 2018, pp.1167 - 1183. ⟨10.1109/TC.2018.2808185⟩. ⟨hal-01936292⟩
Benoît Barbot, Marco Beccuti, Giuliana Franceschinis, Serge Haddad, Claudine Picaronny. Bounds Computation for Symmetric Nets. 2018. ⟨hal-01726011⟩
Patricia Bouyer, Nicolas Markey, Mickaël Randour, Kim G. Larsen, Simon Laursen. Average-energy games. Acta Informatica, 2018, 55 (2), pp.91 - 127. ⟨10.1007/s00236-016-0274-1⟩. ⟨hal-01889005⟩
Patrick Gardy, Patricia Bouyer, Nicolas Markey. Dependences in Strategy Logic. STACS 2018 - Symposium on Theoretical Aspects of Computer Science, Feb 2018, Caen, France. pp.35 - 36, ⟨10.4230/LIPIcs.STACS.2018.34⟩. ⟨hal-01889224⟩
Natasha Alechina, Nils Bulling, Stephane Demri, Brian Logan. On the complexity of resource-bounded logics. Theoretical Computer Science, 2018, ⟨10.1016/j.tcs.2018.01.019⟩. ⟨hal-02366661⟩
Paul Gastin, Benjamin Monmege. A Unifying Survey on Weighted Logics and Weighted Automata: Core Weighted Logic: Minimal and Versatile Specification of Quantitative Properties. Soft Computing, 2018, 22 (4), pp.1047-1065. ⟨10.1007/s00500-015-1952-6⟩. ⟨hal-01130216v2⟩
Sergio Bezzecchi, Paolo Crisafulli, Charlotte Pichot, Burkhart Wolff. Making Agile Development Processes fit for V-style Certification Procedures. 9th European Congress on Embedded Real Time Software and Systems (ERTS 2018), Jan 2018, Toulouse, France. ⟨hal-01702815⟩
Raphaël Rieu-Helft. Un mécanisme d'extraction vers C pour Why3. 29èmes Journées Francophones des Langages Applicatifs, Jan 2018, Banyuls-sur-Mer, France. ⟨hal-01653153⟩
Jean-Christophe Filliâtre, Mário Pereira, Simão Melo de Sousa. Vérification de programmes OCaml fortement impératifs avec Why3. JFLA 2018 - Journées Francophones des Langages Applicatifs, Jan 2018, Banyuls-sur-Mer, France. pp.1-14. ⟨hal-01649989v2⟩
Sylvie Boldo, Nicolas Magaud. Journées Francophones des Langages Applicatifs 2018. Sylvie Boldo; Nicolas Magaud. Journées Francophones des Langages Applicatifs 2018, Jan 2018, Banyuls-sur-Mer, France. publié par les auteurs, 2018. ⟨hal-01707376⟩
Slim Medimegh, Jean-Yves Pierron, Frédéric Boulanger. Qualitative Simulation of Hybrid Systems with an Application to SysML Models. 6th International Conference on Model-Driven Engineering and Software Development, Jan 2018, Funchal, Portugal. ⟨10.5220/0006535202790286⟩. ⟨hal-01707264⟩
Florian Faissole. Définir le fini : deux formalisations d'espaces de dimension finie. JLFA 2018 - Journées Francophones des Langages Applicatifs, Jan 2018, Banyuls-sur-mer, France. pp.1-6. ⟨hal-01654457⟩
Adnane Saoud, Antoine Girard, Laurent Fribourg. On the Composition of Discrete and Continuous-time Assume-Guarantee Contracts for Invariance. European Control Conference (ECC 2018), 2018, Limassol, Cyprus. ⟨10.23919/ECC.2018.8550622⟩. ⟨hal-01712710⟩
Gilles Dowek. Execution traces and reduction sequences. 2018. ⟨hal-04060154⟩
Sylvain Dailler, Claude Marché, Yannick Moy. Lightweight Interactive Proving inside an Automatic Program Verifier. 4th Workshop on Formal Integrated Development Environment, 2018, Oxford, United Kingdom. ⟨hal-01936302⟩
Pablo Arrighi, S. Martiel, V. Nesme. Cellular automata over generalized Cayley graphs. Mathematical Structures in Computer Science, 2018, 18, pp.340-383. ⟨hal-01785458⟩
Achim D. Brucker, Idir Ait-Sadoune, Paolo Crisafulli, Burkhart Wolff. Using the Isabelle Ontology Framework. Linking the Formal with the Informal. International Conference on Intelligent Computer Mathematics (CICM), 2018, Hagenberg,, Austria. pp.23--38, ⟨10.1007/978-3-319-96812-4_3⟩. ⟨hal-01875734⟩
Adnane Saoud, Pushpak Jagtap, Majid Zamani, Antoine Girard. Compositional Abstraction-based Synthesis for Cascade Discrete-Time Control Systems. 6th IFAC Conference on Analysis and Design of Hybrid System, ADHS 2018, 2018, Oxford, United Kingdom. ⟨10.1016/j.ifacol.2018.08.003⟩. ⟨hal-01761180⟩
Serge Haddad. Memoryless Determinacy of Finite Parity Games: Another Simple Proof. Information Processing Letters, 2018, 132, pp.3. ⟨hal-01541508⟩
Eric Fabre, Loïc Hélouët, Engel Lefaucheux, Hervé Marchand. Diagnosability of Repairable Faults. Discrete Event Dynamic Systems, 2018, 28 (2), pp.183-213. ⟨10.1007/s10626-017-0255-8⟩. ⟨hal-01646911⟩
Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu, Diego Calvanese, et al.. Research Directions for Principles of Data Management: Manifesto from Dagstuhl Perspectives Workshop 16151. Dagstuhl Manifestos, 2018, 7 (1), pp.1-29. ⟨10.4230/DagMan.7.1.1⟩. ⟨hal-01778196⟩
Adnane Saoud, Antoine Girard. Optimal Multirate Sampling in Symbolic Models for Incrementally Stable Switched Systems. Automatica, 2018, 98, pp.58-65. ⟨10.1016/j.automatica.2018.09.005⟩. ⟨hal-01860113⟩
Sylvain Dailler, David Hauzar, Claude Marché, Yannick Moy. Instrumenting a Weakest Precondition Calculus for Counterexample Generation. Journal of Logical and Algebraic Methods in Programming, 2018, 99, pp.97-113. ⟨hal-01802488⟩
Denis Kuperberg, Anirban Majumdar. Width of Non-deterministic Automata. 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), 2018, Caen, France. pp.48 - 49, ⟨10.4230/LIPIcs.STACS.2018.48⟩. ⟨hal-01891180⟩
Stéphane Demri, Etienne Lozes, Alessio Mansutti. The Effects of Adding Reachability Predicates in Propositional Separation Logic. 22nd International Conference on Foundations of Software Science and Computation Structures FOSSACS, 2018, Thessaloniki, Greece. ⟨hal-01920563⟩
Martin Clochard, Léon Gondelman, Mário Pereira. The Matrix Reproved: Verification Pearl. Journal of Automated Reasoning, 2018, 60 (3), pp.365-383. ⟨10.1007/s10817-017-9436-2⟩. ⟨hal-01617437⟩
S Demri, E Lozes, Denis Lugiez. On Symbolic Heaps Modulo Permission Theories. 37th IARCS Foundation on Software Technology and Theoretical Computer Science, Dec 2017, Kanpur, India. ⟨10.4230/LIPIcs.FSTTCS.2017.25⟩. ⟨hal-01788798⟩
Béatrice Bérard, Serge Haddad, Engel Lefaucheux. Probabilistic Disclosure: Maximisation vs. Minimisation. FSTTCS 2017, Dec 2017, Kanpur, India. pp.13:1-13:14, ⟨10.4230/LIPIcs.FSTTXS.2017⟩. ⟨hal-01618955⟩
Konstantinos Chatzikokolakis, Serge Haddad, Ali Kassem, Catuscia Palamidessi. Trading Optimality for Performance in Location Privacy. 11th EAI International Conference on Performance Evaluation Methodologies and Tools, Dec 2017, Venice, Italy. ⟨hal-01678256⟩
Rodolphe Lepigre. PML 2 : Integrated Program Verification in ML. 23rd International Conference on Types for Proofs and Programs (TYPES 2017), Jul 2017, Budapest, Hungary. pp.27, ⟨10.4230/LIPIcs.TYPES.2017.5⟩. ⟨hal-01972000⟩
Stéphane Demri, Amit K Kumar Dhar, Arnaud Sangnier. Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic. Theoretical Computer Science, 2017, 735, pp.2-23. ⟨10.1016/j.tcs.2017.07.007⟩. ⟨hal-03192244⟩
Juraj Kolčák, David Šafránek, Stefan Haar, Loïc Paulevé. Unfolding of Parametric Boolean Networks. 7th International Workshop on Static Analysis and Systems Biology (SASB 2016), Sep 2016, Edimbourg, United Kingdom. pp.67-90, ⟨10.1016/j.entcs.2018.03.009⟩. ⟨hal-01354109v2⟩
Gilles Dowek. La notion de nombre réel : une solution simplexe ?. 2014. ⟨hal-04055835⟩
Gilles Dowek. A theory independent Curry-De Bruijn-Howard correspondence. 2012. ⟨hal-04070185⟩
Gilles Dowek. Algorithmes et modèles : l'histoire d'une convergence. 2012. ⟨hal-04061691⟩
Pablo Arrighi, Gilles Dowek. The principle of a finite density of information. 2012. ⟨hal-04070184⟩
Gilles Dowek. A second Galilean revolution?. 2010. ⟨hal-04048357⟩
Sylvain Conchon, Jean-Christophe Filliâtre. Semi-persistent Data Structures. European Symposium on Programming, Mar 2008, Budapest, Hungary. pp.322-336, ⟨10.1007/978-3-540-78739-6_25⟩. ⟨hal-04045849⟩
Gilles Dowek. Skolemization in Simple Type Theory: the Logical and the Theoretical Points of View. 2008. ⟨hal-04088449⟩
Gilles Dowek, Benjamin Werner. A constructive proof of Skolem theorem for constructive logic. 2005. ⟨hal-04099179⟩
Gilles Dowek. What do we know when we know that a theory is consistent?. 2005. ⟨hal-04099146⟩
Gilles Dowek. A Complete Proof Synthesis Method for the Cube of Type Systems. 1993. ⟨hal-04121608⟩

Dernières publications