{"id":"https://openalex.org/W4384573347","doi":"https://doi.org/10.1007/978-3-031-37703-7_12","title":"Incremental Dead State Detection in\u00a0Logarithmic Time","display_name":"Incremental Dead State Detection in\u00a0Logarithmic Time","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4384573347","doi":"https://doi.org/10.1007/978-3-031-37703-7_12"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-37703-7_12","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-37703-7_12","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-37703-7_12.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":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-37703-7_12.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019472033","display_name":"Caleb Stanford","orcid":"https://orcid.org/0000-0002-8428-7736"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Caleb Stanford","raw_affiliation_strings":["University of California, Davis, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Davis, USA","institution_ids":["https://openalex.org/I84218800"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060114046","display_name":"Margus Veanes","orcid":"https://orcid.org/0009-0008-8427-7977"},"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":"Margus Veanes","raw_affiliation_strings":["Microsoft Research, Redmond, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019472033"],"corresponding_institution_ids":["https://openalex.org/I84218800"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":2.8846,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.90037037,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"241","last_page":"264"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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":0.9994999766349792,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9986000061035156,"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/T10126","display_name":"Logic, programming, and type systems","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/reachability","display_name":"Reachability","score":0.8035173416137695},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6779501438140869},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.659857988357544},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5607866644859314},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.4583527147769928},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4434130787849426},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.4296763837337494},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42901092767715454},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4170873761177063},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3649020195007324},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3558494448661804},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32818514108657837},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22720935940742493}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8035173416137695},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6779501438140869},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.659857988357544},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5607866644859314},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.4583527147769928},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4434130787849426},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4296763837337494},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42901092767715454},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4170873761177063},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3649020195007324},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3558494448661804},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32818514108657837},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22720935940742493},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-031-37703-7_12","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-37703-7_12","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-37703-7_12.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-37703-7_12","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-37703-7_12","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-37703-7_12.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":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4384573347.pdf"},"referenced_works_count":52,"referenced_works":["https://openalex.org/W129467524","https://openalex.org/W1480909796","https://openalex.org/W1519800400","https://openalex.org/W1540180960","https://openalex.org/W1540883472","https://openalex.org/W1552077729","https://openalex.org/W1558383352","https://openalex.org/W1986022261","https://openalex.org/W1990488650","https://openalex.org/W1992869351","https://openalex.org/W1998084650","https://openalex.org/W2000346568","https://openalex.org/W2008593246","https://openalex.org/W2018804864","https://openalex.org/W2025791989","https://openalex.org/W2032906824","https://openalex.org/W2035096212","https://openalex.org/W2055688322","https://openalex.org/W2061668791","https://openalex.org/W2068361557","https://openalex.org/W2084763084","https://openalex.org/W2094985106","https://openalex.org/W2097490969","https://openalex.org/W2102351893","https://openalex.org/W2104291383","https://openalex.org/W2110117589","https://openalex.org/W2113689473","https://openalex.org/W2116633957","https://openalex.org/W2122493035","https://openalex.org/W2137351629","https://openalex.org/W2146507303","https://openalex.org/W2153131284","https://openalex.org/W2156429182","https://openalex.org/W2295723447","https://openalex.org/W2493256084","https://openalex.org/W2496556858","https://openalex.org/W2592184324","https://openalex.org/W2613159091","https://openalex.org/W2792348861","https://openalex.org/W2908957302","https://openalex.org/W3002774327","https://openalex.org/W3009448167","https://openalex.org/W3048452377","https://openalex.org/W3099525000","https://openalex.org/W3117137355","https://openalex.org/W3177082579","https://openalex.org/W3186328512","https://openalex.org/W3214872226","https://openalex.org/W4225922019","https://openalex.org/W4241006348","https://openalex.org/W4246691913","https://openalex.org/W4384573347"],"related_works":["https://openalex.org/W4386044657","https://openalex.org/W3167233891","https://openalex.org/W2061523528","https://openalex.org/W2147848106","https://openalex.org/W273156001","https://openalex.org/W1516506843","https://openalex.org/W1482993605","https://openalex.org/W4366458105","https://openalex.org/W2523595498","https://openalex.org/W4316829802"],"abstract_inverted_index":{"Abstract":[0],"Identifying":[1],"live":[2],"and":[3,48,142,162,185,218],"dead":[4,115],"states":[5,45,101],"in":[6,15,22,31,70,118,122,196],"an":[7,174],"abstract":[8],"transition":[9],"system":[10],"is":[11,54,82,113,120],"a":[12,163,168,191,211],"recurring":[13],"problem":[14],"formal":[16],"verification;":[17],"for":[18,37,129,145,154,205],"example,":[19],"it":[20,81],"arises":[21],"our":[23],"recent":[24],"work":[25],"on":[26],"efficiently":[27],"deciding":[28],"regex":[29,222],"constraints":[30],"SMT.":[32],"However,":[33],"state-of-the-art":[34,187],"graph":[35,194,214],"algorithms":[36,153],"maintaining":[38],"reachability":[39],"information":[40],"incrementally":[41],"(that":[42],"is,":[43],"as":[44,80],"are":[46,75],"visited":[47],"before":[49],"the":[50,86,158,186,206],"entire":[51],"state":[52,65,79,116],"space":[53],"explored)":[55],"assume":[56],"that":[57,114],"new":[58],"edges":[59,74],"can":[60],"be":[61],"added":[62,76],"from":[63,77,221],"any":[64,67],"at":[66],"time,":[68],"whereas":[69],"many":[71],"applications,":[72],"outgoing":[73,108],"each":[78],"explored.":[83],"To":[84,172],"formalize":[85],"latter":[87],"situation,":[88],"we":[89,178],"propose":[90],"guided":[91],"incremental":[92,95,147],"digraphs":[93],"(GIDs),":[94],"graphs":[96,209,219],"which":[97,103],"support":[98],"labeling":[99],"closed":[100],"(states":[102],"will":[104],"not":[105],"receive":[106],"further":[107],"edges).":[109],"Our":[110,198],"main":[111],"result":[112],"detection":[117],"GIDs":[119],"solvable":[121],"$$O(\\log":[123],"m)$$":[124],"amortized":[125],"time":[126,160],"per":[127,135],"edge":[128,136],"m":[130],"edges,":[131],"improving":[132],"upon":[133],"$$O(\\sqrt{m})$$":[134],"due":[137],"to":[138,166],"Bender,":[139],"Fineman,":[140],"Gilbert,":[141],"Tarjan":[143],"(BFGT)":[144],"general":[146],"directed":[148,193],"graphs.":[149],"We":[150],"introduce":[151],"two":[152,182],"GIDs:":[155],"one":[156],"establishing":[157],"logarithmic":[159],"bound,":[161],"second":[164],"algorithm":[165],"explore":[167],"lazy":[169],"heuristics-based":[170],"approach.":[171],"enable":[173],"apples-to-apples":[175],"experimental":[176],"comparison,":[177],"implemented":[179],"both":[180],"algorithms,":[181],"simpler":[183],"baselines,":[184],"BFGT":[188,204],"baseline":[189],"using":[190],"common":[192],"interface":[195],"Rust.":[197],"evaluation":[199],"shows":[200],"110-530x":[201],"speedups":[202],"over":[203,210],"largest":[207],"input":[208],"range":[212],"of":[213],"classes,":[215],"random":[216],"graphs,":[217],"arising":[220],"benchmarks.":[223]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}