{"id":"https://openalex.org/W2959756750","doi":"https://doi.org/10.1007/978-3-030-25543-5_4","title":"Q3B: An Efficient BDD-based SMT Solver for Quantified Bit-Vectors","display_name":"Q3B: An Efficient BDD-based SMT Solver for Quantified Bit-Vectors","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2959756750","doi":"https://doi.org/10.1007/978-3-030-25543-5_4","mag":"2959756750"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-25543-5_4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-25543-5_4","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-030-25543-5_4.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-030-25543-5_4.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040602865","display_name":"Martin Jon\u00e1\u0161","orcid":"https://orcid.org/0000-0003-4703-0795"},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Martin Jon\u00e1\u0161","raw_affiliation_strings":["Masaryk University, Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Masaryk University, Brno, Czech Republic","institution_ids":["https://openalex.org/I21449261"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057885659","display_name":"Jan Strej\u010dek","orcid":"https://orcid.org/0000-0001-5873-403X"},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jan Strej\u010dek","raw_affiliation_strings":["Masaryk University, Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Masaryk University, Brno, Czech Republic","institution_ids":["https://openalex.org/I21449261"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040602865"],"corresponding_institution_ids":["https://openalex.org/I21449261"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":1.9561,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.86215865,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"64","last_page":"73"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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.9987999796867371,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9965999722480774,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7888164520263672},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.7265957593917847},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6655706167221069},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6560548543930054},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.6273378133773804},{"id":"https://openalex.org/keywords/bit-array","display_name":"Bit array","score":0.6052963137626648},{"id":"https://openalex.org/keywords/translation","display_name":"Translation (biology)","score":0.5762034058570862},{"id":"https://openalex.org/keywords/bit","display_name":"Bit (key)","score":0.5539916753768921},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4870777428150177},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4773552417755127},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45729008316993713},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4317697286605835},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4144088327884674},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2709055542945862},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16225191950798035}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7888164520263672},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.7265957593917847},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6655706167221069},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6560548543930054},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.6273378133773804},{"id":"https://openalex.org/C150807984","wikidata":"https://www.wikidata.org/wiki/Q1992074","display_name":"Bit array","level":3,"score":0.6052963137626648},{"id":"https://openalex.org/C149364088","wikidata":"https://www.wikidata.org/wiki/Q185917","display_name":"Translation (biology)","level":4,"score":0.5762034058570862},{"id":"https://openalex.org/C117011727","wikidata":"https://www.wikidata.org/wiki/Q1278488","display_name":"Bit (key)","level":2,"score":0.5539916753768921},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4870777428150177},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4773552417755127},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45729008316993713},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4317697286605835},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4144088327884674},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2709055542945862},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16225191950798035},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C105580179","wikidata":"https://www.wikidata.org/wiki/Q188928","display_name":"Messenger RNA","level":3,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"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":1,"locations":[{"id":"doi:10.1007/978-3-030-25543-5_4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-25543-5_4","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-030-25543-5_4.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.1007/978-3-030-25543-5_4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-25543-5_4","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-030-25543-5_4.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5913323370","display_name":null,"funder_award_id":"GA18-","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"},{"id":"https://openalex.org/G7030914363","display_name":null,"funder_award_id":"18-02177S","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"},{"id":"https://openalex.org/G7730884724","display_name":"Abstraction and Other Techniques in Semi-Symbolic Program Verification","funder_award_id":"GA18-02177S","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"}],"funders":[{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2959756750.pdf","grobid_xml":"https://content.openalex.org/works/W2959756750.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W221832247","https://openalex.org/W1128447031","https://openalex.org/W1480909796","https://openalex.org/W1877129949","https://openalex.org/W2071969326","https://openalex.org/W2101432564","https://openalex.org/W2105829631","https://openalex.org/W2108016168","https://openalex.org/W2129487583","https://openalex.org/W2159595840","https://openalex.org/W2218365969","https://openalex.org/W2232378406","https://openalex.org/W2468888700","https://openalex.org/W2474427045","https://openalex.org/W2600774173","https://openalex.org/W2742322653","https://openalex.org/W2884110986","https://openalex.org/W2897273493","https://openalex.org/W2963310240","https://openalex.org/W3137139687","https://openalex.org/W4246691913"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W2578463151","https://openalex.org/W21597398","https://openalex.org/W1945774704","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W51097961","https://openalex.org/W1505872263","https://openalex.org/W2963523951"],"abstract_inverted_index":{"We":[0],"present":[1],"the":[2,39,64,70],"first":[3],"stable":[4],"release":[5],"of":[6,13,29,38,57,69],"our":[7],"tool":[8,42],"Q3B":[9,24],"for":[10,21],"deciding":[11],"satisfiability":[12],"quantified":[14],"bit-vector":[15,58],"formulas.":[16],"Unlike":[17],"other":[18],"state-of-the-art":[19],"solvers":[20],"this":[22],"problem,":[23],"is":[25],"based":[26],"on":[27,63],"translation":[28],"a":[30,33,74],"formula":[31,46],"to":[32],"bdd":[34],"that":[35],"represents":[36],"models":[37],"formula.":[40],"The":[41,60],"also":[43],"employs":[44],"advanced":[45],"simplifications":[47],"and":[48,54,66,72],"approximations":[49],"by":[50,55],"effective":[51],"bit-width":[52],"reduction":[53],"abstraction":[56],"operations.":[59],"paper":[61],"focuses":[62],"architecture":[65],"implementation":[67],"aspects":[68],"tool,":[71],"provides":[73],"brief":[75],"experimental":[76],"comparison":[77],"with":[78],"its":[79],"competitors.":[80]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}