{"id":"https://openalex.org/W2951669582","doi":"https://doi.org/10.23638/lmcs-15(2:5)2019","title":"All-Path Reachability Logic","display_name":"All-Path Reachability Logic","publication_year":2019,"publication_date":"2019-04-30","ids":{"openalex":"https://openalex.org/W2951669582","doi":"https://doi.org/10.23638/lmcs-15(2:5)2019","mag":"2951669582"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-15(2:5)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(2:5)2019","pdf_url":"https://lmcs.episciences.org/5408/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/5408/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006183595","display_name":"Andrei \u0218tef\u0103nescu","orcid":"https://orcid.org/0000-0002-1970-314X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Andrei Stefanescu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026036782","display_name":"\u015etefan Ciob\u00e2c\u0103","orcid":"https://orcid.org/0009-0000-4082-570X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stefan Ciobaca","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012289531","display_name":"Radu Mereu\u0163\u0103","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Radu Mereuta","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109992836","display_name":"Brandon Moore","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Brandon Moore","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015125888","display_name":"Traian Florin \u015eerb\u0103nu\u0163\u0103","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Traian Florin Serbanuta","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5053878331","display_name":"Grigore Ro\u015fu","orcid":"https://orcid.org/0000-0002-3102-0421"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Grigore Rosu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5006183595"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1445,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.56495188,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"Volume 15, Issue 2","issue":null,"first_page":null,"last_page":null},"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.9998999834060669,"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.9998999834060669,"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.9997000098228455,"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/T11424","display_name":"Security and Verification in Computing","score":0.9987999796867371,"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.7889645099639893},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.7229650020599365},{"id":"https://openalex.org/keywords/precondition","display_name":"Precondition","score":0.7055467367172241},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6794917583465576},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.644719123840332},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6357735991477966},{"id":"https://openalex.org/keywords/predicate-transformer-semantics","display_name":"Predicate transformer semantics","score":0.6117360591888428},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5640487670898438},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.5531771779060364},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5366392135620117},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46281468868255615},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.4499019384384155},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.43522557616233826},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3168368339538574}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7889645099639893},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.7229650020599365},{"id":"https://openalex.org/C192465680","wikidata":"https://www.wikidata.org/wiki/Q1413450","display_name":"Precondition","level":2,"score":0.7055467367172241},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6794917583465576},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.644719123840332},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6357735991477966},{"id":"https://openalex.org/C30128091","wikidata":"https://www.wikidata.org/wiki/Q291929","display_name":"Predicate transformer semantics","level":4,"score":0.6117360591888428},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5640487670898438},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.5531771779060364},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5366392135620117},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46281468868255615},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.4499019384384155},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.43522557616233826},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3168368339538574},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23638/lmcs-15(2:5)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(2:5)2019","pdf_url":"https://lmcs.episciences.org/5408/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1810.10826","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1810.10826","pdf_url":"https://arxiv.org/pdf/1810.10826","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"doi:10.48550/arxiv.1810.10826","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1810.10826","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.23638/lmcs-15(2:5)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(2:5)2019","pdf_url":"https://lmcs.episciences.org/5408/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2951669582.pdf","grobid_xml":"https://content.openalex.org/works/W2951669582.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W80370608","https://openalex.org/W1165569327","https://openalex.org/W1462102326","https://openalex.org/W1517241109","https://openalex.org/W1518650316","https://openalex.org/W1537084112","https://openalex.org/W1551437553","https://openalex.org/W1819989006","https://openalex.org/W1965662337","https://openalex.org/W1968480809","https://openalex.org/W1969064066","https://openalex.org/W2002931343","https://openalex.org/W2011721441","https://openalex.org/W2031111340","https://openalex.org/W2048417351","https://openalex.org/W2055378322","https://openalex.org/W2075373350","https://openalex.org/W2098780033","https://openalex.org/W2109693366","https://openalex.org/W2132761501","https://openalex.org/W2137628566","https://openalex.org/W2162604396","https://openalex.org/W2213989452","https://openalex.org/W2294307095","https://openalex.org/W2397987272","https://openalex.org/W3146075203"],"related_works":["https://openalex.org/W4318144845","https://openalex.org/W2076584380","https://openalex.org/W1981930797","https://openalex.org/W33800742","https://openalex.org/W2944086638","https://openalex.org/W1546856751","https://openalex.org/W2322322215","https://openalex.org/W2782958832","https://openalex.org/W4297852701","https://openalex.org/W1539823645"],"abstract_inverted_index":{"This":[0,79],"paper":[1],"presents":[2],"a":[3,34,40,84],"language-independent":[4],"proof":[5,49],"system":[6,50],"for":[7,86],"reachability":[8,22],"properties":[9,27],"of":[10,67,91],"programs":[11],"written":[12],"in":[13,77,83],"non-deterministic":[14],"(e.g.,":[15],"concurrent)":[16],"languages,":[17],"referred":[18],"to":[19],"as":[20,52,89],"all-path":[21,29],"logic.":[23],"It":[24],"derives":[25],"partial-correctness":[26],"with":[28],"semantics":[30],"(a":[31],"state":[32],"satisfying":[33,39],"given":[35,41],"precondition":[36],"reaches":[37],"states":[38],"postcondition":[42],"on":[43],"all":[44],"terminating":[45],"execution":[46],"paths).":[47],"The":[48,71],"takes":[51],"axioms":[53],"any":[54],"unconditional":[55],"operational":[56],"semantics,":[57],"and":[58,63],"is":[59,81],"sound":[60],"(partially":[61],"correct)":[62],"(relatively)":[64],"complete,":[65],"independent":[66],"the":[68,92],"object":[69],"language.":[70],"soundness":[72],"has":[73],"also":[74],"been":[75],"mechanized":[76],"Coq.":[78],"approach":[80],"implemented":[82],"tool":[85],"semantics-based":[87],"verification":[88],"part":[90],"K":[93],"framework":[94],"(http://kframework.org)":[95]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-12T08:34:05.389933","created_date":"2025-10-10T00:00:00"}