{"id":"https://openalex.org/W7161480316","doi":"https://doi.org/10.1007/978-3-032-26220-2_18","title":"Correct-by-Construction Dynamic Reachability: A Galois-Connected Approach to\u00a0Bidirected Dyck Languages","display_name":"Correct-by-Construction Dynamic Reachability: A Galois-Connected Approach to\u00a0Bidirected Dyck Languages","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7161480316","doi":"https://doi.org/10.1007/978-3-032-26220-2_18"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-032-26220-2_18","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-26220-2_18","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-26220-2_18.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-032-26220-2_18.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008336560","display_name":"Xiaofei Zhao","orcid":"https://orcid.org/0000-0002-4014-6253"},"institutions":[{"id":"https://openalex.org/I22716506","display_name":"Lanzhou University of Technology","ror":"https://ror.org/03panb555","country_code":"CN","type":"education","lineage":["https://openalex.org/I22716506"]},{"id":"https://openalex.org/I3133134087","display_name":"Lanzhou Jiaotong University","ror":"https://ror.org/03144pv92","country_code":"CN","type":"education","lineage":["https://openalex.org/I3133134087"]},{"id":"https://openalex.org/I4210129425","display_name":"Lanzhou Petrochemical Polytechnic","ror":"https://ror.org/03pkj2z67","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210129425"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xiaofei Zhao","raw_affiliation_strings":["School of Automatization and Electric Engineering, Lanzhou Jiaotong University, No. 88 Anning West Road, Anning, Lanzhou, 730070, Gansu, China","School of Information Engineering, Lanzhou Petrochemical University of Vocational Technology, No. 1 Shandan Street, Xigu, Lanzhou, 730060, Gansu, China"],"raw_orcid":"https://orcid.org/0000-0003-0772-8240","affiliations":[{"raw_affiliation_string":"School of Automatization and Electric Engineering, Lanzhou Jiaotong University, No. 88 Anning West Road, Anning, Lanzhou, 730070, Gansu, China","institution_ids":["https://openalex.org/I3133134087"]},{"raw_affiliation_string":"School of Information Engineering, Lanzhou Petrochemical University of Vocational Technology, No. 1 Shandan Street, Xigu, Lanzhou, 730060, Gansu, China","institution_ids":["https://openalex.org/I4210129425","https://openalex.org/I22716506"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008336560"],"corresponding_institution_ids":["https://openalex.org/I22716506","https://openalex.org/I3133134087","https://openalex.org/I4210129425"],"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":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"347","last_page":"366"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.34209999442100525,"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"}},"topics":[{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.34209999442100525,"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"}},{"id":"https://openalex.org/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.16699999570846558,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.11410000175237656,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8687999844551086},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6615999937057495},{"id":"https://openalex.org/keywords/formalism","display_name":"Formalism (music)","score":0.48249998688697815},{"id":"https://openalex.org/keywords/alias","display_name":"Alias","score":0.4796999990940094},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.43230000138282776},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4194999933242798},{"id":"https://openalex.org/keywords/transitive-reduction","display_name":"Transitive reduction","score":0.3774999976158142},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.3652999997138977},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.34709998965263367},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.34310001134872437}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8687999844551086},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8353999853134155},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6615999937057495},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5884000062942505},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.48249998688697815},{"id":"https://openalex.org/C46681722","wikidata":"https://www.wikidata.org/wiki/Q4725589","display_name":"Alias","level":2,"score":0.4796999990940094},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.43230000138282776},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4194999933242798},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41179999709129333},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.3774999976158142},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.3652999997138977},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.34709998965263367},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.34310001134872437},{"id":"https://openalex.org/C2777573902","wikidata":"https://www.wikidata.org/wiki/Q1491747","display_name":"Galois connection","level":2,"score":0.3271999955177307},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3206999897956848},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.31540000438690186},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.30379998683929443},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3037000000476837},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.3018999993801117},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.2994999885559082},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.2973000109195709},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.2913999855518341},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.2890999913215637},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2822999954223633},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.28220000863075256},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.2775999903678894},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.27250000834465027},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.27239999175071716},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.2711000144481659},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.2700999975204468},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.2687999904155731},{"id":"https://openalex.org/C17758045","wikidata":"https://www.wikidata.org/wiki/Q2642629","display_name":"Multigraph","level":3,"score":0.26589998602867126},{"id":"https://openalex.org/C102379954","wikidata":"https://www.wikidata.org/wiki/Q2589940","display_name":"Call graph","level":2,"score":0.2639000117778778},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.25270000100135803}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-032-26220-2_18","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-26220-2_18","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-26220-2_18.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-032-26220-2_18","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-26220-2_18","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-26220-2_18.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":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7161480316.pdf","grobid_xml":"https://content.openalex.org/works/W7161480316.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W2852225","https://openalex.org/W1966032455","https://openalex.org/W1969485351","https://openalex.org/W1971782746","https://openalex.org/W1976303542","https://openalex.org/W2014764321","https://openalex.org/W2024779397","https://openalex.org/W2030166143","https://openalex.org/W2043100293","https://openalex.org/W2046160987","https://openalex.org/W2046213250","https://openalex.org/W2049354208","https://openalex.org/W2093080079","https://openalex.org/W2131135493","https://openalex.org/W2133497528","https://openalex.org/W2163660741","https://openalex.org/W2166091242","https://openalex.org/W2513927163","https://openalex.org/W2810768857","https://openalex.org/W2964232059","https://openalex.org/W2998594779","https://openalex.org/W2999411576","https://openalex.org/W3021091026","https://openalex.org/W3082737479","https://openalex.org/W4233410239","https://openalex.org/W4237700877","https://openalex.org/W4250846042","https://openalex.org/W4390604707"],"related_works":[],"abstract_inverted_index":{"Abstract":[0,94,148],"The":[1],"integration":[2],"of":[3,204],"precise":[4],"static":[5],"analysis":[6,17,100],"into":[7],"interactive":[8],"development":[9],"environments":[10],"(IDEs)":[11],"necessitates":[12],"algorithms":[13,43],"that":[14,130,165,186],"can":[15],"update":[16,128],"results":[18],"incrementally":[19],"within":[20],"milliseconds.":[21],"However,":[22],"maintaining":[23],"Bidirected":[24],"Dyck-CFL":[25],"reachability":[26,124,166],"\u2014the":[27],"standard":[28],"formalism":[29],"for":[30],"field-sensitive":[31],"alias":[32],"analysis\u2014under":[33],"dynamic":[34,66,99],"graph":[35,104],"mutations":[36],"remains":[37],"an":[38,200],"open":[39],"challenge.":[40],"Standard":[41],"batch":[42,194],"exhibit":[44],"prohibiting":[45],"cubic":[46],"complexity":[47,203],"(":[48],"$$\\mathcal":[49,205],"{O}(N^3)$$":[50],"<mml:math":[51,208],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[52,209],"<mml:mrow>":[53,210],"<mml:mi>O</mml:mi>":[54,211],"<mml:mo>(</mml:mo>":[55,212],"<mml:msup>":[56],"<mml:mi>N</mml:mi>":[57],"<mml:mn>3</mml:mn>":[58],"</mml:msup>":[59],"<mml:mo>)</mml:mo>":[60,214],"</mml:mrow>":[61,215],"</mml:math>":[62,216],"),":[63],"while":[64],"existing":[65],"approaches":[67],"often":[68],"lack":[69],"formal":[70,183],"guarantees":[71],"when":[72],"handling":[73],"non-monotonic":[74,142],"edge":[75],"deletions":[76],"(the":[77],"\u201cghost":[78],"path\u201d":[79],"problem).":[80],"In":[81],"this":[82],"paper,":[83],"we":[84,126,144],"present":[85],"GC-DBDR":[86,187],",":[87,163,217],"a":[88,112,116,146,152],"novel":[89],"incremental":[90],"framework":[91],"rooted":[92],"in":[93],"Interpretation.":[95],"We":[96,181],"reformulate":[97],"the":[98,136,159,197],"problem":[101],"not":[102],"as":[103,107],"patching,":[105],"but":[106],"computing":[108],"Differential":[109],"Fixpoints":[110],"over":[111],"lattice.":[113],"By":[114],"establishing":[115],"rigorous":[117],"Galois":[118],"Connection":[119],"between":[120,138],"execution":[121],"traces":[122],"and":[123,141,171,190],"relations,":[125],"derive":[127],"rules":[129],"are":[131,168,178],"correct-by-construction":[132],".":[133,155],"To":[134],"resolve":[135],"asymmetry":[137],"monotonic":[139],"insertions":[140],"deletions,":[143],"introduce":[145],"Counting-Augmented":[147],"Domain":[149],"supported":[150],"by":[151],"Derivation":[153],"Hypergraph":[154],"This":[156],"structure":[157],"operationalizes":[158],"Inverse":[160],"Abstraction":[161],"Principle":[162],"ensuring":[164],"facts":[167],"retracted":[169],"if":[170,173],"only":[172],"their":[174],"supporting":[175],"derivation":[176],"trees":[177],"fully":[179],"invalidated.":[180],"provide":[182],"proofs":[184],"demonstrating":[185],"is":[188],"sound":[189],"complete":[191],"relative":[192],"to":[193],"analysis.":[195],"Empirically,":[196],"algorithm":[198],"achieves":[199],"optimal":[201],"input-output":[202],"{O}(\\varDelta":[206],")$$":[207],"<mml:mi>\u0394</mml:mi>":[213],"delivering":[218],"sub-millisecond":[219],"tail":[220],"latencies":[221],"on":[222],"real-world":[223],"benchmarks.":[224]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-05-18T00:00:00"}