{"id":"https://openalex.org/W7127938981","doi":"https://doi.org/10.48550/arxiv.2602.04641","title":"Abstract Framework for All-Path Reachability Analysis toward Safety and Liveness Verification (Full Version)","display_name":"Abstract Framework for All-Path Reachability Analysis toward Safety and Liveness Verification (Full Version)","publication_year":2026,"publication_date":"2026-02-04","ids":{"openalex":"https://openalex.org/W7127938981","doi":"https://doi.org/10.48550/arxiv.2602.04641"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.04641","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088240358","display_name":"Misaki Kojima","orcid":"https://orcid.org/0000-0001-5194-3947"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kojima, Misaki","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5087763144","display_name":"Naoki Nishida","orcid":"https://orcid.org/0000-0001-8697-4970"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nishida, Naoki","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.800000011920929,"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.800000011920929,"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/T13295","display_name":"Safety Systems Engineering in Autonomy","score":0.0786999985575676,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.01979999989271164,"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/liveness","display_name":"Liveness","score":0.9120000004768372},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8109999895095825},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.6261000037193298},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.5188999772071838},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43529999256134033},{"id":"https://openalex.org/keywords/rule-of-inference","display_name":"Rule of inference","score":0.4343999922275543},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.40560001134872437},{"id":"https://openalex.org/keywords/backward-chaining","display_name":"Backward chaining","score":0.36629998683929443}],"concepts":[{"id":"https://openalex.org/C15569618","wikidata":"https://www.wikidata.org/wiki/Q3561421","display_name":"Liveness","level":2,"score":0.9120000004768372},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8109999895095825},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.6261000037193298},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5598000288009644},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.5188999772071838},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5152000188827515},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43529999256134033},{"id":"https://openalex.org/C3746660","wikidata":"https://www.wikidata.org/wiki/Q1068763","display_name":"Rule of inference","level":2,"score":0.4343999922275543},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42100000381469727},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41029998660087585},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.40560001134872437},{"id":"https://openalex.org/C129916263","wikidata":"https://www.wikidata.org/wiki/Q1141183","display_name":"Backward chaining","level":4,"score":0.36629998683929443},{"id":"https://openalex.org/C2779907942","wikidata":"https://www.wikidata.org/wiki/Q7239630","display_name":"Predicate abstraction","level":3,"score":0.3619000017642975},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.35600000619888306},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.3553999960422516},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.3474000096321106},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.3025999963283539},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.29490000009536743},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.2689000070095062},{"id":"https://openalex.org/C2777168461","wikidata":"https://www.wikidata.org/wiki/Q42196253","display_name":"Set operations","level":3,"score":0.2678000032901764},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.2639999985694885}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.04641","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.04641","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.04641","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.04641","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"An":[0,61],"all-path":[1],"reachability":[2],"(APR)":[3],"predicate":[4,63,262,305],"over":[5],"an":[6,94,185,292],"object":[7,25],"set":[8,15,92],"is":[9,64,107,196,300,306],"a":[10,13,17,73,119,135,146,197,232,258,264,269,288],"pair":[11],"of":[12,23,49,55,82,102,111,141,171,236,298],"source":[14,91],"and":[16,37,154,166,209,271],"target":[18,98,254],"set,":[19],"which":[20,115,242,299],"are":[21],"subsets":[22],"the":[24,83,90,97,132,149,161,201,275,295,303],"set.":[26,99],"APR":[27,62,103,164,217,225,237,261,293,304],"predicates":[28,104],"have":[29],"been":[30],"defined":[31,108],"for":[32,128,138,152,163,188,204,257,274,291],"abstract":[33,186],"reduction":[34,80],"systems":[35,45],"(ARSs)":[36],"then":[38,302],"extended":[39],"to":[40,66,122,169,215,219,223,227,252,277],"logically":[41],"constrained":[42,50],"term":[43],"rewrite":[44,74],"(LCTRSs)":[46],"as":[47],"pairs":[48],"terms":[51,56],"that":[52,194,284],"represent":[53],"sets":[54],"modeling":[57],"configurations,":[58],"states,":[59],"etc.":[60],"said":[65],"be":[67,117],"partially":[68,259],"(or":[69],"demonically)":[70],"valid":[71,260],"w.r.t.":[72,105,191,207],"system":[75,84,121,137],"if":[76,285],"every":[77],"finite":[78,246],"maximal":[79],"sequence":[81],"starting":[85],"from":[86],"any":[87],"element":[88,95],"in":[89,96],"includes":[93],"Partial":[100],"validity":[101,190,206,235],"ARSs":[106,153,192,208],"by":[109],"means":[110],"two":[112],"inference":[113,143,150,202],"rules,":[114,144],"can":[116],"considered":[118],"proof":[120,136,296],"construct":[123],"(possibly":[124],"infinite)":[125],"derivation":[126],"trees":[127],"partial":[129,189,205],"validity.":[130,280],"On":[131],"other":[133],"hand,":[134],"LCTRSs":[139],"consists":[140],"four":[142],"leaving":[145],"gap":[147],"between":[148,200],"rules":[151,203],"LCTRSs.":[155,210],"In":[156],"this":[157,180],"paper,":[158],"we":[159,182,212,230,267],"revisit":[160],"framework":[162,187],"analysis":[165,218,226],"adapt":[167],"it":[168],"verification":[170],"not":[172,244],"only":[173,245],"safety":[174,220],"but":[175,247],"also":[176,248],"liveness":[177,228],"properties.":[178],"To":[179],"end,":[181],"first":[183],"reformulate":[184],"so":[193],"there":[195,286],"one-to-one":[198],"correspondence":[199],"Secondly,":[211],"show":[213,268],"how":[214],"apply":[216,224],"verification.":[221],"Thirdly,":[222],"verification,":[229],"introduce":[231],"novel":[233],"stronger":[234],"predicates,":[238],"called":[239],"total":[240,279],"validity,":[241],"requires":[243],"infinite":[249],"execution":[250],"paths":[251],"reach":[253],"sets.":[255],"Finally,":[256],"with":[263],"cyclic-proof":[265,289],"tree,":[266],"necessary":[270],"sufficient":[272],"condition":[273,282],"tree":[276,290],"ensure":[278],"The":[281],"implies":[283],"exists":[287],"predicate,":[294],"graph":[297],"acyclic,":[301],"totally":[307],"valid.":[308]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-07T00:00:00"}