{"id":"https://openalex.org/W2339866832","doi":"https://doi.org/10.23638/lmcs-13(1:12)2017","title":"Reachability Analysis of Innermost Rewriting","display_name":"Reachability Analysis of Innermost Rewriting","publication_year":2017,"publication_date":"2017-03-22","ids":{"openalex":"https://openalex.org/W2339866832","doi":"https://doi.org/10.23638/lmcs-13(1:12)2017","mag":"2339866832"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-13(1:12)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(1:12)2017","pdf_url":"https://lmcs.episciences.org/3211/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":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/3211/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040486548","display_name":"Thomas Genet","orcid":null},"institutions":[{"id":"https://openalex.org/I2802519937","display_name":"Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires","ror":"https://ror.org/00myn0z94","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I205703379","https://openalex.org/I2802204017","https://openalex.org/I2802519937","https://openalex.org/I28221208","https://openalex.org/I4210127572","https://openalex.org/I4210159245","https://openalex.org/I56067802"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Thomas Genet","raw_affiliation_strings":["IRISA , Campus de Beaulieu , 35042 Rennes Cedex , France","Software certification with semantic analysis"],"affiliations":[{"raw_affiliation_string":"IRISA , Campus de Beaulieu , 35042 Rennes Cedex , France","institution_ids":["https://openalex.org/I2802519937"]},{"raw_affiliation_string":"Software certification with semantic analysis","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030354807","display_name":"Yann Salmon","orcid":"https://orcid.org/0000-0003-4433-4021"},"institutions":[{"id":"https://openalex.org/I2802519937","display_name":"Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires","ror":"https://ror.org/00myn0z94","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I205703379","https://openalex.org/I2802204017","https://openalex.org/I2802519937","https://openalex.org/I28221208","https://openalex.org/I4210127572","https://openalex.org/I4210159245","https://openalex.org/I56067802"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Yann Salmon","raw_affiliation_strings":["IRISA , Campus de Beaulieu , 35042 Rennes Cedex , France","Software certification with semantic analysis"],"affiliations":[{"raw_affiliation_string":"IRISA , Campus de Beaulieu , 35042 Rennes Cedex , France","institution_ids":["https://openalex.org/I2802519937"]},{"raw_affiliation_string":"Software certification with semantic analysis","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040486548"],"corresponding_institution_ids":["https://openalex.org/I2802519937"],"apc_list":null,"apc_paid":null,"fwci":1.0101,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.81666057,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"Volume 13, Issue 1","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10260","display_name":"Software Engineering Research","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10260","display_name":"Software Engineering Research","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.9995999932289124,"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.9341524243354797},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8458168506622314},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7918514013290405},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.5535109639167786},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.553037166595459},{"id":"https://openalex.org/keywords/lazy-evaluation","display_name":"Lazy evaluation","score":0.5483798980712891},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.503518283367157},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5017561912536621},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.492969274520874},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.48769649863243103},{"id":"https://openalex.org/keywords/static-analysis","display_name":"Static analysis","score":0.4687856435775757},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4512469172477722},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.4234342873096466},{"id":"https://openalex.org/keywords/type-inference","display_name":"Type inference","score":0.41777825355529785},{"id":"https://openalex.org/keywords/grammar","display_name":"Grammar","score":0.41476088762283325},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3695998787879944},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1852492392063141},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16604173183441162}],"concepts":[{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.9341524243354797},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8458168506622314},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7918514013290405},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.5535109639167786},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.553037166595459},{"id":"https://openalex.org/C128099668","wikidata":"https://www.wikidata.org/wiki/Q573952","display_name":"Lazy evaluation","level":3,"score":0.5483798980712891},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.503518283367157},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5017561912536621},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.492969274520874},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.48769649863243103},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.4687856435775757},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4512469172477722},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.4234342873096466},{"id":"https://openalex.org/C198370458","wikidata":"https://www.wikidata.org/wiki/Q586459","display_name":"Type inference","level":3,"score":0.41777825355529785},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.41476088762283325},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3695998787879944},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1852492392063141},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16604173183441162},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23638/lmcs-13(1:12)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(1:12)2017","pdf_url":"https://lmcs.episciences.org/3211/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:1610.05156","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1610.05156","pdf_url":"https://arxiv.org/pdf/1610.05156","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":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:ed5439a0fc904d55999da6f3e342e487","is_oa":true,"landing_page_url":"https://doaj.org/article/ed5439a0fc904d55999da6f3e342e487","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 13, Issue 1 (2017)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.23638/lmcs-13(1:12)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(1:12)2017","pdf_url":"https://lmcs.episciences.org/3211/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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2339866832.pdf","grobid_xml":"https://content.openalex.org/works/W2339866832.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3019138974","https://openalex.org/W2867457158","https://openalex.org/W2095136535","https://openalex.org/W2105831091","https://openalex.org/W2765641823","https://openalex.org/W2531621405","https://openalex.org/W1966091859","https://openalex.org/W2569392808","https://openalex.org/W2105232714","https://openalex.org/W1967226206"],"abstract_inverted_index":{"We":[0,97,111],"consider":[1],"the":[2,9,59,69,78,86,94,101,120,129,137,147,156],"problem":[3,24],"of":[4,11,34,58,88,149],"inferring":[5],"a":[6,12,16],"grammar":[7,17,48],"describing":[8,18],"output":[10],"functional":[13,35,153],"program":[14,60],"given":[15],"its":[19],"input.":[20],"Solutions":[21],"to":[22,54,83,119],"this":[23,44,74],"are":[25,51],"helpful":[26],"for":[27,42,128,152],"detecting":[28],"bugs":[29],"or":[30],"proving":[31],"safety":[32],"properties":[33],"programs,":[36],"and":[37,106,122],"several":[38],"rewriting":[39,92],"tools":[40],"exist":[41],"solving":[43],"problem.":[45],"However,":[46],"known":[47],"inference":[49],"techniques":[50],"not":[52],"able":[53],"take":[55],"evaluation":[56,70,158],"strategies":[57],"into":[61],"account.":[62],"This":[63],"yields":[64],"very":[65],"imprecise":[66],"results":[67,115],"when":[68],"strategy":[71],"matters.":[72],"In":[73],"work,":[75],"we":[76],"adapt":[77],"Tree":[79],"Automata":[80],"Completion":[81],"algorithm":[82],"approximate":[84],"accurately":[85],"set":[87],"terms":[89],"reachable":[90],"by":[91],"under":[93],"innermost":[95,109,124,131],"strategy.":[96,159],"formally":[98],"prove":[99],"that":[100,113,143],"proposed":[102],"technique":[103],"is":[104],"sound":[105],"precise":[107],"w.r.t.":[108],"rewriting.":[110],"show":[112,142],"those":[114],"can":[116],"be":[117],"extended":[118],"leftmost":[121],"rightmost":[123],"case.":[125],"The":[126],"algorithms":[127],"general":[130],"case":[132],"have":[133],"been":[134],"implemented":[135],"in":[136],"Timbuk":[138],"reachability":[139],"tool.":[140],"Experiments":[141],"it":[144],"noticeably":[145],"improves":[146],"accuracy":[148],"static":[150],"analysis":[151],"programs":[154],"using":[155],"call-by-value":[157]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}