<?xml version="1.0"?>
<dblpperson name="Xavier Urbain" pid="u/XavierUrbain" n="32">
<person key="homepages/u/XavierUrbain" mdate="2008-03-13">
<author pid="u/XavierUrbain">Xavier Urbain</author>
<url>http://www3.ensiie.fr/~urbain/</url>
</person>
<r><inproceedings key="conf/sirocco/BonnetBCDRTU25" mdate="2025-06-10">
<author pid="73/1458">Fran&#231;ois Bonnet 0001</author>
<author pid="135/6301">Quentin Bramas</author>
<author pid="02/1920">Pierre Courtieu</author>
<author pid="d/XavierDefago">Xavier D&#233;fago</author>
<author pid="33/1736">Lionel Rieg</author>
<author pid="t/SebastienTixeuil">S&#233;bastien Tixeuil</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Deterministic Color-Optimal Self-stabilizing Semi-synchronous Gathering: A Certified Algorithm.</title>
<pages>127-143</pages>
<year>2025</year>
<booktitle>SIROCCO</booktitle>
<ee>https://doi.org/10.1007/978-3-031-91736-3_8</ee>
<crossref>conf/sirocco/2025</crossref>
<url>db/conf/sirocco/sirocco2025.html#BonnetBCDRTU25</url>
<stream>streams/conf/sirocco</stream>
</inproceedings>
</r>
<r><article key="journals/lites/CourtieuRTU22" mdate="2023-01-27">
<author pid="02/1920">Pierre Courtieu</author>
<author pid="33/1736">Lionel Rieg</author>
<author pid="t/SebastienTixeuil">S&#233;bastien Tixeuil</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Swarms of Mobile Robots: Towards Versatility with Safety.</title>
<pages>02:1-02:36</pages>
<year>2022</year>
<volume>8</volume>
<journal>Leibniz Trans. Embed. Syst.</journal>
<number>2</number>
<ee type="oa">https://doi.org/10.4230/LITES.8.2.2</ee>
<url>db/journals/lites/lites8.html#CourtieuRTU22</url>
</article>
</r>
<r><inproceedings key="conf/sss/BalabonskiCPRTU21" mdate="2021-11-10">
<author pid="26/8036">Thibaut Balabonski</author>
<author pid="02/1920">Pierre Courtieu</author>
<author pid="212/5347">Robin Pelle</author>
<author pid="33/1736">Lionel Rieg</author>
<author pid="t/SebastienTixeuil">S&#233;bastien Tixeuil</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Computer Aided Formal Design of Swarm Robotics Algorithms.</title>
<pages>469-473</pages>
<year>2021</year>
<booktitle>SSS</booktitle>
<ee>https://doi.org/10.1007/978-3-030-91081-5_31</ee>
<crossref>conf/sss/2021</crossref>
<url>db/conf/sss/sss2021.html#BalabonskiCPRTU21</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-2101-06966" mdate="2021-01-22">
<author pid="26/8036">Thibaut Balabonski</author>
<author pid="02/1920">Pierre Courtieu</author>
<author pid="212/5347">Robin Pelle</author>
<author pid="33/1736">Lionel Rieg</author>
<author pid="t/SebastienTixeuil">S&#233;bastien Tixeuil</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Computer Aided Formal Design of Swarm Robotics Algorithms.</title>
<year>2021</year>
<volume>abs/2101.06966</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2101.06966</ee>
<url>db/journals/corr/corr2101.html#abs-2101-06966</url>
</article>
</r>
<r><article key="journals/mst/BalabonskiDRTU19" mdate="2019-04-12">
<author pid="26/8036">Thibaut Balabonski</author>
<author pid="188/7190">Am&#233;lie Delga</author>
<author pid="33/1736">Lionel Rieg</author>
<author orcid="0000-0002-0948-7172" pid="t/SebastienTixeuil">S&#233;bastien Tixeuil</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Synchronous Gathering without Multiplicity Detection: a Certified Algorithm.</title>
<pages>200-218</pages>
<year>2019</year>
<volume>63</volume>
<journal>Theory Comput. Syst.</journal>
<number>2</number>
<ee>https://doi.org/10.1007/s00224-017-9828-z</ee>
<url>db/journals/mst/mst63.html#BalabonskiDRTU19</url>
</article>
</r>
<r><inproceedings key="conf/netys/BalabonskiCPRTU19" mdate="2019-09-16">
<author pid="26/8036">Thibaut Balabonski</author>
<author pid="02/1920">Pierre Courtieu</author>
<author pid="212/5347">Robin Pelle</author>
<author pid="33/1736">Lionel Rieg</author>
<author pid="t/SebastienTixeuil">S&#233;bastien Tixeuil</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots.</title>
<pages>93-109</pages>
<year>2019</year>
<booktitle>NETYS</booktitle>
<ee>https://doi.org/10.1007/978-3-030-31277-0_7</ee>
<crossref>conf/netys/2019</crossref>
<url>db/conf/netys/netys2019.html#BalabonskiCPRTU19</url>
</inproceedings>
</r>
<r><incollection key="series/lncs/Potop-ButucaruSTU19" mdate="2019-02-20">
<author pid="p/MariaPotopButucaru">Maria Potop-Butucaru</author>
<author pid="94/3760">Nathalie Sznajder</author>
<author pid="t/SebastienTixeuil">S&#233;bastien Tixeuil</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Formal Methods for Mobile Robots.</title>
<pages>278-313</pages>
<year>2019</year>
<booktitle>Distributed Computing by Mobile Entities</booktitle>
<ee>https://doi.org/10.1007/978-3-030-11072-7_12</ee>
<crossref>series/lncs/11340</crossref>
<url>db/series/lncs/lncs11340.html#Potop-ButucaruSTU19</url>
</incollection>
</r>
<r><inproceedings key="conf/sss/BalabonskiCPRTU18" mdate="2018-10-25">
<author pid="26/8036">Thibaut Balabonski</author>
<author pid="02/1920">Pierre Courtieu</author>
<author pid="212/5347">Robin Pelle</author>
<author pid="33/1736">Lionel Rieg</author>
<author pid="t/SebastienTixeuil">S&#233;bastien Tixeuil</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Brief Announcement Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots.</title>
<pages>404-408</pages>
<year>2018</year>
<booktitle>SSS</booktitle>
<ee>https://doi.org/10.1007/978-3-030-03232-6_29</ee>
<crossref>conf/sss/2018</crossref>
<url>db/conf/sss/sss2018.html#BalabonskiCPRTU18</url>
</inproceedings>
</r>
<r><inproceedings key="conf/fmics/BalabonskiCRTU17" mdate="2017-09-05">
<author pid="26/8036">Thibaut Balabonski</author>
<author pid="02/1920">Pierre Courtieu</author>
<author pid="33/1736">Lionel Rieg</author>
<author pid="t/SebastienTixeuil">S&#233;bastien Tixeuil</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Certified Gathering of Oblivious Mobile Robots: Survey of Recent Results and Open Problems.</title>
<pages>165-181</pages>
<year>2017</year>
<booktitle>FMICS-AVoCS</booktitle>
<ee>https://doi.org/10.1007/978-3-319-67113-0_11</ee>
<crossref>conf/fmics/2017</crossref>
<url>db/conf/fmics/fmics2017.html#BalabonskiCRTU17</url>
</inproceedings>
</r>
<r><inproceedings key="conf/podc/CourtieuRTU16" mdate="2018-11-06">
<author pid="02/1920">Pierre Courtieu</author>
<author pid="33/1736">Lionel Rieg</author>
<author pid="t/SebastienTixeuil">S&#233;bastien Tixeuil</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Brief Announcement: Certified Universal Gathering in R<sup>2</sup> for Oblivious Mobile Robots.</title>
<pages>439-441</pages>
<year>2016</year>
<booktitle>PODC</booktitle>
<ee>https://doi.org/10.1145/2933057.2933070</ee>
<crossref>conf/podc/2016</crossref>
<url>db/conf/podc/podc2016.html#CourtieuRTU16</url>
</inproceedings>
</r>
<r><inproceedings key="conf/sss/BalabonskiDRTU16" mdate="2017-05-25">
<author pid="26/8036">Thibaut Balabonski</author>
<author pid="188/7190">Am&#233;lie Delga</author>
<author pid="33/1736">Lionel Rieg</author>
<author pid="t/SebastienTixeuil">S&#233;bastien Tixeuil</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Synchronous Gathering Without Multiplicity Detection: A Certified Algorithm.</title>
<pages>7-19</pages>
<year>2016</year>
<booktitle>SSS</booktitle>
<ee>https://doi.org/10.1007/978-3-319-49259-9_2</ee>
<crossref>conf/sss/2016</crossref>
<url>db/conf/sss/sss2016.html#BalabonskiDRTU16</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wdag/CourtieuRTU16" mdate="2017-05-19">
<author pid="02/1920">Pierre Courtieu</author>
<author pid="33/1736">Lionel Rieg</author>
<author pid="t/SebastienTixeuil">S&#233;bastien Tixeuil</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Certified Universal Gathering in \mathbb R ^2 for Oblivious Mobile Robots.</title>
<pages>187-200</pages>
<year>2016</year>
<booktitle>DISC</booktitle>
<ee>https://doi.org/10.1007/978-3-662-53426-7_14</ee>
<crossref>conf/wdag/2016</crossref>
<url>db/conf/wdag/disc2016.html#CourtieuRTU16</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/CourtieuRTU16" mdate="2018-08-13">
<author pid="02/1920">Pierre Courtieu</author>
<author pid="33/1736">Lionel Rieg</author>
<author pid="t/SebastienTixeuil">S&#233;bastien Tixeuil</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Certified Universal Gathering in $R^2$ for Oblivious Mobile Robots.</title>
<year>2016</year>
<volume>abs/1602.08361</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1602.08361</ee>
<url>db/journals/corr/corr1602.html#CourtieuRTU16</url>
</article>
</r>
<r><article key="journals/ipl/CourtieuRTU15" mdate="2017-06-06">
<author pid="02/1920">Pierre Courtieu</author>
<author pid="33/1736">Lionel Rieg</author>
<author orcid="0000-0002-0948-7172" pid="t/SebastienTixeuil">S&#233;bastien Tixeuil</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Impossibility of gathering, a certification.</title>
<pages>447-452</pages>
<year>2015</year>
<volume>115</volume>
<journal>Inf. Process. Lett.</journal>
<number>3</number>
<ee>https://doi.org/10.1016/j.ipl.2014.11.001</ee>
<url>db/journals/ipl/ipl115.html#CourtieuRTU15</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/CourtieuRTU15" mdate="2018-08-13">
<author pid="02/1920">Pierre Courtieu</author>
<author pid="33/1736">Lionel Rieg</author>
<author pid="t/SebastienTixeuil">S&#233;bastien Tixeuil</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>A Certified Universal Gathering Algorithm for Oblivious Mobile Robots.</title>
<year>2015</year>
<volume>abs/1506.01603</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1506.01603</ee>
<url>db/journals/corr/corr1506.html#CourtieuRTU15</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/CourtieuRUT14" mdate="2018-08-13">
<author pid="02/1920">Pierre Courtieu</author>
<author pid="33/1736">Lionel Rieg</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<author pid="t/SebastienTixeuil">S&#233;bastien Tixeuil</author>
<title>Impossibility of Gathering, a Certification.</title>
<year>2014</year>
<volume>abs/1405.5902</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1405.5902</ee>
<url>db/journals/corr/corr1405.html#CourtieuRUT14</url>
</article>
</r>
<r><inproceedings key="conf/sss/AugerBCTU13" mdate="2017-05-25">
<author pid="131/6674">C&#233;dric Auger</author>
<author pid="08/1098">Zohir Bouzid</author>
<author pid="02/1920">Pierre Courtieu</author>
<author pid="t/SebastienTixeuil">S&#233;bastien Tixeuil</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Certified Impossibility Results for Byzantine-Tolerant Mobile Robots.</title>
<pages>178-190</pages>
<year>2013</year>
<booktitle>SSS</booktitle>
<ee>https://doi.org/10.1007/978-3-319-03089-0_13</ee>
<crossref>conf/sss/2013</crossref>
<url>db/conf/sss/sss2013.html#AugerBCTU13</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/AugerBCTU13" mdate="2018-08-13">
<author pid="131/6674">C&#233;dric Auger</author>
<author pid="08/1098">Zohir Bouzid</author>
<author pid="02/1920">Pierre Courtieu</author>
<author pid="t/SebastienTixeuil">S&#233;bastien Tixeuil</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Certified Impossibility Results for Byzantine-Tolerant Mobile Robots.</title>
<year>2013</year>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1306.4242</ee>
<volume>abs/1306.4242</volume>
<url>db/journals/corr/corr1306.html#AugerBCTU13</url>
</article>
</r>
<r><inproceedings key="conf/rta/ContejeanCFPU11" mdate="2018-08-23">
<author pid="99/5593">Evelyne Contejean</author>
<author pid="02/1920">Pierre Courtieu</author>
<author pid="75/6957">Julien Forest</author>
<author pid="30/4676">Olivier Pons</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Automated Certified Proofs with CiME3.</title>
<pages>21-30</pages>
<year>2011</year>
<booktitle>RTA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.RTA.2011.21</ee>
<crossref>conf/rta/2011</crossref>
<url>db/conf/rta/rta2011.html#ContejeanCFPU11</url>
</inproceedings>
</r>
<r><inproceedings key="conf/pepm/ContejeanPUCPF10" mdate="2025-11-15">
<author pid="99/5593">Evelyne Contejean</author>
<author pid="118/8430">Andrey Paskevich</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<author pid="02/1920">Pierre Courtieu</author>
<author orcid="0000-0001-6423-8630" pid="30/4676">Olivier Pons</author>
<author pid="75/6957">Julien Forest</author>
<title>A3PAT, an approach for certified automated termination proofs.</title>
<pages>63-72</pages>
<year>2010</year>
<booktitle>PEPM</booktitle>
<ee>https://doi.org/10.1145/1706356.1706370</ee>
<ee>https://www.wikidata.org/entity/Q130991565</ee>
<crossref>conf/pepm/2010</crossref>
<url>db/conf/pepm/pepm2010.html#ContejeanPUCPF10</url>
</inproceedings>
</r>
<r><article key="journals/lisp/DuranLMMU08" mdate="2023-09-20">
<author orcid="0000-0001-5864-8094" pid="72/6497">Francisco Dur&#225;n 0001</author>
<author orcid="0000-0001-9923-2108" pid="l/SalvadorLucas">Salvador Lucas</author>
<author pid="85/1251">Claude March&#233;</author>
<author pid="m/JoseMeseguer">Jos&#233; Meseguer 0001</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Proving operational termination of membership equational programs.</title>
<pages>59-88</pages>
<year>2008</year>
<volume>21</volume>
<journal>High. Order Symb. Comput.</journal>
<number>1-2</number>
<ee>https://doi.org/10.1007/s10990-008-9028-2</ee>
<url>db/journals/lisp/lisp21.html#DuranLMMU08</url>
</article>
</r>
<r><inproceedings key="conf/rta/GutierrezLU08" mdate="2017-06-05">
<author orcid="0000-0002-3984-2868" pid="08/329">Ra&#250;l Guti&#233;rrez</author>
<author orcid="0000-0001-9923-2108" pid="l/SalvadorLucas">Salvador Lucas</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Usable Rules for Context-Sensitive Rewrite Systems.</title>
<pages>126-141</pages>
<year>2008</year>
<booktitle>RTA</booktitle>
<ee>https://doi.org/10.1007/978-3-540-70590-1_9</ee>
<crossref>conf/rta/2008</crossref>
<url>db/conf/rta/rta2008.html#GutierrezLU08</url>
</inproceedings>
</r>
<r><inproceedings key="conf/tphol/CourtieuFU08" mdate="2017-05-23">
<author pid="02/1920">Pierre Courtieu</author>
<author pid="75/6957">Julien Forest</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Certifying a Termination Criterion Based on Graphs, without Graphs.</title>
<pages>183-198</pages>
<year>2008</year>
<booktitle>TPHOLs</booktitle>
<ee>https://doi.org/10.1007/978-3-540-71067-7_17</ee>
<crossref>conf/tphol/2008</crossref>
<url>db/conf/tphol/tphol2008.html#CourtieuFU08</url>
</inproceedings>
</r>
<r><inproceedings key="conf/frocos/ContejeanCFPU07" mdate="2017-05-21">
<author pid="99/5593">Evelyne Contejean</author>
<author pid="02/1920">Pierre Courtieu</author>
<author pid="75/6957">Julien Forest</author>
<author pid="30/4676">Olivier Pons</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Certification of Automated Termination Proofs.</title>
<pages>148-162</pages>
<year>2007</year>
<crossref>conf/frocos/2007</crossref>
<booktitle>FroCoS</booktitle>
<ee>https://doi.org/10.1007/978-3-540-74621-8_10</ee>
<url>db/conf/frocos/frocos2007.html#ContejeanCFPU07</url>
</inproceedings>
</r>
<r><article key="journals/jar/ContejeanMTU05" mdate="2021-07-25">
<author pid="99/5593">Evelyne Contejean</author>
<author orcid="0000-0003-3035-1269" pid="85/1251">Claude March&#233;</author>
<author orcid="0000-0002-1776-4897" pid="08/5668">Ana Paula Tom&#225;s</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Mechanically Proving Termination Using Polynomial Interpretations.</title>
<pages>325-363</pages>
<year>2005</year>
<volume>34</volume>
<journal>J. Autom. Reason.</journal>
<number>4</number>
<ee>https://doi.org/10.1007/s10817-005-9022-x</ee>
<url>db/journals/jar/jar34.html#ContejeanMTU05</url>
</article>
</r>
<r><article key="journals/jar/Urbain04" mdate="2020-09-02">
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Modular &#38; Incremental Automated Termination Proofs.</title>
<pages>315-355</pages>
<year>2004</year>
<volume>32</volume>
<journal>J. Autom. Reason.</journal>
<number>4</number>
<url>db/journals/jar/jar32.html#Urbain04</url>
<ee>https://doi.org/10.1007/BF03177743</ee>
</article>
</r>
<r><article key="journals/jlp/MarchePU04" mdate="2021-07-25">
<author orcid="0000-0003-3035-1269" pid="85/1251">Claude March&#233;</author>
<author pid="85/4254">Christine Paulin-Mohring</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>The KRAKATOA tool for certificationof JAVA/JAVACARD programs annotated in JML.</title>
<pages>89-106</pages>
<year>2004</year>
<volume>58</volume>
<journal>J. Log. Algebraic Methods Program.</journal>
<number>1-2</number>
<ee type="oa">https://doi.org/10.1016/j.jlap.2003.07.006</ee>
<url>db/journals/jlp/jlp58.html#MarchePU04</url>
</article>
</r>
<r><article key="journals/jsc/MarcheU04" mdate="2021-07-25">
<author orcid="0000-0003-3035-1269" pid="85/1251">Claude March&#233;</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Modular and incremental proofs of AC-termination.</title>
<pages>873-897</pages>
<year>2004</year>
<volume>38</volume>
<journal>J. Symb. Comput.</journal>
<number>1</number>
<ee type="oa">https://doi.org/10.1016/j.jsc.2004.02.003</ee>
<url>db/journals/jsc/jsc38.html#MarcheU04</url>
</article>
</r>
<r><inproceedings key="conf/pepm/DuranLMMU04" mdate="2023-09-20">
<author pid="72/6497">Francisco Dur&#225;n 0001</author>
<author orcid="0000-0001-9923-2108" pid="l/SalvadorLucas">Salvador Lucas</author>
<author pid="m/JoseMeseguer">Jos&#233; Meseguer 0001</author>
<author pid="85/1251">Claude March&#233;</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Proving termination of membership equational programs.</title>
<pages>147-158</pages>
<year>2004</year>
<crossref>conf/pepm/2004</crossref>
<booktitle>PEPM</booktitle>
<ee>https://doi.org/10.1145/1014007.1014022</ee>
<url>db/conf/pepm/pepm2004.html#DuranLMMU04</url>
</inproceedings>
</r>
<r><phdthesis key="phd/hal/Urbain01" mdate="2020-07-21">
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Approche incr&#233;mentale des preuves automatiques de terminaison. (Incremental Approach for Automated Termination Proofs).</title>
<year>2001</year>
<school>University of Paris-Sud, Orsay, France</school>
<ee type="oa">https://tel.archives-ouvertes.fr/tel-02061902</ee>
</phdthesis>
</r>
<r><inproceedings key="conf/cade/Urbain01" mdate="2017-05-21">
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems.</title>
<pages>485-498</pages>
<year>2001</year>
<crossref>conf/cade/2001</crossref>
<booktitle>IJCAR</booktitle>
<ee>https://doi.org/10.1007/3-540-45744-5_42</ee>
<url>db/conf/cade/ijcar2001.html#Urbain01</url>
</inproceedings>
</r>
<r><inproceedings key="conf/rta/MarcheU98" mdate="2017-05-23">
<author pid="85/1251">Claude March&#233;</author>
<author pid="u/XavierUrbain">Xavier Urbain</author>
<title>Termination of Associative-Commutative Rewriting by Dependency Pairs.</title>
<pages>241-255</pages>
<ee>https://doi.org/10.1007/BFb0052374</ee>
<year>1998</year>
<crossref>conf/rta/1998</crossref>
<booktitle>RTA</booktitle>
<url>db/conf/rta/rta98.html#MarcheU98</url>
</inproceedings>
</r>
<coauthors n="24" nc="1">
<co c="0"><na f="a/Auger:C=eacute=dric" pid="131/6674">C&#233;dric Auger</na></co>
<co c="0"><na f="b/Balabonski:Thibaut" pid="26/8036">Thibaut Balabonski</na></co>
<co c="0"><na f="b/Bonnet_0001:Fran=ccedil=ois" pid="73/1458">Fran&#231;ois Bonnet 0001</na></co>
<co c="0"><na f="b/Bouzid:Zohir" pid="08/1098">Zohir Bouzid</na></co>
<co c="0"><na f="b/Bramas:Quentin" pid="135/6301">Quentin Bramas</na></co>
<co c="0"><na f="c/Contejean:Evelyne" pid="99/5593">Evelyne Contejean</na></co>
<co c="0"><na f="c/Courtieu:Pierre" pid="02/1920">Pierre Courtieu</na></co>
<co c="0"><na f="d/D=eacute=fago:Xavier" pid="d/XavierDefago">Xavier D&#233;fago</na></co>
<co c="0"><na f="d/Delga:Am=eacute=lie" pid="188/7190">Am&#233;lie Delga</na></co>
<co c="0"><na f="d/Dur=aacute=n_0001:Francisco" pid="72/6497">Francisco Dur&#225;n 0001</na></co>
<co c="0"><na f="f/Forest:Julien" pid="75/6957">Julien Forest</na></co>
<co c="0"><na f="g/Guti=eacute=rrez:Ra=uacute=l" pid="08/329">Ra&#250;l Guti&#233;rrez</na></co>
<co c="0"><na f="l/Lucas:Salvador" pid="l/SalvadorLucas">Salvador Lucas</na></co>
<co c="0"><na f="m/March=eacute=:Claude" pid="85/1251">Claude March&#233;</na></co>
<co c="0"><na f="m/Meseguer_0001:Jos=eacute=" pid="m/JoseMeseguer">Jos&#233; Meseguer 0001</na></co>
<co c="0" n="2"><na f="p/Paskevich:Andrei" pid="118/8430">Andrei Paskevich</na><na>Andrey Paskevich</na></co>
<co c="0"><na f="p/Paulin=Mohring:Christine" pid="85/4254">Christine Paulin-Mohring</na></co>
<co c="0"><na f="p/Pelle:Robin" pid="212/5347">Robin Pelle</na></co>
<co c="0"><na f="p/Pons:Olivier" pid="30/4676">Olivier Pons</na></co>
<co c="0"><na f="p/Potop=Butucaru:Maria" pid="p/MariaPotopButucaru">Maria Potop-Butucaru</na></co>
<co c="0"><na f="r/Rieg:Lionel" pid="33/1736">Lionel Rieg</na></co>
<co c="0"><na f="s/Sznajder:Nathalie" pid="94/3760">Nathalie Sznajder</na></co>
<co c="0"><na f="t/Tixeuil:S=eacute=bastien" pid="t/SebastienTixeuil">S&#233;bastien Tixeuil</na></co>
<co c="0"><na f="t/Tom=aacute=s:Ana_Paula" pid="08/5668">Ana Paula Tom&#225;s</na></co>
</coauthors>
</dblpperson>

