{"id":"https://openalex.org/W4400973198","doi":"https://doi.org/10.1007/978-3-031-65627-9_1","title":"Split Gr\u00f6bner Bases for\u00a0Satisfiability Modulo Finite Fields","display_name":"Split Gr\u00f6bner Bases for\u00a0Satisfiability Modulo Finite Fields","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4400973198","doi":"https://doi.org/10.1007/978-3-031-65627-9_1"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-65627-9_1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-65627-9_1","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-65627-9_1.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":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-65627-9_1.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062208593","display_name":"Alex Ozdemir","orcid":"https://orcid.org/0000-0002-0181-6752"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alex Ozdemir","raw_affiliation_strings":["Stanford University, Stanford, USA","Veridise, Stanford, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Veridise, Stanford, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007146828","display_name":"Shankara Pailoor","orcid":"https://orcid.org/0000-0002-9253-9585"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shankara Pailoor","raw_affiliation_strings":["Veridise, Stanford, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Veridise, Stanford, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004566417","display_name":"Alp Bassa","orcid":"https://orcid.org/0000-0002-9685-7361"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alp Bassa","raw_affiliation_strings":["Veridise, Stanford, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Veridise, Stanford, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022616286","display_name":"Kostas Ferles","orcid":"https://orcid.org/0000-0002-8370-5465"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kostas Ferles","raw_affiliation_strings":["Veridise, Stanford, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Veridise, Stanford, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026961968","display_name":"Clark Barrett","orcid":"https://orcid.org/0000-0002-9522-3084"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Clark Barrett","raw_affiliation_strings":["Stanford University, Stanford, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006424908","display_name":"I\u015f\u0131l Dillig","orcid":"https://orcid.org/0000-0001-8006-1230"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"I\u015fil Dillig","raw_affiliation_strings":["Veridise, Stanford, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Veridise, Stanford, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062208593"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"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":"3","last_page":"25"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10951","display_name":"Cryptographic Implementations and Security","score":0.9993000030517578,"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.9993000030517578,"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.9970999956130981,"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.991599977016449,"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.808495044708252},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7807865142822266},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7742598056793213},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.7289352416992188},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.69838547706604},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.643987238407135},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.572729766368866},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5162789225578308},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.480133980512619},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4697057902812958},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.45696231722831726},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.24205759167671204},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.19148162007331848},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17874187231063843}],"concepts":[{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.808495044708252},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7807865142822266},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7742598056793213},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.7289352416992188},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.69838547706604},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.643987238407135},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.572729766368866},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5162789225578308},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.480133980512619},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4697057902812958},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.45696231722831726},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.24205759167671204},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.19148162007331848},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17874187231063843},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-031-65627-9_1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-65627-9_1","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-65627-9_1.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-031-65627-9_1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-65627-9_1","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-65627-9_1.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/G6956655739","display_name":"NSF-BSF: SHF: Small: Efficient, Automatic, and Trustworthy Smart Contract Verification","funder_award_id":"2110397","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4400973198.pdf"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W25515096","https://openalex.org/W96426063","https://openalex.org/W1128447031","https://openalex.org/W1481397690","https://openalex.org/W1586300459","https://openalex.org/W1595357546","https://openalex.org/W1768814311","https://openalex.org/W2013504313","https://openalex.org/W2018615018","https://openalex.org/W2022846948","https://openalex.org/W2496543269","https://openalex.org/W2507651339","https://openalex.org/W2521776546","https://openalex.org/W2883748642","https://openalex.org/W2888726077","https://openalex.org/W2895807258","https://openalex.org/W2904295142","https://openalex.org/W2948043589","https://openalex.org/W2980759281","https://openalex.org/W3082765557","https://openalex.org/W3189992245","https://openalex.org/W4225922019","https://openalex.org/W4253795631","https://openalex.org/W4288057723","https://openalex.org/W4313270705","https://openalex.org/W4379537474","https://openalex.org/W4384471497","https://openalex.org/W4384573318","https://openalex.org/W4388667412","https://openalex.org/W4400166129"],"related_works":["https://openalex.org/W1992663735","https://openalex.org/W3176904788","https://openalex.org/W2578463151","https://openalex.org/W21597398","https://openalex.org/W1505872263","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W2810367355","https://openalex.org/W1913543287"],"abstract_inverted_index":{"Abstract":[0],"Satisfiability":[1],"modulo":[2],"finite":[3],"fields":[4],"enables":[5],"automated":[6],"verification":[7],"for":[8,15,33,64,85],"cryptosystems.":[9],"Unfortunately,":[10],"previous":[11],"solvers":[12],"scale":[13],"poorly":[14],"even":[16],"some":[17],"simple":[18],"systems":[19],"of":[20,47],"field":[21],"equations,":[22],"in":[23],"part":[24],"because":[25],"they":[26],"build":[27],"a":[28,38],"full":[29,49],"Gr\u00f6bner":[30],"basis":[31],"(GB)":[32],"the":[34,55],"system.":[35],"We":[36],"propose":[37],"new":[39],"solver":[40],"that":[41,69],"uses":[42],"multiple,":[43],"simpler":[44],"GBs":[45],"instead":[46],"one":[48],"GB.":[50],"Our":[51],"solver,":[52,58],"implemented":[53],"within":[54],"cvc5":[56],"SMT":[57],"admits":[59],"specialized":[60],"propagation":[61],"algorithms,":[62],"e.g.,":[63],"understanding":[65],"bitsums.":[66],"Experiments":[67],"show":[68],"it":[70],"solves":[71],"important":[72],"bitsum-heavy":[73],"determinism":[74],"benchmarks":[75],"far":[76],"faster":[77],"than":[78],"prior":[79],"solvers,":[80],"without":[81],"introducing":[82],"much":[83],"overhead":[84],"other":[86],"benchmarks.":[87]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}