2009-journal.bib

@comment{{This file has been generated by bib2bib 1.98}}
@comment{{Command line: /usr/bin/bib2bib -oc 2009-journal.cite -ob 2009-journal.bib -c 'year = 2009 and topics : "team" and $type="article"' /home/marche/biblio/abbrevs.bib /home/marche/biblio/demons.bib /home/marche/biblio/demons2.bib /home/marche/biblio/demons3.bib /home/marche/biblio/team.bib /home/marche/biblio/crossrefs.bib}}
@article{audebaud07scp,
  author = {Philippe Audebaud and Christine Paulin-Mohring},
  title = {Proofs of Randomized Algorithms in {Coq}},
  journal = {Science of Computer Programming},
  year = 2009,
  volume = {74},
  number = {8},
  pages = {568--589},
  topics = {team},
  type_publi = {irevcomlec},
  type_digiteo = {revue_cl},
  doi = {10.1016/j.scico.2007.09.002},
  x-pdf = {http://www.lri.fr/~paulin/ALEA/random-scp.pdf},
  hal = {http://hal.inria.fr/inria-00431771/en/},
  x-equipes = {demons PROVAL EXT},
  x-type = {article},
  x-support = {revue},
  x-cle-support = {SCP},
  x-editorial-board = {yes},
  x-international-audience = {yes}
}
@article{bol08tc2,
  author = {Sylvie Boldo and Marc Daumas and Ren-Cang Li},
  title = {Formally Verified Argument Reduction with a Fused-Multiply-Add},
  journal = {IEEE Transactions on Computers},
  year = {2009},
  volume = {58},
  number = {8},
  issn = {0018-9340},
  pages = {1139-1145},
  doi = {10.1109/TC.2008.216},
  publisher = {IEEE Computer Society},
  address = {Los Alamitos, CA, USA},
  url = {http://arxiv.org/abs/0708.3722},
  topics = {team,lri},
  type_publi = {irevcomlec},
  type_digiteo = {revue_cl},
  x-pdf = {http://arxiv.org/pdf/0708.3722v1},
  x-equipes = {demons PROVAL EXT},
  x-type = {article},
  x-support = {revue},
  x-cle-support = {ITComputers},
  x-editorial-board = {yes},
  x-international-audience = {yes},
  x-pays = {US}
}
@article{bol08tc3,
  author = {Sylvie Boldo},
  title = {{K}ahan's algorithm for a correct discriminant computation at last formally proven},
  journal = {IEEE Transactions on Computers},
  volume = {58},
  number = {2},
  issn = {0018-9340},
  year = {2009},
  pages = {220-225},
  doi = {10.1109/TC.2008.200},
  publisher = {IEEE Computer Society},
  month = feb,
  topics = {team,lri},
  type_publi = {irevcomlec},
  type_digiteo = {revue_cl},
  x-pdf = {http://hal.inria.fr/docs/00/17/14/97/PDF/discri.pdf},
  hal = {http://hal.inria.fr/inria-00171497/en/},
  x-equipes = {demons PROVAL},
  x-type = {article},
  x-support = {revue},
  x-cle-support = {ITComputers},
  x-editorial-board = {yes},
  x-international-audience = {yes}
}
@article{bolmel09bit,
  author = {Siegfried M. Rump and Paul Zimmermann and Sylvie Boldo and Guillaume Melquiond},
  title = {Computing predecessor and successor in rounding to nearest},
  journal = {BIT},
  year = {2009},
  volume = {49},
  number = {2},
  month = jun,
  pages = {419--431},
  doi = {10.1007/s10543-009-0218-z},
  hal = {http://hal.inria.fr/inria-00337537/},
  topics = {team},
  x-equipes = {demons PROVAL},
  x-type = {article},
  x-support = {revue},
  x-pays = {DE},
  x-international-audience = {yes},
  x-editorial-board = {yes}
}