{"id":"https://openalex.org/W1579437898","doi":"https://doi.org/10.1007/978-3-642-00768-2_16","title":"Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays","display_name":"Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1579437898","doi":"https://doi.org/10.1007/978-3-642-00768-2_16","mag":"1579437898"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-00768-2_16","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-642-00768-2_16","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-642-00768-2_16.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":null,"license_id":null,"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":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-642-00768-2_16.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054608101","display_name":"Robert Brummayer","orcid":null},"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":"Robert Brummayer","raw_affiliation_strings":["Institute for Formal Models and Verification, Johannes Kepler University Linz, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Formal Models and Verification, Johannes Kepler University Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082596567","display_name":"Armin Biere","orcid":"https://orcid.org/0000-0001-7170-9242"},"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":"Armin Biere","raw_affiliation_strings":["Institute for Formal Models and Verification, Johannes Kepler University Linz, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Formal Models and Verification, Johannes Kepler University Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":27.7185,"has_fulltext":true,"cited_by_count":362,"citation_normalized_percentile":{"value":0.99793942,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"174","last_page":"177"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"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":1.0,"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.9998999834060669,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9551662802696228},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7636922597885132},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.7062163352966309},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6878884434700012},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6324302554130554},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.5977035164833069},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5541238784790039},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46255484223365784},{"id":"https://openalex.org/keywords/bit-array","display_name":"Bit array","score":0.4558786451816559},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4275444746017456},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.35600072145462036},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.34918415546417236},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3463795781135559},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.20889747142791748},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19815778732299805},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.11971250176429749}],"concepts":[{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.9551662802696228},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7636922597885132},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.7062163352966309},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6878884434700012},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6324302554130554},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.5977035164833069},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5541238784790039},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46255484223365784},{"id":"https://openalex.org/C150807984","wikidata":"https://www.wikidata.org/wiki/Q1992074","display_name":"Bit array","level":3,"score":0.4558786451816559},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4275444746017456},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.35600072145462036},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.34918415546417236},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3463795781135559},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.20889747142791748},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19815778732299805},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.11971250176429749},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-00768-2_16","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-642-00768-2_16","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-642-00768-2_16.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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.365.520","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.365.520","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://fmv.jku.at/papers/BrummayerBiere-TACAS09.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1007/978-3-642-00768-2_16","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-642-00768-2_16","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-642-00768-2_16.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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.47999998927116394,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1579437898.pdf","grobid_xml":"https://content.openalex.org/works/W1579437898.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W169672073","https://openalex.org/W1480909796","https://openalex.org/W1549880792","https://openalex.org/W1556566737","https://openalex.org/W1577525693","https://openalex.org/W1596865963","https://openalex.org/W2013845106","https://openalex.org/W2130178878","https://openalex.org/W2158602337","https://openalex.org/W2281785532","https://openalex.org/W2506987745","https://openalex.org/W4231708524"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W2578463151","https://openalex.org/W21597398","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W1913543287","https://openalex.org/W2014111643","https://openalex.org/W1505872263","https://openalex.org/W2963523951"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":13},{"year":2021,"cited_by_count":27},{"year":2020,"cited_by_count":24},{"year":2019,"cited_by_count":18},{"year":2018,"cited_by_count":18},{"year":2017,"cited_by_count":29},{"year":2016,"cited_by_count":31},{"year":2015,"cited_by_count":29},{"year":2014,"cited_by_count":23},{"year":2013,"cited_by_count":33},{"year":2012,"cited_by_count":21}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}