{"id":18,"date":"2019-06-21T00:52:46","date_gmt":"2019-06-20T22:52:46","guid":{"rendered":"https:\/\/www.univ-orleans.fr\/lifo\/equipes\/lmv\/?page_id=18"},"modified":"2024-01-11T15:41:08","modified_gmt":"2024-01-11T14:41:08","slug":"publications","status":"publish","type":"page","link":"https:\/\/www.univ-orleans.fr\/lifo\/equipes\/lmv\/index.php\/publications\/","title":{"rendered":"Publications"},"content":{"rendered":"\n<p><H2>2026<\/H2><a href=\"https:\/\/hal.science\/hal-05518907\">[hal-05518907]<\/a> Kostia Chardonnet, Jules Chouquet, Axel Kerinec, <\/br><strong>Approximation theory for distant Bang calculus<\/strong><\/br><i>11th International Conference on Formal Structures for Computation and Deduction (FSCD)<\/i>, Jul 2026, Lisbonne, Portugal. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.48550\/arXiv.2601.05199\">&#x27E8;10.48550\/arXiv.2601.05199&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.science\/hal-05588566\">[hal-05588566]<\/a> Fr\u00e9d\u00e9ric Dabrowski, <\/br><strong>Kairos : de la sp\u00e9cification temporelle de s\u00fbret\u00e9 \u00e0 la preuve locale<\/strong><\/br>2026<\/br><\/br><a href=\"https:\/\/hal.science\/hal-05342070\">[hal-05342070]<\/a> Fr\u00e9d\u00e9ric Loulergue, Olivia Proust, <\/br><strong>Deductively Verifying Functional Scalable Parallel Programs with Why3<\/strong><\/br><i>Software and Systems Modeling<\/i>, 2026, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s10270-025-01340-y\">&#x27E8;10.1007\/s10270-025-01340-y&#x27E9;<\/a><\/br><\/br><H2>2025<\/H2><a href=\"https:\/\/hal.science\/hal-05148512\">[hal-05148512]<\/a> Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Approches formelles pour les composants et outils syst\u00e8me<\/strong><\/br><i>Journ\u00e9es Approches Formelles pour l'Assistance au D\u00e9veloppement de Logiciels (AFADL)<\/i>, Jun 2025, Pau, France<\/br><\/br><a href=\"https:\/\/hal.science\/hal-05095685\">[hal-05095685]<\/a> Yani Ziani, T\u00e9o Bernier, Nikolai Kosmatov, Fr\u00e9d\u00e9ric Loulergue, Daniel Gracia Perez, <\/br><strong>Towards Formal Verification of a TPM Software Stack: Achievements and Opportunities<\/strong><\/br><i>Formal Aspects of Computing<\/i>, 2025, 37 (4), <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3743153\">&#x27E8;10.1145\/3743153&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.science\/hal-05125414\">[hal-05125414]<\/a> Nikolai Kosmatov, Fr\u00e9d\u00e9ric Loulergue, Julien Signoles, <\/br><strong>Projet V\u00c9DYSEC : V\u00e9rification Dynamique de Propri\u00e9t\u00e9s de S\u00e9curit\u00e9<\/strong><\/br><i>Journ\u00e9es Approches Formelles dans l\u2019Assistance au D\u00e9veloppement du Logiciel (AFADL)<\/i>, Jun 2025, Pau, France<\/br><\/br><a href=\"https:\/\/hal.science\/hal-04983000\">[hal-04983000]<\/a> Fr\u00e9d\u00e9ric Dabrowski, Jordan Ischard, <\/br><strong>Functional Reactive Programming with Effects, a more permissive approach<\/strong><\/br>2025<\/br><\/br><a href=\"https:\/\/hal.science\/hal-05135592\">[hal-05135592]<\/a> Jordan Ischard, Fr\u00e9d\u00e9ric Dabrowski, Jules Chouquet, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Une s\u00e9mantique m\u00e9canis\u00e9e d'un langage FRP avec effets<\/strong><\/br><i>Journ\u00e9es Approches Formelles pour l'Assistance au D\u00e9veloppement de Logiciels (AFADL)<\/i>, Jun 2025, Pau (France), France<\/br><\/br><a href=\"https:\/\/hal.science\/hal-04859489\">[hal-04859489]<\/a> J\u00e9r\u00e9my Damour, Allan Blanchard, Lo\u00efc Correnson, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Formalisation d'une analyse de r\u00e9gion pour Frama-C\/WP<\/strong><\/br><i>36es Journ\u00e9es Francophones des Langages Applicatifs (JFLA 2025)<\/i>, Jan 2025, Roiff\u00e9, France<\/br><\/br><a href=\"https:\/\/hal.science\/hal-05126380\">[hal-05126380]<\/a> T\u00e9rence Clastres, Frederic Dabrowski, <\/br><strong>Deductive Verification of Synchronous Reactive Programs<\/strong><\/br><i>Journ\u00e9es Approches Formelles pour l'Assistance au D\u00e9veloppement de Logiciels (AFADL)<\/i>, Jun 2025, Pau (Universit\u00e9 de Pau), France<\/br><\/br><a href=\"https:\/\/hal.science\/hal-04795983\">[hal-04795983]<\/a> Jordan Ischard, Frederic Dabrowski, Jules Chouquet, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>A Mechanized Formalization of an FRP Language with Effects<\/strong><\/br><i>ACM Symposium on Applied Computing (SAC)<\/i>, Mar 2025, Sicily, Italy. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3672608.3707907\">&#x27E8;10.1145\/3672608.3707907&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.science\/hal-05117243\">[hal-05117243]<\/a> Yohan Boichut, Thomas Genet, <\/br><strong>Checking that Equations on Terms define a Finite Set of Equivalence Classes<\/strong><\/br>2025<\/br><\/br><a href=\"https:\/\/hal.science\/hal-05133511\">[hal-05133511]<\/a> Myriam Clouet, Thibaud Antignac, Mathilde Arnaud, Julien Signoles, <\/br><strong>Langage de sp\u00e9cification de contexte pour v\u00e9rifier formellement des propri\u00e9t\u00e9s de consentement sur des mod\u00e8les et du code -R\u00e9sum\u00e9 long<\/strong><\/br><i>Journ\u00e9es Approches Formelles pour l'Assistance au D\u00e9veloppement de Logiciels (AFADL)<\/i>, Jun 2025, Pau, France<\/br><\/br><a href=\"https:\/\/hal.science\/hal-05146660\">[hal-05146660]<\/a> Olivier Carton, Jean-Michel Couvreur, Martin Delacourt, Nicolas Ollinger, <\/br><strong>Linear Recurrence Sequence Automata and\u00a0the\u00a0Addition of\u00a0Abstract Numeration Systems<\/strong><\/br><i>WORDS 2025<\/i>, Jun 2025, Nancy, France. pp.70-82, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-031-97548-6_7\">&#x27E8;10.1007\/978-3-031-97548-6_7&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.science\/hal-05351661\">[hal-05351661]<\/a> Jean-Michel Couvreur, Martin Delacourt, Nicolas Ollinger, Pierre Popoli, Jeffrey Shallit, Manon Stipulanti, <\/br><strong>Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences<\/strong><\/br>2025<\/br><\/br><H2>2024<\/H2><a href=\"https:\/\/hal.science\/tel-04983014\">[tel-04983014]<\/a> Frederic Dabrowski, <\/br><strong>Formal Methods for Synchronization in Parallel and Concurrent Programming Languages<\/strong><\/br>Computer Science [cs]. Universit\u00e9 d'Orl\u00e9ans, 2024<\/br><\/br><a href=\"https:\/\/hal.science\/hal-04354615\">[hal-04354615]<\/a> T\u00e9o Bernier, Yani Ziani, Nikolai Kosmatov, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Combining Deductive Verification with Shape Analysis<\/strong><\/br><i>27th International Conference on Fundamental Approaches to Software Engineering (FASE)<\/i>, 2024, Luxembourg, Luxembourg. pp.280-289, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-031-57259-3_14\">&#x27E8;10.1007\/978-3-031-57259-3_14&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.science\/hal-04605772\">[hal-04605772]<\/a> Yohan Boichut, Adrien Boiret, Vincent Hugot, <\/br><strong>SAT-Based Automated Completion for Reachability Analysis<\/strong><\/br><i>International Conference on Implementation and Application of Automata<\/i>, Sep 2024, Akita, Japan<\/br><\/br><a href=\"https:\/\/hal.science\/hal-04556201\">[hal-04556201]<\/a> Fr\u00e9d\u00e9ric Loulergue, Olivia Proust, <\/br><strong>WhyBSML 0.2<\/strong><\/br>2024, <a target=\"_blank\" style=\"word-break: break-all;\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:f3889ab751233d7ccb812d6e31cc074452b5e139;origin=https:\/\/hal.archives-ouvertes.fr\/hal-04556201;visit=swh:1:snp:eb9686bbb19def3cd7e40be139923aa5270faed8;anchor=swh:1:rel:0040e1fae30354391bea7e4b4fc245556353fd87;path=\/\">&#x27E8;swh:1:dir:f3889ab751233d7ccb812d6e31cc074452b5e139;origin=https:\/\/hal.archives-ouvertes.fr\/hal-04556201;visit=swh:1:snp:eb9686bbb19def3cd7e40be139923aa5270faed8;anchor=swh:1:rel:0040e1fae30354391bea7e4b4fc245556353fd87;path=\/&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/inria.hal.science\/hal-04597523\">[hal-04597523]<\/a> Fr\u00e9d\u00e9ric Loulergue, Julien Tesson, <\/br><strong>Verified Parallel Programming in Coq with Bulk Synchronous Parallel Homomorphisms<\/strong><\/br><i>17th International Symposium on High-Level Parallel Programming and Applications (HLPP)<\/i>, Jul 2024, Pisa, Italy<\/br><\/br><a href=\"https:\/\/inria.hal.science\/hal-04637532\">[hal-04637532]<\/a> Yani Ziani, Nikolai Kosmatov, Fr\u00e9d\u00e9ric Loulergue, Daniel Gracia P\u00e9rez, <\/br><strong>Runtime Verification for High-Level Security Properties: Case Study on the TPM Software Stack<\/strong><\/br><i>18th International Conference on Tests and Proofs (TAP)<\/i>, Sep 2024, Milan (Italie), Italy. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-031-72044-4_5\">&#x27E8;10.1007\/978-3-031-72044-4_5&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.science\/hal-04811388\">[hal-04811388]<\/a> Jordan Ischard, <\/br><strong>DeBrLevel - version 1.0.1<\/strong><\/br>2024, <a target=\"_blank\" style=\"word-break: break-all;\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:24f085f9667a4808f717502bd9d3acce95bc9ee1;origin=https:\/\/doi.org\/10.5281\/zenodo.14245079;visit=swh:1:snp:0ed2436203cb8d38464c915df21308e971a71466;anchor=swh:1:rel:bfa68ace2fee6a94e8c70e674ff0f28894fb53ba;path=\/JordanIschard-DeBrLevel-722dfde\/\">&#x27E8;swh:1:dir:24f085f9667a4808f717502bd9d3acce95bc9ee1;origin=https:\/\/doi.org\/10.5281\/zenodo.14245079;visit=swh:1:snp:0ed2436203cb8d38464c915df21308e971a71466;anchor=swh:1:rel:bfa68ace2fee6a94e8c70e674ff0f28894fb53ba;path=\/JordanIschard-DeBrLevel-722dfde\/&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/inria.hal.science\/hal-04572043\">[hal-04572043]<\/a> Farid Arfi, H\u00e9l\u00e8ne Coullon, Fr\u00e9d\u00e9ric Loulergue, Jolan Philippe, Simon Robillard, <\/br><strong>An Overview of the Decentralized Reconfiguration Language Concerto-D through its Maude Formalization<\/strong><\/br><i>ICE 2024: 17th Interaction and Concurrency Experience<\/i>, Jun 2024, Groningen, Netherlands. pp.1-18, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4204\/EPTCS.414.2\">&#x27E8;10.4204\/EPTCS.414.2&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.science\/hal-04644465\">[hal-04644465]<\/a> Fr\u00e9d\u00e9ric Loulergue, Jordan Ischard, <\/br><strong>SyDPaCC: A Framework for the Development of Verified Scalable Parallel Functional Programs<\/strong><\/br><i>Leveraging Applications of Formal Methods, Verification and Validation (ISoLA)<\/i>, Oct 2024, Crete Island, Greece. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-031-75380-0_16\">&#x27E8;10.1007\/978-3-031-75380-0_16&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.science\/hal-04528312\">[hal-04528312]<\/a> Wolfgang Ahrendt, Fr\u00e9d\u00e9ric Loulergue, Heike Wehrheim, <\/br><strong>Introduction to the Special Collection from the International Conference on Tests and Proofs (TAP) 2020 and 2021<\/strong><\/br><i>Formal Aspects of Computing<\/i>, 36 (1), pp.1-2, 2024, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3650092\">&#x27E8;10.1145\/3650092&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.science\/hal-04654817\">[hal-04654817]<\/a> Farid Arfi, H\u00e9l\u00e8ne Coullon, Fr\u00e9d\u00e9ric Loulergue, Jolan Philippe, Simon Robillard, <\/br><strong>Concerto-D in Maude<\/strong><\/br>2024, <a target=\"_blank\" style=\"word-break: break-all;\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:32a2fe14ad750c01d73d2bd101ef0c2f2e440f62;origin=https:\/\/hal.archives-ouvertes.fr\/hal-04654817;visit=swh:1:snp:ad21f1e90f6cf2549821eb2142ab6657817241f1;anchor=swh:1:rel:9689c8ed0577d56bfb7885c6ed94e9ce0020eca3;path=\/\">&#x27E8;swh:1:dir:32a2fe14ad750c01d73d2bd101ef0c2f2e440f62;origin=https:\/\/hal.archives-ouvertes.fr\/hal-04654817;visit=swh:1:snp:ad21f1e90f6cf2549821eb2142ab6657817241f1;anchor=swh:1:rel:9689c8ed0577d56bfb7885c6ed94e9ce0020eca3;path=\/&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.science\/hal-04622131\">[hal-04622131]<\/a> T\u00e9o Bernier, Yani Ziani, Nikolai Kosmatov, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Combiner la v\u00e9rification d\u00e9ductive avec l'analyse de forme<\/strong><\/br><i>Journ\u00e9es Approches Formelles pour l'Assistance au D\u00e9veloppement de Logiciels (AFADL)<\/i>, Jun 2024, Strasbourg, France<\/br><\/br><a href=\"https:\/\/hal.science\/hal-04065774\">[hal-04065774]<\/a> Dara Ly, Nikolai Kosmatov, Fr\u00e9d\u00e9ric Loulergue, Julien Signoles, <\/br><strong>Sound runtime assertion checking for memory properties via program transformation<\/strong><\/br><i>Formal Aspects of Computing<\/i>, 2024, 36 (1), pp.4:1-46. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3605951\">&#x27E8;10.1145\/3605951&#x27E9;<\/a><\/br><\/br><hr><H2>2023<\/H2><a href=\"https:\/\/hal.science\/hal-04171949\">[hal-04171949]<\/a> Fr\u00e9d\u00e9ric Loulergue, Abdelali Ed-Dbali, <\/br><strong>Verified High Performance Computing: the SyDPaCC Approach<\/strong><\/br><i>16th International Conference on Verification and Evaluation of Computer and Communication Systems (VECoS)<\/i>, Oct 2023, Marrakech, Morocco. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-031-49737-7_2\">&#x27E8;10.1007\/978-3-031-49737-7_2&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.science\/hal-04173428\">[hal-04173428]<\/a> Olivia Proust, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Verified Scalable Parallel Computing with Why3<\/strong><\/br><i>21st International Conference on Software Engineering and Formal Methods (SEFM)<\/i>, Nov 2023, Eindhoven, Netherlands. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-031-47115-5_14\">&#x27E8;10.1007\/978-3-031-47115-5_14&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/inria.hal.science\/hal-04067909\">[hal-04067909]<\/a> H\u00e9l\u00e8ne Coullon, Ludovic Henrio, Fr\u00e9d\u00e9ric Loulergue, Simon Robillard, <\/br><strong>Component-Based Distributed Software Reconfiguration: a Verification-Oriented Survey<\/strong><\/br><i>ACM Computing Surveys<\/i>, 2023, 56 (1), pp.1-37. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3595376\">&#x27E8;10.1145\/3595376&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.science\/hal-03995588\">[hal-03995588]<\/a> Virginia Niculescu, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Guest Editor\u2019s Note: High-Level Parallel Programming 2021<\/strong><\/br><i>International Journal of Parallel Programming<\/i>, 2023, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s10766-023-00752-x\">&#x27E8;10.1007\/s10766-023-00752-x&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/inria.hal.science\/hal-04142455\">[hal-04142455]<\/a> Darine Rammal, Wadoud Bousdira, Frederic Dabrowski, <\/br><strong>Synchronous cooperative threading model in MSSL<\/strong><\/br><i>SAC '23: 38th ACM\/SIGAPP Symposium on Applied Computing<\/i>, 2023, Tallinn, Estonia. pp.1380-1383, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3555776.3577815\">&#x27E8;10.1145\/3555776.3577815&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.science\/hal-04176159\">[hal-04176159]<\/a> Yani Ziani, Nikolai Kosmatov, Fr\u00e9d\u00e9ric Loulergue, Daniel Gracia P\u00e9rez, T\u00e9o Bernier, <\/br><strong>Towards Formal Verification of a TPM Software Stack<\/strong><\/br><i>18th International Conference on integrated Formal Methods (iFM)<\/i>, Nov 2023, Leiden, Netherlands. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-031-47705-8_6\">&#x27E8;10.1007\/978-3-031-47705-8_6&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/inria.hal.science\/hal-04142453\">[hal-04142453]<\/a> Fr\u00e9d\u00e9ric Loulergue, Jolan Philippe, <\/br><strong>Towards Verified Scalable Parallel Computing with Coq and Spark<\/strong><\/br><i>FTfJP 2023 - 25th ACM International Workshop on Formal Techniques for Java-like Programs<\/i>, Jul 2023, Seatle, WA, United States. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3605156.3606450\">&#x27E8;10.1145\/3605156.3606450&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/inria.hal.science\/hal-04142454\">[hal-04142454]<\/a> Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Tutorial:  Collaborative Analysis and Verification of C Programs with Frama-C<\/strong><\/br><i>38th IEEE\/ACM International Conference on Automated Software Engineering (ASE)<\/i>, Sep 2023, Kirchberg, Luxembourg<\/br><\/br><hr><H2>2022<\/H2><a href=\"https:\/\/inria.hal.science\/hal-03356610\">[hal-03356610]<\/a> Nirina Andrianarivelo, Pierre R\u00e9ty, <\/br><strong>Modular termination of prefix-constrained term rewrite systems<\/strong><\/br><i>Information Processing Letters<\/i>, 2022, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.ipl.2021.106207\">&#x27E8;10.1016\/j.ipl.2021.106207&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.science\/hal-03767722\">[hal-03767722]<\/a> Siva Anantharaman, Sabine Frittella, Benjamin Nguyen, <\/br><strong>Privacy Analysis with a Distributed Transition System and a Data-Wise Metric<\/strong><\/br><i>Privacy in Statistical Databases (PSD)<\/i>, Sep 2022, PARIS, France. pp.15--30<\/br><\/br><a href=\"https:\/\/hal.science\/hal-03623522\">[hal-03623522]<\/a> Siva Anantharaman, Sabine Frittella, Benjamin Nguyen, <\/br><strong>Distributed Transition Systems with Tags for Privacy Analysis<\/strong><\/br>2022<\/br><\/br><hr><H2>2021<\/H2><a href=\"https:\/\/hal.science\/hal-03517397\">[hal-03517397]<\/a> Jules Chouquet, Lionel Vaux, <\/br><strong>An application of parallel cut elimination in multiplicative linear logic to the Taylor expansion of proof nets<\/strong><\/br><i>Logical Methods in Computer Science<\/i>, 2021, Volume 17, Issue 4, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.46298\/lmcs-17(4:22)2021\">&#x27E8;10.46298\/lmcs-17(4:22)2021&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-03160688\">[hal-03160688]<\/a> Virginia Niculescu, Fr\u00e9d\u00e9ric Loulergue, Adrian Sterca, <\/br><strong>Reflection on the Design of Parallel Programming Frameworks<\/strong><\/br><i>Evaluation of Novel Approaches to Software Engineering<\/i>, pp.154-181, 2021, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-70006-5_7\">&#x27E8;10.1007\/978-3-030-70006-5_7&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-03338928\">[hal-03338928]<\/a> Salwa Souaf, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Experience report: Teaching code analysis and verification using Frama-C<\/strong><\/br><i>1st International Workshop on Applicable Formal Methods (appFM)<\/i>, Nov 2021, Beijing, China. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4204\/EPTCS.349.5\">&#x27E8;10.4204\/EPTCS.349.5&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-03261865\">[hal-03261865]<\/a> Fr\u00e9d\u00e9ric Loulergue, Franz Wotawa, <\/br><strong>Tests and Proofs<\/strong><\/br>Springer, 12740, 2021, Lecture Notes in Computer Science, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-79379-1\">&#x27E8;10.1007\/978-3-030-79379-1&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-03178944\">[hal-03178944]<\/a> Frederic Dabrowski, <\/br><strong>On Single-Valuedness in Textually Aligned SPMD Programs<\/strong><\/br><i>International Journal of Parallel Programming<\/i>, 2021, International Journal of Parallel Programming, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s10766-021-00710-5\">&#x27E8;10.1007\/s10766-021-00710-5&#x27E9;<\/a><\/br><\/br><hr><H2>2020<\/H2><a href=\"https:\/\/hal-cea.archives-ouvertes.fr\/cea-02879211\">[cea-02879211]<\/a> Dara Ly, Nikolai Kosmatov, Fr\u00e9d\u00e9ric Loulergue, Julien Signoles, <\/br><strong>Verified Runtime Assertion Checking for Memory Properties<\/strong><\/br><i>TAP 2020 - 14th International Conference on Tests and Proofs<\/i>, Jun 2020, Bergen, Norway. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-50995-8_6\">&#x27E8;10.1007\/978-3-030-50995-8_6&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-02317068\">[hal-02317068]<\/a> Virginia Niculescu, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Transforming powerlist-based divide-and-conquer programs for an improved execution model<\/strong><\/br><i>Journal of Supercomputing<\/i>, 2020, 76 (7), pp.22. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s11227-019-02820-x\">&#x27E8;10.1007\/s11227-019-02820-x&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-03102811\">[hal-03102811]<\/a> Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Special Issue of the Journal of Logical and Algebraic Methods in Programming on Formal Approaches to Parallel and Distributed Systems 2018<\/strong><\/br><i>Journal of Logical and Algebraic Methods in Programming<\/i>, 116, Elsevier, pp.100580, 2020, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.jlamp.2020.100580\">&#x27E8;10.1016\/j.jlamp.2020.100580&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-02494416\">[hal-02494416]<\/a> Virginia Niculescu, Fr\u00e9d\u00e9ric Loulergue, Darius Bufnea, Adrian Sterca, <\/br><strong>Pattern-driven Design of a Multiparadigm Parallel Programming Framework<\/strong><\/br><i>13th International Conference on Evaluation of Novel Approaches to Software Engineering (ENASE)<\/i>, 2020, Prague, Czech Republic. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.5220\/0009344100500061\">&#x27E8;10.5220\/0009344100500061&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-02870592\">[hal-02870592]<\/a> Frederic Dabrowski, <\/br><strong>Verification of DRMA communications<\/strong><\/br><i>High-level Parallel Programming and Applications<\/i>, Jul 2020, Porto, Portugal<\/br><\/br><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-03628124\">[hal-03628124]<\/a> Frederic Dabrowski, <\/br><strong>The Journal of Supercomputing volume\u00a076,\u00a0page 4976 (2020)<\/strong><\/br>2020<\/br><\/br><hr><H2>2019<\/H2><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-02018651\">[hal-02018651]<\/a> Wadoud Bousdira, Arvid Jakobsson, Frederic Dabrowski, <\/br><strong>Safe Usage of Registers in BSPlib<\/strong><\/br><i>SAC 2019<\/i>, Apr 2019, Limassol, Cyprus. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3297280.3297421\">&#x27E8;10.1145\/3297280.3297421&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-01955283\">[hal-01955283]<\/a> Arvid Jakobsson, Frederic Dabrowski, Wadoud Bousdira, <\/br><strong>Safe Usage of Registers in BSPlib (Preprint)<\/strong><\/br>2019<\/br><\/br><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-03377146\">[hal-03377146]<\/a> Yohan Boichut, Jean-Michel Couvreur, Xavier Ferry, Mohamadou Tafsir Sakho, <\/br><strong>Modeling Concurrent Behaviors as Words<\/strong><\/br><i>Verification and Evaluation of Computer and Communication Systems<\/i>, 11847, Springer International Publishing, pp.1-15, 2019, Lecture Notes in Computer Science, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-35092-5_1\">&#x27E8;10.1007\/978-3-030-35092-5_1&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-03622785\">[hal-03622785]<\/a> Dara Ly, Nikolai Kosmatov, Julien Signoles, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Soundness of a Dataflow Analysis for Memory Monitoring<\/strong><\/br><i>Ada Letters<\/i>, 2019, 38 (2), pp.97-108. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3375408.3375416\">&#x27E8;10.1145\/3375408.3375416&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-01521746\">[hal-01521746]<\/a> Yohan Boichut, Jacques Chabin, Pierre R\u00e9ty, <\/br><strong>Towards more precise rewriting approximations<\/strong><\/br><i>Journal of Computer and System Sciences<\/i>, 2019, 104, pp.131-148<\/br><\/br><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-02162234\">[hal-02162234]<\/a> Wadoud Bousdira, <\/br><strong>Transforming non textually aligned SPMD programs into textually aligned SPMD programs by using rewriting rules<\/strong><\/br><i>IEEE\/ACM International Conference on High Performance Computing & Simulation<\/i>, Jul 2019, Dublin, Ireland. pp.982-989<\/br><\/br><a href=\"https:\/\/hal.science\/hal-02123709\">[hal-02123709]<\/a> Siva Anantharaman, Peter Hibbs, Paliath Narendran, Micha\u00ebl Rusinowitch, <\/br><strong>Unification modulo Lists with Reverse, Relation with Certain Word Equations<\/strong><\/br><i>CADE-27 - The 27th International Conference on Automated Deduction<\/i>, Association for Automated Reasoning (AAR), Aug 2019, Natal, Brazil. pp.1--17, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-29436-6_1\">&#x27E8;10.1007\/978-3-030-29436-6_1&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/theses.hal.science\/tel-03215462\">[tel-03215462]<\/a> Thibaut Tachon, <\/br><strong>Automatic Generation of Bulk-Synchronous Parallel code<\/strong><\/br>Distributed, Parallel, and Cluster Computing [cs.DC]. Universit\u00e9 d'Orl\u00e9ans, 2019. English. <a target=\"_blank\" href=\"https:\/\/www.theses.fr\/2019ORLE3098\">&#x27E8;NNT : 2019ORLE3098&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.science\/hal-02123648\">[hal-02123648]<\/a> Siva Anantharaman, Peter Hibbs, Paliath Narendran, Michael Rusinowitch, <\/br><strong>Unification modulo Lists with Reverse as Solving Simple Sets of Word Equations<\/strong><\/br>[Research Report] LIFO, Universit\u00e9 d'Orl\u00e9ans; INSA, Centre Val de Loire. 2019<\/br><\/br><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-02317127\">[hal-02317127]<\/a> Jolan Philippe, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>PySke: Algorithmic Skeletons for Python<\/strong><\/br><i>The 2019 International Conference on High Performance Computing & Simulation (HPCS)<\/i>, Jul 2019, Dublin, Ireland. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/HPCS48598.2019.9188151\">&#x27E8;10.1109\/HPCS48598.2019.9188151&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-02317074\">[hal-02317074]<\/a> Jolan Philippe, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Parallel programming with Coq:  Map and reduce skeletons on trees<\/strong><\/br><i>34th ACM\/SIGAPP Symposium on Applied Computing (SAC)<\/i>, Apr 2019, Limassol, Cyprus. pp.1578-1581, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3297280.3299742\">&#x27E8;10.1145\/3297280.3299742&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-02317055\">[hal-02317055]<\/a> Allan Blanchard, Fr\u00e9d\u00e9ric Loulergue, Nikolai Kosmatov, <\/br><strong>Towards Full Proof Automation in Frama-C Using Auto-active Verification<\/strong><\/br><i>NFM 2019 - 11th Annual NASA Formal Methods Symposium<\/i>, May 2019, Houston, TX, United States. pp.88-105, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-20652-9_6\">&#x27E8;10.1007\/978-3-030-20652-9_6&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-02318361\">[hal-02318361]<\/a> Jolan Philippe, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Towards automatically optimizing PySke programs (poster)<\/strong><\/br><i>International Conference on High Performance Computing and Simulation (HPCS)<\/i>, Jul 2019, Dublin, Ireland. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/HPCS48598.2019.9188160\">&#x27E8;10.1109\/HPCS48598.2019.9188160&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-02317118\">[hal-02317118]<\/a> Salwa Souaf, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>A First Step in the Translation of Alloy to Coq<\/strong><\/br><i>21st International Conference on Formal Engineering Methods (ICFEM)<\/i>, 2019, Shenzen, China. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-32409-4_28\">&#x27E8;10.1007\/978-3-030-32409-4_28&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-02317143\">[hal-02317143]<\/a> Allan Blanchard, Nikolai Kosmatov, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>La logique contre les fant\u00f4mes: comparaison de deux approches pour la preuve d'un module de listes cha\u00een\u00e9es *<\/strong><\/br><i>18e journ\u00e9es Approches Formelles dans l'Assistance au D\u00e9veloppement de Logic (AFADL)<\/i>, Jun 2019, Toulouse, France. <a target=\"_blank\" href=\"https:\/\/afadl2019.sciencesconf.org\"><\/a><\/br><\/br><a href=\"https:\/\/theses.hal.science\/tel-02920363\">[tel-02920363]<\/a> Filip Jakobsson, <\/br><strong>Static Analysis for BSPlib Programs<\/strong><\/br>Distributed, Parallel, and Cluster Computing [cs.DC]. Universit\u00e9 d'Orl\u00e9ans, 2019. English. <a target=\"_blank\" href=\"https:\/\/www.theses.fr\/2019ORLE2005\">&#x27E8;NNT : 2019ORLE2005&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-02100515\">[hal-02100515]<\/a> Allan Blanchard, Nikolai Kosmatov, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Logic against Ghosts: Comparison of Two Proof Approaches for a List Module<\/strong><\/br><i>SAC 2019 - The 34th ACM\/SIGAPP Symposium On Applied Computing<\/i>, Apr 2019, Limassol, Cyprus. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3297280.3297495\">&#x27E8;10.1145\/3297280.3297495&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.science\/hal-02317123\">[hal-02317123]<\/a> Fr\u00e9d\u00e9ric Loulergue, Jolan Philippe, <\/br><strong>Automatic Optimization of Python Skeletal Parallel Programs<\/strong><\/br><i>19th International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP)<\/i>, Dec 2019, Melbourne, Australia. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-38991-8_13\">&#x27E8;10.1007\/978-3-030-38991-8_13&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.science\/hal-02317124\">[hal-02317124]<\/a> Fr\u00e9d\u00e9ric Loulergue, Jolan Philippe, <\/br><strong>New List Skeletons for the Python Skeleton Library<\/strong><\/br><i>PDCAT 2019: 20th International Conference on Parallel and Distributed Computing, Applications and Technologies<\/i>, Dec 2019, Gold Coast, Australia. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/PDCAT46702.2019.00077\">&#x27E8;10.1109\/PDCAT46702.2019.00077&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-02018652\">[hal-02018652]<\/a> Frederic Dabrowski, <\/br><strong>A denotational semantics of textually aligned SPMD Program<\/strong><\/br><i>Journal of Logical and Algebraic Methods in Programming<\/i>, 2019, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.jlamp.2019.02.010\">&#x27E8;10.1016\/j.jlamp.2019.02.010&#x27E9;<\/a><\/br><\/br><hr><H2>2018<\/H2><a href=\"https:\/\/hal-univ-orleans.archives-ouvertes.fr\/hal-01780553\">[hal-01780553]<\/a> Nirina Andrianarivelo, Pierre Rety, <\/br><strong>Confluence of Prefix-Constrained Rewrite Systems<\/strong><\/br><i>3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018)<\/i>, Jul 2018, Oxford, United Kingdom<\/br><\/br><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-01903092\">[hal-01903092]<\/a> Yohan Boichut, Vivien Pelletier, Pierre Rety, <\/br><strong>Approximating any Logic Program by a CS-Program<\/strong><\/br><i>Rewriting Logic and Its Applications - 12th International Workshop<\/i>, Apr 2018, Thessalonique, Greece. pp.245--260<\/br><\/br><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-01818140\">[hal-01818140]<\/a> Arvid Jakobsson, <\/br><strong>Automatic Cost Analysis for Imperative BSP Programs<\/strong><\/br><i>International Journal of Parallel Programming<\/i>, 2018, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s10766-018-0562-1\">&#x27E8;10.1007\/s10766-018-0562-1&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-01819035\">[hal-01819035]<\/a> Ga\u00e9tan Hains, Arvid Jakobsson, Youry Khmelevsky, <\/br><strong>Towards formal methods and software engineering for deep learning: Security, safety and productivity for dl systems development<\/strong><\/br><i>2018 Annual IEEE International Systems Conference (SysCon)<\/i>, Apr 2018, Vancouver, France. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/SYSCON.2018.8369576\">&#x27E8;10.1109\/SYSCON.2018.8369576&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal-cea.archives-ouvertes.fr\/cea-02283406\">[cea-02283406]<\/a> Dara Ly, Nikolai Kosmatov, Julien Signoles, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Soundness of a Dataflow Analysis for Memory Monitoring<\/strong><\/br><i>HILT 2018 Workshop on Languages and Tools for Ensuring Cyber-Resilience in Critical Software-Intensive Systems<\/i>, Nov 2018, Boston, United States. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3375408.3375416\">&#x27E8;10.1145\/3375408.3375416&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal-univ-orleans.archives-ouvertes.fr\/hal-01643971\">[hal-01643971]<\/a> Frederic Dabrowski, <\/br><strong>Textual Alignment in SPMD Programs<\/strong><\/br><i>SAC '18: Proceedings of the 33rd Annual ACM Symposium on Applied Computing<\/i>, Apr 2018, Pau, France. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3167132.3167254\">&#x27E8;10.1145\/3167132.3167254&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-01785110\">[hal-01785110]<\/a> Fr\u00e9d\u00e9ric Dabrowski, <\/br><strong>A Denotational Semantics of Textually Aligned SPMD Programs<\/strong><\/br><i>International Conference on High Performance Computing & Simulation<\/i>, Jul 2018, Orl\u00e9ans, France. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/HPCS.2018.00119\">&#x27E8;10.1109\/HPCS.2018.00119&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-01720401\">[hal-01720401]<\/a> Allan Blanchard, Nikolai Kosmatov, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Ghosts for Lists: A Critical Module of Contiki Verified in Frama-C<\/strong><\/br><i>Tenth NASA Formal Methods Symposium - NFM 2018<\/i>, Apr 2018, Newport News, United States. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-77935-5_3\">&#x27E8;10.1007\/978-3-319-77935-5_3&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-02317078\">[hal-02317078]<\/a> Allan Blanchard, Nikolai Kosmatov, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>A Lesson on Verification of IoT Software with Frama-C<\/strong><\/br><i>2018 International Conference on High Performance Computing & Simulation (HPCS)<\/i>, Jul 2018, Orleans, France. pp.21-30, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/HPCS.2018.00018\">&#x27E8;10.1109\/HPCS.2018.00018&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-01811922\">[hal-01811922]<\/a> Fr\u00e9d\u00e9ric Loulergue, Allan Blanchard, Nikolai Kosmatov, <\/br><strong>Ghosts for Lists: from Axiomatic to Executable Specifications<\/strong><\/br><i>TAP 2018 - 12th International Conference on Tests and Proofs<\/i>, Jun 2018, Toulouse, France. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-92994-1_11\">&#x27E8;10.1007\/978-3-319-92994-1_11&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-01811932\">[hal-01811932]<\/a> Allan Blanchard, Nikolai Kosmatov, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Des listes et leurs fant\u00f4mes : v\u00e9rification d'un module critique de Contiki avec FRAMA-C<\/strong><\/br><i>17\u00e8mes Journ\u00e9es AFADL : Approches Formelles Dans L'assistance Au D\u00e9veloppement De Logiciels<\/i>, Jun 2018, Toulouse, France<\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-01777123\">[hal-01777123]<\/a> Allan Blanchard, Nikolai Kosmatov, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>MMFilter: A CHR-Based Solver for Generation of Executions under Weak Memory Models<\/strong><\/br><i>Computer Languages, Systems and Structures<\/i>, 2018, 53, pp.121-142. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.cl.2018.03.002\">&#x27E8;10.1016\/j.cl.2018.03.002&#x27E9;<\/a><\/br><\/br><hr><H2>2017<\/H2><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-01494832\">[hal-01494832]<\/a> Arvid Jakobsson, Frederic Dabrowski, Wadoud Bousdira, Fr\u00e9d\u00e9ric Loulergue, Gaetan Hains, <\/br><strong>Replicated Synchronization for Imperative BSP Programs<\/strong><\/br><i>International Conference on Computational Science (ICCS)<\/i>, 2017, Z\u00fcrich, Switzerland. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.procs.2017.05.123\">&#x27E8;10.1016\/j.procs.2017.05.123&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-02317110\">[hal-02317110]<\/a> Jolan Philippe, Wadoud Bousdira, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Formalization of a Big Graph API in Coq<\/strong><\/br><i>2017 International Conference on High Performance Computing & Simulation (HPCS)<\/i>, Jul 2017, Genoa, France. IEEE, 108, pp.893-894, 2017, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/HPCS.2017.140\">&#x27E8;10.1109\/HPCS.2017.140&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-01159182\">[hal-01159182]<\/a> Fr\u00e9d\u00e9ric Loulergue, Wadoud Bousdira, Julien Tesson, <\/br><strong>Calculating Parallel Programs in Coq using List Homomorphisms<\/strong><\/br><i>International Journal of Parallel Programming<\/i>, 2017, 45 (2), pp.300-319. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/s10766-016-0415-8\">&#x27E8;10.1007\/s10766-016-0415-8&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.science\/hal-01495453\">[hal-01495453]<\/a> Thibaut Tachon, Chong Li, Ga\u00e9tan Hains, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Automated generation of BSP automata<\/strong><\/br><i>Parallel Processing Letters<\/i>, 2017, 17 (1), <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1142\/S0129626417400023\">&#x27E8;10.1142\/S0129626417400023&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.science\/hal-01495454\">[hal-01495454]<\/a> Allan Blanchard, Fr\u00e9d\u00e9ric Loulergue, Nikolai Kosmatov, <\/br><strong>From Concurrent Programs to Simulating Sequential Programs: Correctness of a Transformation<\/strong><\/br><i>Fifth International Workshop on Verification and Program Transformation (VPT 2017)<\/i>, Apr 2017, Uppsala, Sweden. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4204\/EPTCS.253.9\">&#x27E8;10.4204\/EPTCS.253.9&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-01445668\">[hal-01445668]<\/a> Nirina Andrianarivelo, Vivien Pelletier, Pierre R\u00e9ty, <\/br><strong>Transforming Prefix-Constrained or Controlled Rewrite Systems<\/strong><\/br><i>8th International Symposium on Symbolic Computation in Software Science (SCSS 2017)<\/i>, Apr 2017, Gammarth, Tunisia<\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-02317112\">[hal-02317112]<\/a> Christopher Whitney, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Towards a Verified Parallel Implementation of Frequent Itemset Mining<\/strong><\/br><i>2017 International Conference on High Performance Computing & Simulation (HPCS)<\/i>, Jul 2017, Genoa, Italy. IEEE, pp.889-890, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/HPCS.2017.138\">&#x27E8;10.1109\/HPCS.2017.138&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-02317099\">[hal-02317099]<\/a> Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Implementing Algorithmic Skeletons with Bulk Synchronous Parallel ML<\/strong><\/br><i>2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)<\/i>, Dec 2017, Taipei, Taiwan. pp.461-468, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/PDCAT.2017.00079\">&#x27E8;10.1109\/PDCAT.2017.00079&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-02317101\">[hal-02317101]<\/a> Virginia Niculescu, Fr\u00e9d\u00e9ric Loulergue, Darius Bufnea, Adrian Sterca, <\/br><strong>A Java Framework for High Level Parallel Programming Using Powerlists<\/strong><\/br><i>2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)<\/i>, Dec 2017, Taipei, France. pp.255-262, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/PDCAT.2017.00049\">&#x27E8;10.1109\/PDCAT.2017.00049&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-02317103\">[hal-02317103]<\/a> Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>A BSPlib-style API for Bulk Synchronous Parallel ML<\/strong><\/br><i>Scalable Computing: Practice and Experience<\/i>, 2017, 18 (3), <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.12694\/scpe.v18i3.1306\">&#x27E8;10.12694\/scpe.v18i3.1306&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-02317113\">[hal-02317113]<\/a> Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Special Issue of Scalable Computing: Practice and Experience on Practical Aspects of High-Level Parallel Programming<\/strong><\/br><i>Scalable Computing: Practice and Experience<\/i>, 18 (1), 2017, Scalable Computing: Practice and Experience, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.12694\/scpe.v18i1.1229\">&#x27E8;10.12694\/scpe.v18i1.1229&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-01495456\">[hal-01495456]<\/a> Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Imperative BSPlib-style Communications in Bulk Synchronous Parallel ML<\/strong><\/br><i>International Conference on Computational Science<\/i>, Jun 2017, Zurich, Switzerland. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.procs.2017.05.267\">&#x27E8;10.1016\/j.procs.2017.05.267&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-02317096\">[hal-02317096]<\/a> Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>A Verified Accumulate Algorithmic Skeleton<\/strong><\/br><i>2017 Fifth International Symposium on Computing and Networking (CANDAR)<\/i>, Nov 2017, Aomori, France. pp.420-426, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/CANDAR.2017.108\">&#x27E8;10.1109\/CANDAR.2017.108&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-01944569\">[hal-01944569]<\/a> Jean-Michel Couvreur, Joaqu\u00edn Ezpeleta, <\/br><strong>A Linear Temporal Logic Model Checking Method over Finite Words with Correlated Transition Attributes<\/strong><\/br><i>7th International Symposium on Data-Driven Process Discovery and Analysis (SIMPDA)<\/i>, Dec 2017, Neuch\u00e2tel, Switzerland. pp.89-104, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-11638-5_5\">&#x27E8;10.1007\/978-3-030-11638-5_5&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-01559832\">[hal-01559832]<\/a> Frederic Dabrowski, <\/br><strong>Textual Alignment in SPMD Programs<\/strong><\/br>[Research Report] RR-2017-07, LIFO, Universit\u00e9 d'Orl\u00e9ans. 2017<\/br><\/br><hr><H2>2016<\/H2><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-01291393\">[hal-01291393]<\/a> Yohan Boichut, Pierre R\u00e9ty, Vivien Pelletier, <\/br><strong>Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems<\/strong><\/br><i>International Workshop on Rewriting Logic and its Applications<\/i>, Apr 2016, Eindhoven, Netherlands<\/br><\/br><a href=\"https:\/\/hal.science\/hal-01318432\">[hal-01318432]<\/a> Allan Blanchard, Nikolai Kosmatov, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>A CHR-Based Solver for Weak Memory Behaviors<\/strong><\/br><i>7th Workshop on Constraint Solvers in Testing, Verification, and Analysis (CSTVA)<\/i>, Jul 2016, Saarbr\u00fccken, Germany<\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-01423641\">[hal-01423641]<\/a> Allan Blanchard, Nikolai Kosmatov, Matthieu Lemerre, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Conc2Seq: A Frama-C Plugin for Verification of Parallel Compositions of C Programs<\/strong><\/br><i>2016 IEEE 16th International Working Conference on Source Code Analysis and Manipulation (SCAM)<\/i>, 2016, Raleigh, NC, United States. pp.6, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1109\/SCAM.2016.18\">&#x27E8;10.1109\/SCAM.2016.18&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-01319565\">[hal-01319565]<\/a> Thibaut Tachon, Ga\u00e9tan Hains, Fr\u00e9d\u00e9ric Loulergue, Chong Li, <\/br><strong>Automated generation of BSP automata<\/strong><\/br><i>High Level Parallel Programming and Applications (HLPP)<\/i>, Jul 2016, M\u00fcnster, Germany<\/br><\/br><hr><H2>2015<\/H2><a href=\"https:\/\/hal.inria.fr\/hal-01107296\">[hal-01107296]<\/a> Fr\u00e9d\u00e9ric Loulergue, Wadoud Bousdira, Julien Tesson, <\/br><strong>Calcul de programmes parall\u00e8les avec Coq<\/strong><\/br><i>Informatique Math\u00e9matique<\/i>, <a target=\"_blank\" href=\"http:\/\/www.univ-orleans.fr\/lifo\/evenements\/EJCIM2015\/\">CNRS \u00c9ditions<\/a>, 2015, collection Alpha<\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-01143199\">[hal-01143199]<\/a> Fr\u00e9d\u00e9ric Dabrowski, Fr\u00e9d\u00e9ric Loulergue, Thomas Pinsard, <\/br><strong>A formal semantics of nested atomic sections with thread escape<\/strong><\/br><i>Computer Languages, Systems and Structures<\/i>, 2015, 42 (supl), pp.2-21. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.cl.2015.04.001\">&#x27E8;10.1016\/j.cl.2015.04.001&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-01105093\">[hal-01105093]<\/a> Fr\u00e9d\u00e9ric Dabrowski, Fr\u00e9d\u00e9ric Loulergue, Thomas Pinsard, <\/br><strong>Nested atomic sections with thread escape: Compilation to threads and locks<\/strong><\/br><i>ACM Symposium on Applied Computing (SAC)<\/i>, Apr 2015, Salamanca, Spain<\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-01225332\">[hal-01225332]<\/a> Nirina Andrianarivelo, Pierre R\u00e9ty, <\/br><strong>Over-Approximating Terms Reachable by Context-Sensitive Rewriting<\/strong><\/br><i>Reachability Problems - 9th International Workshop RP 2015<\/i>, Sep 2015, Varsaw, Poland<\/br><\/br><a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-01135918\">[hal-01135918]<\/a> Yohan Boichut, Jacques Chabin, Pierre R\u00e9ty, <\/br><strong>Towards More Precise Rewriting Approximations<\/strong><\/br><i>Proceedings of Language and Automata Theory and Applications (LATA)<\/i>, Mar 2015, Nice, France<\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-01158137\">[hal-01158137]<\/a> Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Construction de programmes parall\u00e8les en Coq avec des homomorphismes de listes<\/strong><\/br><i>14\u00e8mes journ\u00e9es Approches Formelles dans l'Assistance au D\u00e9veloppement Logiciel (AFADL)<\/i>, 2015, Bordeaux, France<\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-01158134\">[hal-01158134]<\/a> Asma Guesmi, Patrice Clemente, Fr\u00e9d\u00e9ric Loulergue, Pascal Berthom\u00e9, <\/br><strong>Cloud Resources Placement Based on Functional and Non-Functional Requirements<\/strong><\/br><i>SECRYPT<\/i>, Jul 2015, Colmar, France<\/br><\/br><a href=\"https:\/\/hal-cea.archives-ouvertes.fr\/cea-01834977\">[cea-01834977]<\/a> Allan Blanchard, N. Kosmatov, M. Lemerre, Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>A case study on formal verification of the anaxagoros hypervisor paging system with frama-C<\/strong><\/br><i>FMICS 2015 - Formal Methods for Industrial Critical Systems<\/i>, Jun 2015, Oslo, Norway. pp.15-30, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-319-19458-5_2\">&#x27E8;10.1007\/978-3-319-19458-5_2&#x27E9;<\/a><\/br><\/br><a href=\"https:\/\/hal.inria.fr\/hal-01158138\">[hal-01158138]<\/a> Fr\u00e9d\u00e9ric Loulergue, <\/br><strong>Mod\u00e8les fonctionnels de MapReduce en Coq<\/strong><\/br><i>Journ\u00e9es Nationales du GdR GPL<\/i>, 2015, Bordeaux, France<\/br><\/br><br><\/p><br><\/p>\n\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":4,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-18","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.univ-orleans.fr\/lifo\/equipes\/lmv\/index.php\/wp-json\/wp\/v2\/pages\/18","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.univ-orleans.fr\/lifo\/equipes\/lmv\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.univ-orleans.fr\/lifo\/equipes\/lmv\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.univ-orleans.fr\/lifo\/equipes\/lmv\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.univ-orleans.fr\/lifo\/equipes\/lmv\/index.php\/wp-json\/wp\/v2\/comments?post=18"}],"version-history":[{"count":7,"href":"https:\/\/www.univ-orleans.fr\/lifo\/equipes\/lmv\/index.php\/wp-json\/wp\/v2\/pages\/18\/revisions"}],"predecessor-version":[{"id":51,"href":"https:\/\/www.univ-orleans.fr\/lifo\/equipes\/lmv\/index.php\/wp-json\/wp\/v2\/pages\/18\/revisions\/51"}],"wp:attachment":[{"href":"https:\/\/www.univ-orleans.fr\/lifo\/equipes\/lmv\/index.php\/wp-json\/wp\/v2\/media?parent=18"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}