{"id":"https://openalex.org/W7168379567","doi":"https://doi.org/10.4230/lipics.fscd.2026.19","title":"Abstract Framework for All-Path Reachability Analysis toward Safety and Liveness Verification","display_name":"Abstract Framework for All-Path Reachability Analysis toward Safety and Liveness Verification","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7168379567","doi":"https://doi.org/10.4230/lipics.fscd.2026.19"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26369","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2026.19","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol378-fscd2026/LIPIcs.FSCD.2026.19/LIPIcs.FSCD.2026.19.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"conference-abstract","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol378-fscd2026/LIPIcs.FSCD.2026.19/LIPIcs.FSCD.2026.19.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5140815830","display_name":"Misaki Kojima","orcid":"https://orcid.org/0000-0001-5194-3947"},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kojima, Misaki","raw_affiliation_strings":["Graduate School of Informatics, Nagoya University, Japan"],"raw_orcid":"https://orcid.org/0000-0001-5194-3947","affiliations":[{"raw_affiliation_string":"Graduate School of Informatics, Nagoya University, Japan","institution_ids":["https://openalex.org/I60134161"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5140845158","display_name":"Naoki Nishida","orcid":"https://orcid.org/0000-0001-8697-4970"},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Nishida, Naoki","raw_affiliation_strings":["Graduate School of Informatics, Nagoya University, Japan"],"raw_orcid":"https://orcid.org/0000-0001-8697-4970","affiliations":[{"raw_affiliation_string":"Graduate School of Informatics, Nagoya University, Japan","institution_ids":["https://openalex.org/I60134161"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I60134161"],"apc_list":null,"apc_paid":null,"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":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/liveness","display_name":"Liveness","score":0.911300003528595},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8062000274658203},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.6190999746322632},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.5131000280380249},{"id":"https://openalex.org/keywords/rule-of-inference","display_name":"Rule of inference","score":0.4341999888420105},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4271000027656555},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4027999937534332},{"id":"https://openalex.org/keywords/backward-chaining","display_name":"Backward chaining","score":0.3617999851703644}],"concepts":[{"id":"https://openalex.org/C15569618","wikidata":"https://www.wikidata.org/wiki/Q3561421","display_name":"Liveness","level":2,"score":0.911300003528595},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8062000274658203},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.6190999746322632},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.555899977684021},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.51419997215271},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.5131000280380249},{"id":"https://openalex.org/C3746660","wikidata":"https://www.wikidata.org/wiki/Q1068763","display_name":"Rule of inference","level":2,"score":0.4341999888420105},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4271000027656555},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41690000891685486},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41620001196861267},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4027999937534332},{"id":"https://openalex.org/C129916263","wikidata":"https://www.wikidata.org/wiki/Q1141183","display_name":"Backward chaining","level":4,"score":0.3617999851703644},{"id":"https://openalex.org/C2779907942","wikidata":"https://www.wikidata.org/wiki/Q7239630","display_name":"Predicate abstraction","level":3,"score":0.3610999882221222},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.35179999470710754},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.351500004529953},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.3407999873161316},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.3019999861717224},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.2971000075340271},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.26829999685287476},{"id":"https://openalex.org/C2777168461","wikidata":"https://www.wikidata.org/wiki/Q42196253","display_name":"Set operations","level":3,"score":0.2632000148296356},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.2615000009536743}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26369","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2026.19","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol378-fscd2026/LIPIcs.FSCD.2026.19/LIPIcs.FSCD.2026.19.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"pmh:doi:10.4230/lipics.fscd.2026.19","is_oa":true,"landing_page_url":"https://nagoya.repo.nii.ac.jp/records/2010041","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"doi:10.4230/lipics.fscd.2026.19","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fscd.2026.19","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26369","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2026.19","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol378-fscd2026/LIPIcs.FSCD.2026.19/LIPIcs.FSCD.2026.19.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8517191716","display_name":"Development of Program Verification Techniques Based on Coinduction on Logically Constrained Rewriting","funder_award_id":"24K02900","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7168379567.pdf","grobid_xml":"https://content.openalex.org/works/W7168379567.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"An":[0,67],"all-path":[1],"reachability":[2],"(APR,":[3],"for":[4,34,39,51,131,141,155,166,191,207,260,290,303],"short)":[5,40,52],"predicate":[6,69,265,317],"over":[7],"an":[8,97,188,304],"object":[9,27],"set":[10,17,95],"is":[11,70,110,199,284,312,318],"a":[12,15,19,76,122,138,149,200,235,261,267,285,300],"pair":[13],"of":[14,25,55,61,85,105,114,144,174,239,275,310],"source":[16,94],"and":[18,41,157,169,212,287],"target":[20,101,257],"set,":[21],"which":[22,118,245,311],"are":[23],"subsets":[24],"the":[26,86,93,100,135,152,164,204,273,276,281,307,315],"set.":[28,102],"APR":[29,68,106,167,220,228,240,264,305,316],"predicates":[30,107],"have":[31],"been":[32],"defined":[33,111],"abstract":[35,189],"reduction":[36,83],"systems":[37,49],"(ARSs,":[38],"then":[42,314],"extended":[43],"to":[44,125,172,218,222,226,230,255],"logically":[45],"constrained":[46,56],"term":[47],"rewrite":[48,77],"(LCTRSs,":[50],"as":[53],"pairs":[54],"terms":[57,62],"that":[58,197,272,296],"represent":[59],"sets":[60],"modeling":[63],"configurations,":[64],"states,":[65],"etc.":[66],"partially":[71,262],"(or":[72],"demonically)":[73],"valid":[74,263],"w.r.t.":[75,108,194,210],"system":[78,87,124,140],"if":[79,297],"every":[80],"finite":[81,249],"maximal":[82],"sequence":[84],"starting":[88],"from":[89,280],"any":[90],"element":[91,98],"in":[92,99],"includes":[96],"Partial":[103],"validity":[104,193,209,238],"ARSs":[109,156,195,211],"by":[112],"means":[113],"two":[115],"inference":[116,146,153,205],"rules,":[117,147],"can":[119],"be":[120],"considered":[121],"proof":[123,139,277,308],"construct":[126],"(possibly":[127],"infinite)":[128],"derivation":[129],"trees":[130],"partial":[132,192,208],"validity.":[133,292],"On":[134],"other":[136],"hand,":[137],"LCTRSs":[142],"consists":[143],"four":[145],"leaving":[148],"gap":[150],"between":[151,203],"rules":[154,206],"LCTRSs.":[158,213],"In":[159],"this":[160,183],"paper,":[161],"we":[162,185,215,233,270],"revisit":[163],"framework":[165,190],"analysis":[168,221,229],"adapt":[170],"it":[171],"verification":[173],"not":[175,247],"only":[176,248],"safety":[177,223],"but":[178,250],"also":[179,251],"liveness":[180,231],"properties.":[181],"To":[182],"end,":[184],"first":[186],"reformulate":[187],"so":[196],"there":[198,298],"one-to-one":[201],"correspondence":[202],"Secondly,":[214],"show":[216,271],"how":[217],"apply":[219,227],"verification.":[224],"Thirdly,":[225],"verification,":[232],"introduce":[234],"novel":[236],"stronger":[237],"predicates,":[241],"called":[242],"total":[243,291],"validity,":[244],"requires":[246],"infinite":[252],"execution":[253],"paths":[254],"reach":[256],"sets.":[258],"Finally,":[259],"with":[266],"cyclic-proof":[268,282,301],"tree,":[269],"acyclicity":[274],"graph":[278,309],"obtained":[279],"tree":[283,302],"necessary":[286],"sufficient":[288],"condition":[289,294],"The":[293],"implies":[295],"exists":[299],"predicate,":[306],"acyclic,":[313],"totally":[319],"valid.":[320]},"counts_by_year":[],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2026-07-16T00:00:00"}