{"id":"https://openalex.org/W3122470220","doi":"https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_27","title":"Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning","display_name":"Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3122470220","doi":"https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_27","mag":"3122470220"},"language":"en","primary_location":{"id":"pmh:oai:repositum.tuwien.at:20.500.12708/15523","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.12708/15523","pdf_url":"http://hdl.handle.net/20.500.12708/15523","source":{"id":"https://openalex.org/S4306400494","display_name":"reposiTUm (TU Wien)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145847075","host_organization_name":"TU Wien","host_organization_lineage":["https://openalex.org/I145847075"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Inproceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/20.500.12708/15523","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012497111","display_name":"Vincent Liew","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Liew, Vincent","raw_affiliation_strings":["Allen School of Computer Science and Engineering, University of Washington, Seattle, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Allen School of Computer Science and Engineering, University of Washington, Seattle, WA, USA","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042076941","display_name":"Paul Beame","orcid":"https://orcid.org/0000-0002-2666-3545"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Beame, Paul","raw_affiliation_strings":["Allen School of Computer Science and Engineering, University of Washington, Seattle, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Allen School of Computer Science and Engineering, University of Washington, Seattle, WA, USA","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068637170","display_name":"Jo Devriendt","orcid":"https://orcid.org/0000-0002-6346-3665"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]},{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["DK","SE"],"is_corresponding":false,"raw_author_name":"Devriendt, Jo","raw_affiliation_strings":["Lund University & University of Copenhagen, Lund, Sweden,Department of Computer Science,Copenhagen,Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lund University & University of Copenhagen, Lund, Sweden,Department of Computer Science,Copenhagen,Denmark","institution_ids":["https://openalex.org/I124055696","https://openalex.org/I187531555"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066418690","display_name":"Jan Elffers","orcid":null},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]},{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK","SE"],"is_corresponding":false,"raw_author_name":"Elffers, Jan","raw_affiliation_strings":["Lund University & University of Copenhagen, Lund, Sweden,Department of Computer Science,Copenhagen,Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lund University & University of Copenhagen, Lund, Sweden,Department of Computer Science,Copenhagen,Denmark","institution_ids":["https://openalex.org/I124055696","https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003633660","display_name":"Jakob Nordstr\u0094\u00f6m","orcid":"https://orcid.org/0000-0002-2700-4285"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nordstr\u00f6m, Jakob","raw_affiliation_strings":["K\u00f8benhavns Universitet, Faculty of Science, Department of Computer Science, Algorithms and Programming Languages (APL), DK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"K\u00f8benhavns Universitet, Faculty of Science, Department of Computer Science, Algorithms and Programming Languages (APL), DK","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5012497111"],"corresponding_institution_ids":["https://openalex.org/I201448701"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9965000152587891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.8177533149719238},{"id":"https://openalex.org/keywords/bit","display_name":"Bit (key)","score":0.7859268188476562},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.6180141568183899},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5164732933044434},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.42680075764656067},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3653421401977539},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27285194396972656},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08479183912277222}],"concepts":[{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.8177533149719238},{"id":"https://openalex.org/C117011727","wikidata":"https://www.wikidata.org/wiki/Q1278488","display_name":"Bit (key)","level":2,"score":0.7859268188476562},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.6180141568183899},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5164732933044434},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.42680075764656067},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3653421401977539},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27285194396972656},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08479183912277222},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:repositum.tuwien.at:20.500.12708/15523","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.12708/15523","pdf_url":"http://hdl.handle.net/20.500.12708/15523","source":{"id":"https://openalex.org/S4306400494","display_name":"reposiTUm (TU Wien)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145847075","host_organization_name":"TU Wien","host_organization_lineage":["https://openalex.org/I145847075"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Inproceedings"},{"id":"pmh:oai:lup.lub.lu.se:e59a307b-5033-4079-b214-27bb8b76719e","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/e59a307b-5033-4079-b214-27bb8b76719e","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, FMCAD 2020; pp 194-204 (2020)","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/d08d12c1-8aad-4d9e-9cc1-52679e7c5673","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/d08d12c1-8aad-4d9e-9cc1-52679e7c5673","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Liew , V , Beame , P , Devriendt , J , Elffers , J & Nordstr\u00f6m , J 2020 , Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning . in Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design (FMCAD '20) . , 9283622, IEEE , pp. 194-204 , 20th International Conference on Formal Methods in Computer-Aided Design - FMCAD 2020; , Virtual , 21/09/2020 . https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_27","raw_type":"contributionToPeriodical"},{"id":"doi:10.34727/2020/isbn.978-3-85448-042-6_27","is_oa":true,"landing_page_url":"https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_27","pdf_url":null,"source":{"id":"https://openalex.org/S4306400493","display_name":"reposiTUm (TU Wien)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145847075","host_organization_name":"TU Wien","host_organization_lineage":["https://openalex.org/I145847075"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:repositum.tuwien.at:20.500.12708/15523","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.12708/15523","pdf_url":"http://hdl.handle.net/20.500.12708/15523","source":{"id":"https://openalex.org/S4306400494","display_name":"reposiTUm (TU Wien)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145847075","host_organization_name":"TU Wien","host_organization_lineage":["https://openalex.org/I145847075"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Inproceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5989772171","display_name":"SHF: Small: Efficient Verification of Nonlinear Arithmetic","funder_award_id":"1714593","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6336396887","display_name":null,"funder_award_id":"2016-00782","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"},{"id":"https://openalex.org/F4320322971","display_name":"Ume\u00e5 Universitet","ror":"https://ror.org/05kb8h459"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3122470220.pdf","grobid_xml":"https://content.openalex.org/works/W3122470220.grobid-xml"},"referenced_works_count":42,"referenced_works":["https://openalex.org/W5815757","https://openalex.org/W25685792","https://openalex.org/W1480909796","https://openalex.org/W1491554327","https://openalex.org/W1506635772","https://openalex.org/W1579437898","https://openalex.org/W1985602827","https://openalex.org/W2038193643","https://openalex.org/W2044560939","https://openalex.org/W2056382067","https://openalex.org/W2069767473","https://openalex.org/W2098022011","https://openalex.org/W2100738443","https://openalex.org/W2108637261","https://openalex.org/W2132489129","https://openalex.org/W2142127354","https://openalex.org/W2142785340","https://openalex.org/W2156269363","https://openalex.org/W2159595840","https://openalex.org/W2171790376","https://openalex.org/W2185680923","https://openalex.org/W2211407346","https://openalex.org/W2249179973","https://openalex.org/W2278821771","https://openalex.org/W2282171944","https://openalex.org/W2558223845","https://openalex.org/W2613484140","https://openalex.org/W2767589661","https://openalex.org/W2768948804","https://openalex.org/W2798446820","https://openalex.org/W2808706008","https://openalex.org/W2810460597","https://openalex.org/W2811247337","https://openalex.org/W2899780216","https://openalex.org/W2900531215","https://openalex.org/W2942139435","https://openalex.org/W2946097251","https://openalex.org/W2951182186","https://openalex.org/W2965484150","https://openalex.org/W3043296681","https://openalex.org/W3047833035","https://openalex.org/W3172321254"],"related_works":["https://openalex.org/W4327546585","https://openalex.org/W2051487156","https://openalex.org/W2411923897","https://openalex.org/W4394546135","https://openalex.org/W2057797376","https://openalex.org/W2090319426","https://openalex.org/W2036954759","https://openalex.org/W2506252583","https://openalex.org/W4406620725","https://openalex.org/W2048249848"],"abstract_inverted_index":{"Systems":[0],"mixing":[1],"Boolean":[2,27],"logic":[3],"and":[4,86,196,219],"arithmetic":[5],"have":[6,42,74],"been":[7,44],"a":[8,104],"long-standing":[9],"challenge":[10],"for":[11,26,103,126,132,216,224],"verification":[12],"tools":[13],"such":[14],"as":[15,174,176],"SAT-based":[16],"bit-vector":[17,179,211,218],"solvers.":[18,226],"Though":[19],"SAT":[20,85,127,220],"solvers":[21,68,164,221],"can":[22,142,165],"be":[23],"highly":[24],"efficient":[25],"reasoning,":[28],"they":[29],"scale":[30],"poorly":[31],"once":[32],"multiplication":[33],"is":[34,118],"involved.":[35],"Algebraic":[36],"methods":[37,154],"using":[38],"Gr\u00f6bner":[39,157],"basis":[40],"reduction":[41],"recently":[43],"used":[45],"to":[46,77,184],"efficiently":[47],"verify":[48,166,198],"multiplier":[49,114,172],"circuits":[50],"in":[51,129,149,181],"isolation,":[52],"but":[53,222],"generally":[54],"do":[55],"not":[56],"perform":[57],"well":[58,112,175],"on":[59,156],"problems":[60],"involving":[61],"bit-level":[62,108,144],"reasoning.":[63],"We":[64,135,189],"propose":[65],"that":[66,96,138,162,213],"pseudo-Boolean":[67,163,225],"equipped":[69],"with":[70],"cutting":[71,100,139],"planes":[72,101,140],"reasoning":[73,141],"the":[75,79,83,122,167,185,202],"potential":[76],"combine":[78],"complementary":[80],"strengths":[81],"of":[82,107,110,146,170,178,208],"existing":[84],"algebraic":[87,133,187],"approaches":[88,195],"while":[89],"avoiding":[90],"their":[91],"weaknesses.":[92],"Theoretically,":[93],"we":[94,160,205],"show":[95,137],"there":[97],"are":[98,214],"optimal-length":[99],"proofs":[102,124],"large":[105],"class":[106],"properties":[109,200],"some":[111,130],"known":[113,125],"circuits.":[115],"This":[116],"scaling":[117],"significantly":[119],"better":[120],"than":[121,153,193],"smallest":[123],"and,":[128],"instances,":[131],"methods.":[134,188],"also":[136,197],"extract":[143],"consequences":[145],"word-level":[147,168],"equations":[148],"exponentially":[150],"fewer":[151],"steps":[152],"based":[155],"bases.":[158],"Experimentally,":[159],"demonstrate":[161],"equivalence":[169],"adder-based":[171],"architectures,":[173],"commutativity":[177],"multiplication,":[180],"times":[182],"comparable":[183],"best":[186],"then":[190],"go":[191],"further":[192],"previous":[194],"these":[199],"at":[201],"bit-level.":[203],"Finally,":[204],"find":[206],"examples":[207],"simple":[209],"nonlinear":[210],"inequalities":[212],"intractable":[215],"current":[217],"easy":[223],"\u00a9":[227],"2020":[228],"FMCAD":[229],"Association.":[230]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-05-03T08:25:01.440150","created_date":"2025-10-10T00:00:00"}