Formally Verified Certificate Checkers for Hardest-to-Round Computation. Martin-Dorel, É.; Hanrot, G.; Mayero, M.; and Théry, L. J. Autom. Reasoning (JAR), 54(1):1-29, 2015.
Formally Verified Certificate Checkers for Hardest-to-Round Computation [link]Paper  bibtex   
@article{ dblp1620560,
  title = {Formally Verified Certificate Checkers for Hardest-to-Round Computation},
  author = {Érik Martin-Dorel and Guillaume Hanrot and Micaela Mayero and Laurent Théry},
  author_short = {Martin-Dorel, É. and Hanrot, G. and Mayero, M. and Théry, L.},
  bibtype = {article},
  type = {article},
  year = {2015},
  key = {dblp1620560},
  id = {dblp1620560},
  biburl = {http://www.dblp.org/rec/bibtex/journals/jar/Martin-DorelHMT15},
  url = {http://dx.doi.org/10.1007/s10817-014-9312-2},
  journal = {J. Autom. Reasoning (JAR)},
  pages = {1-29},
  number = {1},
  volume = {54},
  text = {J. Autom. Reasoning (JAR) 54(1):1-29 (2015)}
}
Downloads: 0