{"id":"https://openalex.org/W3025960451","doi":"https://doi.org/10.1145/3373207.3404029","title":"WhyMP, a formally verified arbitrary-precision integer library","display_name":"WhyMP, a formally verified arbitrary-precision integer library","publication_year":2020,"publication_date":"2020-07-20","ids":{"openalex":"https://openalex.org/W3025960451","doi":"https://doi.org/10.1145/3373207.3404029","mag":"3025960451"},"language":"en","primary_location":{"id":"doi:10.1145/3373207.3404029","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3373207.3404029","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.inria.fr/hal-02566654","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073473823","display_name":"Guillaume Melquiond","orcid":"https://orcid.org/0000-0002-6697-1809"},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4210119692","display_name":"Numerical Method (China)","ror":"https://ror.org/02ns8zp42","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210119692"]}],"countries":["CN","FR"],"is_corresponding":true,"raw_author_name":"Guillaume Melquiond","raw_affiliation_strings":["Universit\u00e9 Paris-Saclay, Orsay, France","Formally Verified Programs,   Certified Tools and Numerical Computations"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris-Saclay, Orsay, France","institution_ids":["https://openalex.org/I277688954"]},{"raw_affiliation_string":"Formally Verified Programs,   Certified Tools and Numerical Computations","institution_ids":["https://openalex.org/I4210119692"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080520502","display_name":"Rapha\u00ebl Rieu-Helft","orcid":null},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4210119692","display_name":"Numerical Method (China)","ror":"https://ror.org/02ns8zp42","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210119692"]}],"countries":["CN","FR"],"is_corresponding":false,"raw_author_name":"Rapha\u00ebl Rieu-Helft","raw_affiliation_strings":["Universit\u00e9 Paris-Saclay, Orsay, France","Formally Verified Programs,   Certified Tools and Numerical Computations","TrustInSoft"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris-Saclay, Orsay, France","institution_ids":["https://openalex.org/I277688954"]},{"raw_affiliation_string":"Formally Verified Programs,   Certified Tools and Numerical Computations","institution_ids":["https://openalex.org/I4210119692"]},{"raw_affiliation_string":"TrustInSoft","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073473823"],"corresponding_institution_ids":["https://openalex.org/I277688954","https://openalex.org/I4210119692"],"apc_list":null,"apc_paid":null,"fwci":0.1353,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.53928693,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"352","last_page":"359"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.8488961458206177},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7345858812332153},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6421257257461548},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6388262510299683},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.6088154911994934},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.5556897521018982},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5390365123748779},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5369709730148315},{"id":"https://openalex.org/keywords/functional-verification","display_name":"Functional verification","score":0.4874911308288574},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4543347954750061},{"id":"https://openalex.org/keywords/interface","display_name":"Interface (matter)","score":0.42249277234077454},{"id":"https://openalex.org/keywords/formal-methods","display_name":"Formal methods","score":0.4174291789531708},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38495099544525146},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16575932502746582},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.14174160361289978}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8488961458206177},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7345858812332153},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6421257257461548},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6388262510299683},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.6088154911994934},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.5556897521018982},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5390365123748779},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5369709730148315},{"id":"https://openalex.org/C62460635","wikidata":"https://www.wikidata.org/wiki/Q5508853","display_name":"Functional verification","level":3,"score":0.4874911308288574},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4543347954750061},{"id":"https://openalex.org/C113843644","wikidata":"https://www.wikidata.org/wiki/Q901882","display_name":"Interface (matter)","level":4,"score":0.42249277234077454},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.4174291789531708},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38495099544525146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16575932502746582},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.14174160361289978},{"id":"https://openalex.org/C129307140","wikidata":"https://www.wikidata.org/wiki/Q6795880","display_name":"Maximum bubble pressure method","level":3,"score":0.0},{"id":"https://openalex.org/C157915830","wikidata":"https://www.wikidata.org/wiki/Q2928001","display_name":"Bubble","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3373207.3404029","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3373207.3404029","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-02566654v1","is_oa":true,"landing_page_url":"https://hal.inria.fr/hal-02566654","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://hal.inria.fr/hal-02566654","raw_type":"info:eu-repo/semantics/preprint"},{"id":"pmh:oai:HAL:hal-02566654v2","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-02566654","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://issac-conference.org/2020/","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-02566654v1","is_oa":true,"landing_page_url":"https://hal.inria.fr/hal-02566654","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://hal.inria.fr/hal-02566654","raw_type":"info:eu-repo/semantics/preprint"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.4000000059604645,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W177306140","https://openalex.org/W1541694476","https://openalex.org/W1571196178","https://openalex.org/W1820726602","https://openalex.org/W1877110379","https://openalex.org/W1981390603","https://openalex.org/W2069300761","https://openalex.org/W2123470495","https://openalex.org/W2168662780","https://openalex.org/W2286229943","https://openalex.org/W2318327664","https://openalex.org/W2616938354","https://openalex.org/W2773698228","https://openalex.org/W2786891599","https://openalex.org/W2981684918","https://openalex.org/W3006239185"],"related_works":["https://openalex.org/W3100311625","https://openalex.org/W2105593427","https://openalex.org/W3120172095","https://openalex.org/W2118572231","https://openalex.org/W2106507440","https://openalex.org/W3209085687","https://openalex.org/W2108860137","https://openalex.org/W2125238773","https://openalex.org/W1606979385","https://openalex.org/W2118549635"],"abstract_inverted_index":{"Arbitrary-precision":[0],"integer":[1],"libraries":[2],"such":[3],"as":[4,99,104],"GMP":[5,15,100],"are":[6,20],"a":[7,32,66,82],"critical":[8],"building":[9],"block":[10],"of":[11,68,85],"computer":[12],"algebra":[13],"systems.":[14],"provides":[16,95],"state-of-the-art":[17],"algorithms":[18,116],"that":[19,35],"intricate":[21],"enough":[22],"to":[23,124],"justify":[24],"formal":[25],"verification.":[26],"In":[27],"this":[28],"paper,":[29],"we":[30,117],"present":[31],"C":[33],"library":[34,94,127],"has":[36,62],"been":[37,63],"formally":[38],"verified":[39,81],"using":[40,65],"the":[41,96,115],"Why3":[42],"verification":[43,50,112],"platform":[44],"in":[45],"about":[46],"four":[47],"person-years.":[48],"This":[49],"deals":[51],"not":[52],"only":[53],"with":[54,57,128],"safety,":[55],"but":[56],"full":[58],"functional":[59],"correctness.":[60],"It":[61],"performed":[64],"mixture":[67],"mechanically":[69],"checked":[70],"handwritten":[71],"proofs":[72],"and":[73,80,91,101,114,120],"automated":[74],"theorem":[75],"proving.":[76],"We":[77,109],"have":[78,118],"implemented":[79],"nontrivial":[83],"subset":[84],"GMP's":[86],"algorithms,":[87],"including":[88],"their":[89],"optimizations":[90],"intricacies.":[92],"Our":[93],"same":[97],"interface":[98],"is":[102],"almost":[103],"efficient":[105],"for":[106],"smaller":[107],"inputs.":[108],"detail":[110],"our":[111,126],"methodology":[113],"implemented,":[119],"include":[121],"some":[122],"benchmarks":[123],"compare":[125],"GMP.":[129]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}