{"id":"https://openalex.org/W4293261720","doi":"https://doi.org/10.1145/3489517.3530605","title":"Formal verification of modular multipliers using symbolic computer algebra and boolean satisfiability","display_name":"Formal verification of modular multipliers using symbolic computer algebra and boolean satisfiability","publication_year":2022,"publication_date":"2022-07-10","ids":{"openalex":"https://openalex.org/W4293261720","doi":"https://doi.org/10.1145/3489517.3530605"},"language":"en","primary_location":{"id":"doi:10.1145/3489517.3530605","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3489517.3530605","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 59th ACM/IEEE Design Automation Conference","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061877015","display_name":"Alireza Mahzoon","orcid":"https://orcid.org/0000-0001-9342-1098"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alireza Mahzoon","raw_affiliation_strings":["University of Bremen, Bremen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bremen, Bremen, Germany","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086566894","display_name":"Daniel Gro\u00dfe","orcid":"https://orcid.org/0000-0002-1490-6175"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Daniel Gro\u00dfe","raw_affiliation_strings":["Johannes Kepler University Linz, Linz, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Johannes Kepler University Linz, Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002292119","display_name":"Christoph Scholl","orcid":"https://orcid.org/0000-0003-0488-7676"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christoph Scholl","raw_affiliation_strings":["University of Freiburg, Freiburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Freiburg, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057999267","display_name":"Alexander Konrad","orcid":null},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alexander Konrad","raw_affiliation_strings":["University of Freiburg, Freiburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Freiburg, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071742136","display_name":"Rolf Drechsler","orcid":"https://orcid.org/0000-0002-9872-1740"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rolf Drechsler","raw_affiliation_strings":["University of Bremen/DFKI, Bremen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bremen/DFKI, Bremen, Germany","institution_ids":["https://openalex.org/I180437899"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5124,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.91198592,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1183","last_page":"1188"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.9993000030517578,"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/T11424","display_name":"Security and Verification in Computing","score":0.9943000078201294,"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.7657802104949951},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6794657707214355},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.6696929335594177},{"id":"https://openalex.org/keywords/residue-number-system","display_name":"Residue number system","score":0.5892141461372375},{"id":"https://openalex.org/keywords/modular-arithmetic","display_name":"Modular arithmetic","score":0.5644117593765259},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.5583867430686951},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5322216749191284},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4950041174888611},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.45103439688682556},{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.43840572237968445},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.42279136180877686},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4165915250778198},{"id":"https://openalex.org/keywords/symbolic-computation","display_name":"Symbolic computation","score":0.4107341170310974},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.39799782633781433},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25517815351486206},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22657501697540283}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7657802104949951},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6794657707214355},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.6696929335594177},{"id":"https://openalex.org/C71480937","wikidata":"https://www.wikidata.org/wiki/Q3086516","display_name":"Residue number system","level":2,"score":0.5892141461372375},{"id":"https://openalex.org/C32049820","wikidata":"https://www.wikidata.org/wiki/Q319400","display_name":"Modular arithmetic","level":3,"score":0.5644117593765259},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.5583867430686951},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5322216749191284},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4950041174888611},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.45103439688682556},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.43840572237968445},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.42279136180877686},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4165915250778198},{"id":"https://openalex.org/C110812573","wikidata":"https://www.wikidata.org/wiki/Q175515","display_name":"Symbolic computation","level":2,"score":0.4107341170310974},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.39799782633781433},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25517815351486206},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22657501697540283},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3489517.3530605","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3489517.3530605","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 59th ACM/IEEE Design Automation Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4349118181","display_name":null,"funder_award_id":"GR 3104/6-1, DR 297/37-1, SCHO 894/5-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1584008964","https://openalex.org/W2024821731","https://openalex.org/W2107355598","https://openalex.org/W2768948804","https://openalex.org/W2899780216","https://openalex.org/W2946097251","https://openalex.org/W2983688775","https://openalex.org/W3036041789","https://openalex.org/W3092596670","https://openalex.org/W3186608118","https://openalex.org/W4210830821","https://openalex.org/W6746225894","https://openalex.org/W6753550116"],"related_works":["https://openalex.org/W1968471781","https://openalex.org/W4210257969","https://openalex.org/W4231750581","https://openalex.org/W2188755491","https://openalex.org/W2370295989","https://openalex.org/W2120925552","https://openalex.org/W2155162307","https://openalex.org/W4299734787","https://openalex.org/W1499470128","https://openalex.org/W4293261720"],"abstract_inverted_index":{"Modular":[0],"multipliers":[1,23],"are":[2],"the":[3,49,62],"essential":[4],"components":[5],"in":[6],"cryptography":[7],"and":[8,18,33],"Residue":[9],"Number":[10],"System":[11],"(RNS)":[12],"designs.":[13],"Especially,":[14],"2n":[15,19],"-":[16],"1":[17,21],"+":[20],"modular":[22],"have":[24],"gained":[25],"more":[26],"attention":[27],"due":[28],"to":[29,47],"their":[30],"regular":[31],"structures":[32],"a":[34,55],"wide":[35],"variety":[36],"of":[37,51],"applications.":[38],"However,":[39],"there":[40],"is":[41],"no":[42],"automated":[43],"formal":[44],"verification":[45],"method":[46],"prove":[48],"correctness":[50],"these":[52],"multipliers.":[53],"As":[54],"result,":[56],"bugs":[57],"might":[58],"remain":[59],"undetected":[60],"after":[61],"design":[63],"phase.":[64]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}