{"id":"https://openalex.org/W2122919970","doi":"https://doi.org/10.1145/1687399.1687403","title":"A scalable decision procedure for fixed-width bit-vectors","display_name":"A scalable decision procedure for fixed-width bit-vectors","publication_year":2009,"publication_date":"2009-11-02","ids":{"openalex":"https://openalex.org/W2122919970","doi":"https://doi.org/10.1145/1687399.1687403","mag":"2122919970"},"language":"en","primary_location":{"id":"doi:10.1145/1687399.1687403","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1687399.1687403","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 International Conference on Computer-Aided Design","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/A5032057278","display_name":"Roberto Bruttomesso","orcid":null},"institutions":[{"id":"https://openalex.org/I57201433","display_name":"Universit\u00e0 della Svizzera italiana","ror":"https://ror.org/03c4atk17","country_code":"CH","type":"education","lineage":["https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Roberto Bruttomesso","raw_affiliation_strings":["Universit\u00e0 della Svizzera Italiana, Lugano, Switzerland","Universita della Svizzera Italiana, Lugano, Switzerland#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 della Svizzera Italiana, Lugano, Switzerland","institution_ids":["https://openalex.org/I57201433"]},{"raw_affiliation_string":"Universita della Svizzera Italiana, Lugano, Switzerland#TAB#","institution_ids":["https://openalex.org/I57201433"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075152083","display_name":"Natasha Sharygina","orcid":"https://orcid.org/0000-0002-8872-4913"},"institutions":[{"id":"https://openalex.org/I57201433","display_name":"Universit\u00e0 della Svizzera italiana","ror":"https://ror.org/03c4atk17","country_code":"CH","type":"education","lineage":["https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Natasha Sharygina","raw_affiliation_strings":["Universit\u00e0 della Svizzera Italiana, Lugano, Switzerland","Universita della Svizzera Italiana, Lugano, Switzerland#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 della Svizzera Italiana, Lugano, Switzerland","institution_ids":["https://openalex.org/I57201433"]},{"raw_affiliation_string":"Universita della Svizzera Italiana, Lugano, Switzerland#TAB#","institution_ids":["https://openalex.org/I57201433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I57201433"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"13","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9988999962806702,"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/T10126","display_name":"Logic, programming, and type systems","score":0.998199999332428,"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.9951000213623047,"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/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.7335783839225769},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6856991648674011},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.667301595211029},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5486012101173401},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4720897376537323},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4704515039920807},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4594690501689911},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26033711433410645},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.17529886960983276}],"concepts":[{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.7335783839225769},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6856991648674011},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.667301595211029},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5486012101173401},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4720897376537323},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4704515039920807},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4594690501689911},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26033711433410645},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.17529886960983276},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1687399.1687403","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1687399.1687403","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 International Conference on Computer-Aided Design","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.175.9922","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.175.9922","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.verify.inf.unisi.ch/files/iccad09.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7799999713897705,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W130862334","https://openalex.org/W169672073","https://openalex.org/W1480909796","https://openalex.org/W1498875780","https://openalex.org/W1505872263","https://openalex.org/W1592502301","https://openalex.org/W1873964603","https://openalex.org/W1926206757","https://openalex.org/W1986022261","https://openalex.org/W1988401041","https://openalex.org/W2036085256","https://openalex.org/W2055477538","https://openalex.org/W2097414162","https://openalex.org/W2129487583","https://openalex.org/W2155180508","https://openalex.org/W2188128899","https://openalex.org/W2799255943","https://openalex.org/W6605311061","https://openalex.org/W6606921157","https://openalex.org/W6679245075"],"related_works":["https://openalex.org/W2117548279","https://openalex.org/W2097470475","https://openalex.org/W2070252991","https://openalex.org/W2807449856","https://openalex.org/W2941201715","https://openalex.org/W2025727968","https://openalex.org/W238211858","https://openalex.org/W4297742300","https://openalex.org/W2810367355","https://openalex.org/W2131919998"],"abstract_inverted_index":{"Efficient":[0],"decision":[1,16],"procedures":[2],"for":[3,7,18,74],"bit-vectors":[4,23],"are":[5,43],"essential":[6],"modern":[8],"verification":[9],"frameworks.":[10],"This":[11],"paper":[12],"describes":[13],"a":[14,26,36,72,75,101],"new":[15],"procedure":[17,32,60],"the":[19,50,92,107],"core":[20,93],"theory":[21,102],"of":[22],"that":[24,81,96],"exploits":[25],"reduction":[27],"to":[28,47,89],"equality":[29],"reasoning.":[30],"The":[31,58],"is":[33,61,84],"embedded":[34],"in":[35,45],"congruence":[37],"closure":[38],"algorithm,":[39],"whose":[40],"data":[41],"structures":[42],"extended":[44],"order":[46],"efficiently":[48],"manage":[49],"relations":[51],"between":[52],"bit-vector":[53,109],"slicings,":[54],"modulo":[55],"equivalence":[56],"classes.":[57],"resulting":[59],"incremental,":[62],"backtrackable,":[63],"and":[64,86,95],"proof":[65],"producing:":[66],"it":[67,97],"can":[68],"be":[69],"used":[70],"as":[71,100],"theory-solver":[73],"lazy":[76],"SMT":[77],"schema.":[78],"Experiments":[79],"show":[80],"our":[82],"approach":[83],"comparable":[85],"often":[87],"superior":[88],"bit-blasting":[90],"on":[91],"fragment,":[94],"also":[98],"helps":[99],"layer":[103],"when":[104],"applied":[105],"over":[106],"full":[108],"theory.":[110]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}