{"id":"https://openalex.org/W2293030156","doi":"https://doi.org/10.1145/2535838.2535868","title":"Abstract satisfaction","display_name":"Abstract satisfaction","publication_year":2014,"publication_date":"2014-01-08","ids":{"openalex":"https://openalex.org/W2293030156","doi":"https://doi.org/10.1145/2535838.2535868","mag":"2293030156"},"language":"en","primary_location":{"id":"doi:10.1145/2535838.2535868","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2535838.2535868","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2535838.2535868","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},"type":"conference-abstract","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/2535838.2535868","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054947709","display_name":"Vijay D\u2019Silva","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vijay D'Silva","raw_affiliation_strings":["University of California, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085764515","display_name":"Leopold Haller","orcid":null},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Leopold Haller","raw_affiliation_strings":["University of Oxford, Oxford, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086206346","display_name":"Daniel Kroening","orcid":"https://orcid.org/0000-0002-6681-5283"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Daniel Kroening","raw_affiliation_strings":["University of Oxford, Oxford, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":19,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"139","last_page":"150"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9990000128746033,"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/dpll-algorithm","display_name":"DPLL algorithm","score":0.7004507780075073},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6863484978675842},{"id":"https://openalex.org/keywords/abstract-interpretation","display_name":"Abstract interpretation","score":0.6734645366668701},{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.5988181829452515},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5959142446517944},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.565738320350647},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5178130269050598},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39945149421691895},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27907687425613403},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.26446816325187683}],"concepts":[{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.7004507780075073},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6863484978675842},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.6734645366668701},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.5988181829452515},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5959142446517944},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.565738320350647},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5178130269050598},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39945149421691895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27907687425613403},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.26446816325187683},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0},{"id":"https://openalex.org/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2535838.2535868","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2535838.2535868","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2535838.2535868","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:e8603807-6fdc-452f-aea5-0a8a7d4942d7","is_oa":true,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:e8603807-6fdc-452f-aea5-0a8a7d4942d7","pdf_url":"https://ora.ox.ac.uk/objects/uuid:e8603807-6fdc-452f-aea5-0a8a7d4942d7","source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science","raw_type":"Conference item"}],"best_oa_location":{"id":"doi:10.1145/2535838.2535868","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2535838.2535868","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2535838.2535868","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.8100000023841858}],"awards":[{"id":"https://openalex.org/G2598114656","display_name":null,"funder_award_id":"H017585/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G2602268313","display_name":"Verification of Shared-Memory Concurrent Software","funder_award_id":"EP/H017585/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3691535567","display_name":null,"funder_award_id":"EP/G026254/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6941323120","display_name":null,"funder_award_id":"EP/H017585/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"},{"id":"https://openalex.org/F4320322622","display_name":"Toyota Motor Corporation","ror":"https://ror.org/02zqm6r10"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2293030156.pdf","grobid_xml":"https://content.openalex.org/works/W2293030156.grobid-xml"},"referenced_works_count":54,"referenced_works":["https://openalex.org/W49331338","https://openalex.org/W52562630","https://openalex.org/W54305883","https://openalex.org/W67255151","https://openalex.org/W70797468","https://openalex.org/W190752300","https://openalex.org/W263217020","https://openalex.org/W781716309","https://openalex.org/W1481249376","https://openalex.org/W1489527380","https://openalex.org/W1498747704","https://openalex.org/W1500085611","https://openalex.org/W1503472559","https://openalex.org/W1534633719","https://openalex.org/W1556578161","https://openalex.org/W1607643415","https://openalex.org/W1716612759","https://openalex.org/W1747583082","https://openalex.org/W1810972023","https://openalex.org/W1832354128","https://openalex.org/W1908449836","https://openalex.org/W1919297764","https://openalex.org/W1950282396","https://openalex.org/W2014764321","https://openalex.org/W2022846948","https://openalex.org/W2043100293","https://openalex.org/W2044110501","https://openalex.org/W2046160987","https://openalex.org/W2062897452","https://openalex.org/W2080593426","https://openalex.org/W2081810835","https://openalex.org/W2084875723","https://openalex.org/W2093397547","https://openalex.org/W2099272825","https://openalex.org/W2099684400","https://openalex.org/W2105223068","https://openalex.org/W2105468483","https://openalex.org/W2125189388","https://openalex.org/W2144789370","https://openalex.org/W2154687874","https://openalex.org/W2167321054","https://openalex.org/W2295244175","https://openalex.org/W2613995098","https://openalex.org/W2949417720","https://openalex.org/W4232671690","https://openalex.org/W4300885858","https://openalex.org/W6602005384","https://openalex.org/W6629352142","https://openalex.org/W6630511988","https://openalex.org/W6631922425","https://openalex.org/W6661559973","https://openalex.org/W6673656472","https://openalex.org/W6758947918","https://openalex.org/W7018500675"],"related_works":["https://openalex.org/W2007316622","https://openalex.org/W2408711288","https://openalex.org/W1024451821","https://openalex.org/W2094368841","https://openalex.org/W2048447692","https://openalex.org/W2128006027","https://openalex.org/W2089119454","https://openalex.org/W2119634222","https://openalex.org/W2394349251","https://openalex.org/W302791680"],"abstract_inverted_index":{"This":[0,41],"article":[1],"introduces":[2],"an":[3],"abstract":[4],"interpretation":[5],"framework":[6,102],"that":[7,28],"codifies":[8],"the":[9,26,78],"operations":[10],"in":[11,16,36,77,86],"SAT":[12,87],"and":[13,21,53,67,84,96,110,114],"SMT":[14],"solvers":[15],"terms":[17],"of":[18,34,39,43,50,59,70,120],"lattices,":[19],"transformers":[20],"fixed":[22,48,72],"points.":[23,73],"We":[24],"develop":[25],"idea":[27],"a":[29,32,37,104,124],"formula":[30],"denotes":[31],"set":[33,42],"models":[35,44],"universe":[38],"structures.":[40],"has":[45],"characterizations":[46],"as":[47,65],"points":[49],"deduction,":[51],"abduction":[52],"quantification":[54],"transformers.":[55],"A":[56,117],"wide":[57],"range":[58],"satisfiability":[60,115],"procedures":[61,76,90,97],"can":[62],"be":[63],"understood":[64],"computing":[66],"refining":[68],"approximations":[69],"such":[71],"These":[74],"include":[75],"DPLL":[79],"family,":[80],"those":[81],"for":[82,91,98,108,128],"preprocessing":[83],"inprocessing":[85],"solvers,":[88],"decision":[89],"equality":[92],"logics,":[93],"weak":[94],"arithmetics,":[95],"approximate":[99],"quantification.":[100],"Our":[101],"provides":[103],"unified,":[105],"mathematical":[106],"basis":[107],"studying":[109],"combining":[111],"program":[112],"analysis":[113],"procedures.":[116],"practical":[118],"benefit":[119],"our":[121],"work":[122],"is":[123],"new,":[125],"logic-agnostic":[126],"architecture":[127],"implementing":[129],"solvers.":[130]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}