{"id":"https://openalex.org/W1480909796","doi":"https://doi.org/10.1007/978-3-540-78800-3_24","title":"Z3: An Efficient SMT Solver","display_name":"Z3: An Efficient SMT Solver","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1480909796","doi":"https://doi.org/10.1007/978-3-540-78800-3_24","mag":"1480909796"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-78800-3_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-78800-3_24","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045859619","display_name":"Leonardo de Moura","orcid":"https://orcid.org/0000-0002-5158-4726"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Leonardo de Moura","raw_affiliation_strings":["Microsoft Research, One Microsoft Way, Redmond, WA, 98074, USA","Microsoft Research, Redmond, WA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, One Microsoft Way, Redmond, WA, 98074, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Research, Redmond, WA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091080723","display_name":"Nikolaj Bj\u00f8rner","orcid":"https://orcid.org/0000-0002-1695-2810"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nikolaj Bj\u00f8rner","raw_affiliation_strings":["Microsoft Research, One Microsoft Way, Redmond, WA, 98074, USA","Microsoft Research, Redmond, WA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, One Microsoft Way, Redmond, WA, 98074, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Research, Redmond, WA","institution_ids":["https://openalex.org/I1290206253"]}]}],"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":120.5423,"has_fulltext":false,"cited_by_count":6296,"citation_normalized_percentile":{"value":0.99991787,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"337","last_page":"340"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/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/T11424","display_name":"Security and Verification in Computing","score":0.9983999729156494,"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.9612444043159485},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8616326451301575},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7104715704917908},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6186368465423584},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6121704578399658},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.6115915179252625},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.4808124303817749},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4802270531654358},{"id":"https://openalex.org/keywords/symbolic-execution","display_name":"Symbolic execution","score":0.4709765911102295},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.43112218379974365},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.39663198590278625},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36720073223114014},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.33440303802490234},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.14397373795509338},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1262146532535553}],"concepts":[{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.9612444043159485},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8616326451301575},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7104715704917908},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6186368465423584},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6121704578399658},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.6115915179252625},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.4808124303817749},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4802270531654358},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.4709765911102295},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.43112218379974365},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.39663198590278625},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36720073223114014},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33440303802490234},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.14397373795509338},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1262146532535553}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-78800-3_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-78800-3_24","pdf_url":null,"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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7200000286102295,"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":17,"referenced_works":["https://openalex.org/W26772505","https://openalex.org/W1552077729","https://openalex.org/W1959256509","https://openalex.org/W1979619055","https://openalex.org/W2055477538","https://openalex.org/W2082000355","https://openalex.org/W2107794009","https://openalex.org/W2110780548","https://openalex.org/W2121707639","https://openalex.org/W2125967324","https://openalex.org/W2143331802","https://openalex.org/W2157499124","https://openalex.org/W2165100126","https://openalex.org/W2494986075","https://openalex.org/W2999818597","https://openalex.org/W3098346725","https://openalex.org/W4254762831"],"related_works":["https://openalex.org/W2287565210","https://openalex.org/W2184716478","https://openalex.org/W2599631825","https://openalex.org/W2143744897","https://openalex.org/W3176904788","https://openalex.org/W2399578172","https://openalex.org/W2578463151","https://openalex.org/W21597398","https://openalex.org/W4210813503","https://openalex.org/W3083162932"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":138},{"year":2025,"cited_by_count":477},{"year":2024,"cited_by_count":458},{"year":2023,"cited_by_count":426},{"year":2022,"cited_by_count":399},{"year":2021,"cited_by_count":569},{"year":2020,"cited_by_count":522},{"year":2019,"cited_by_count":459},{"year":2018,"cited_by_count":390},{"year":2017,"cited_by_count":409},{"year":2016,"cited_by_count":359},{"year":2015,"cited_by_count":375},{"year":2014,"cited_by_count":358},{"year":2013,"cited_by_count":310},{"year":2012,"cited_by_count":212}],"updated_date":"2026-06-14T07:44:22.658603","created_date":"2025-10-10T00:00:00"}