{"id":"https://openalex.org/W7163883235","doi":"https://doi.org/10.1145/3808344","title":"Navigating AND\u2013OR Graph Modifications to Debug Failing Proof Search","display_name":"Navigating AND\u2013OR Graph Modifications to Debug Failing Proof Search","publication_year":2026,"publication_date":"2026-06-08","ids":{"openalex":"https://openalex.org/W7163883235","doi":"https://doi.org/10.1145/3808344"},"language":"en","primary_location":{"id":"doi:10.1145/3808344","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3808344","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1145/3808344","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138143095","display_name":"Justin Lubin","orcid":"https://orcid.org/0000-0003-2311-1873"},"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":"Justin Lubin","raw_affiliation_strings":["University of California at Berkeley, Berkeley, USA"],"raw_orcid":"https://orcid.org/0000-0003-2311-1873","affiliations":[{"raw_affiliation_string":"University of California at Berkeley, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128936074","display_name":"Marlena Preigh","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":"Marlena Preigh","raw_affiliation_strings":["University of California at Berkeley, Berkeley, USA"],"raw_orcid":"https://orcid.org/0009-0005-1087-0995","affiliations":[{"raw_affiliation_string":"University of California at Berkeley, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048760480","display_name":"Max Willsey","orcid":"https://orcid.org/0000-0001-8066-4218"},"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":"Max Willsey","raw_affiliation_strings":["University of California at Berkeley, Berkeley, USA"],"raw_orcid":"https://orcid.org/0000-0001-8066-4218","affiliations":[{"raw_affiliation_string":"University of California at Berkeley, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090728813","display_name":"Sarah Chasins","orcid":"https://orcid.org/0000-0003-0557-3580"},"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":"Sarah E. Chasins","raw_affiliation_strings":["University of California at Berkeley, Berkeley, USA"],"raw_orcid":"https://orcid.org/0000-0003-0557-3580","affiliations":[{"raw_affiliation_string":"University of California at Berkeley, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.72179925,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":"PLDI","first_page":"2427","last_page":"2451"},"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.8720999956130981,"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.8720999956130981,"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.05270000174641609,"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/T10639","display_name":"Advanced Software Engineering Methodologies","score":0.012299999594688416,"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/debugging","display_name":"Debugging","score":0.8274999856948853},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.7373999953269958},{"id":"https://openalex.org/keywords/algorithmic-program-debugging","display_name":"Algorithmic program debugging","score":0.5439000129699707},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.47189998626708984},{"id":"https://openalex.org/keywords/proof-of-concept","display_name":"Proof of concept","score":0.4415999948978424},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4300000071525574},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.4099000096321106},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.3991999924182892}],"concepts":[{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.8274999856948853},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7512999773025513},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.7373999953269958},{"id":"https://openalex.org/C136388014","wikidata":"https://www.wikidata.org/wiki/Q17084976","display_name":"Algorithmic program debugging","level":3,"score":0.5439000129699707},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47200000286102295},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.47189998626708984},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.46389999985694885},{"id":"https://openalex.org/C124978682","wikidata":"https://www.wikidata.org/wiki/Q1201019","display_name":"Proof of concept","level":2,"score":0.4415999948978424},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4300000071525574},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.4099000096321106},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.3991999924182892},{"id":"https://openalex.org/C94461902","wikidata":"https://www.wikidata.org/wiki/Q2762418","display_name":"Formal proof","level":3,"score":0.39570000767707825},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.37790000438690186},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.3596000075340271},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.35589998960494995},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.335099995136261},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3174999952316284},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.30550000071525574},{"id":"https://openalex.org/C102379954","wikidata":"https://www.wikidata.org/wiki/Q2589940","display_name":"Call graph","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.25279998779296875}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3808344","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3808344","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3808344","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3808344","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.482717901468277,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G2499150370","display_name":null,"funder_award_id":"175281","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W173479935","https://openalex.org/W1514468887","https://openalex.org/W1552694902","https://openalex.org/W1556735226","https://openalex.org/W1600055947","https://openalex.org/W1717828047","https://openalex.org/W1849052677","https://openalex.org/W1997150177","https://openalex.org/W2011725693","https://openalex.org/W2015755355","https://openalex.org/W2022340601","https://openalex.org/W2037037228","https://openalex.org/W2045041259","https://openalex.org/W2045313089","https://openalex.org/W2050349524","https://openalex.org/W2056310485","https://openalex.org/W2087272670","https://openalex.org/W2124217695","https://openalex.org/W2127948899","https://openalex.org/W2155882070","https://openalex.org/W2163964352","https://openalex.org/W2166414999","https://openalex.org/W2166709576","https://openalex.org/W2232112468","https://openalex.org/W2293299776","https://openalex.org/W2478708596","https://openalex.org/W2752382195","https://openalex.org/W2888214251","https://openalex.org/W2889548904","https://openalex.org/W2964296984","https://openalex.org/W3021830120","https://openalex.org/W3033533057","https://openalex.org/W3178506813","https://openalex.org/W4232512250","https://openalex.org/W4246215794","https://openalex.org/W4315630513","https://openalex.org/W4379536906","https://openalex.org/W4384159122","https://openalex.org/W4387667008","https://openalex.org/W4390604815","https://openalex.org/W4400973078","https://openalex.org/W4411260245","https://openalex.org/W4411260266","https://openalex.org/W4412543571","https://openalex.org/W7110140806","https://openalex.org/W7135191387","https://openalex.org/W7135192602","https://openalex.org/W7154936729"],"related_works":[],"abstract_inverted_index":{"Proof":[0],"search":[1,12,24,40,64,100],"powers":[2],"our":[3],"most":[4],"advanced":[5],"programming":[6,168],"tools,":[7],"from":[8],"type":[9],"systems,":[10],"to":[11,18,91,125,135,163,216,232],"tactics":[13],"for":[14,36,238],"interactive":[15],"theorem":[16],"provers,":[17],"Datalog-backed":[19],"program":[20],"analyses.":[21],"Although":[22],"proof":[23,39,63,99,114,127,142,172],"tooling":[25],"is":[26,33,51,161],"powerful":[27],"and":[28,70,129,160,187,220],"now":[29],"pervasive,":[30],"debugging":[31,71,118,133,180],"it":[32],"hard,":[34],"even":[35],"experts.":[37],"When":[38],"cannot":[41],"prove":[42],"the":[43,45,57,62,83,112,140,145,164,209],"goal,":[44],"programmer\u2019s":[46],"best":[47],"source":[48],"of":[49,68,75,81,98,111,122,152,167,211,242],"information":[50],"a":[52,95,108,120,132,156,199,203,221],"massive":[53],"AND\u2013OR":[54,105,194],"graph":[55],"representing":[56],"tool\u2019s":[58],"internal":[59,76],"state":[60,77],"during":[61],"process.":[65],"The":[66],"difficulty":[67],"understanding":[69],"this":[72,126],"vast":[73],"trace":[74],"locks":[78],"programmers":[79],"out":[80],"exactly":[82],"high-assurance":[84],"automated":[85],"reasoning":[86],"tools":[87,169],"we":[88,188,224],"want":[89],"them":[90],"adopt.":[92],"We":[93,196],"propose":[94],"new":[96,185,222],"formulation":[97],"debugging,":[101],"which:":[102],"(i)":[103],"views":[104],"graphs":[106],"as":[107,119,182,184],"partial":[109],"representations":[110],"underlying":[113],"system,":[115,128],"(ii)":[116],"treats":[117],"process":[121],"applying":[123],"modifications":[124,138],"(iii)":[130],"uses":[131],"tool":[134],"solicit":[136],"these":[137],"until":[139],"resulting":[141],"system":[143],"proves":[144],"original":[146],"goal.":[147],"This":[148],"approach":[149],"unifies":[150],"decades":[151],"ad-hoc":[153],"strategies":[154,181,191],"in":[155],"single":[157],"general-purpose":[158],"framework":[159,175],"applicable":[162],"diverse":[165],"range":[166],"that":[170,198,201],"use":[171],"search.":[173],"Our":[174],"can":[176],"express":[177],"existing":[178],"\u201cwhy-not\u201d":[179],"well":[183],"strategies,":[186],"evaluate":[189],"such":[190],"on":[192],"284":[193],"graphs.":[195],"find":[197],"strategy":[200],"enforces":[202],"property":[204,223],"called":[205],"Strong":[206,226],"Soundness":[207],"reduces":[208],"number":[210],"decisions":[212,235],"by":[213,236],"1.4\u00d7\u20133.2\u00d7":[214],"compared":[215],"an":[217,239],"unsound":[218],"baseline,":[219],"call":[225],"Completeness":[227],"Modulo":[228],"Observability":[229],"enables":[230],"pruning":[231],"further":[233],"reduce":[234],"1.0\u00d7\u20132.8\u00d7":[237],"overall":[240],"reduction":[241],"2.0\u00d7\u20133.8\u00d7.":[243]},"counts_by_year":[],"updated_date":"2026-06-09T06:26:37.801270","created_date":"2026-06-09T00:00:00"}