{"id":"https://openalex.org/W2157976170","doi":"https://doi.org/10.1145/2603088.2603112","title":"Senescent ground tree rewrite systems","display_name":"Senescent ground tree rewrite systems","publication_year":2014,"publication_date":"2014-07-14","ids":{"openalex":"https://openalex.org/W2157976170","doi":"https://doi.org/10.1145/2603088.2603112","mag":"2157976170"},"language":"en","primary_location":{"id":"doi:10.1145/2603088.2603112","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2603088.2603112","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083664380","display_name":"Matthew Hague","orcid":"https://orcid.org/0000-0003-4913-3800"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"M. Hague","raw_affiliation_strings":["Royal Holloway University of London"],"affiliations":[{"raw_affiliation_string":"Royal Holloway University of London","institution_ids":["https://openalex.org/I184558857"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5083664380"],"corresponding_institution_ids":["https://openalex.org/I184558857"],"apc_list":null,"apc_paid":null,"fwci":2.5591,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.90124027,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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.9994000196456909,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9994000196456909,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9925000071525574,"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.8766781091690063},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.8378576040267944},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.7034450173377991},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.6093984246253967},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5807094573974609},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5588029026985168},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5442133545875549},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5185309648513794},{"id":"https://openalex.org/keywords/scope","display_name":"Scope (computer science)","score":0.4397633373737335},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39433079957962036},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34341442584991455},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3246453106403351},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.30390772223472595},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26145318150520325},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17771080136299133},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08857807517051697}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8766781091690063},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8378576040267944},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.7034450173377991},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.6093984246253967},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5807094573974609},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5588029026985168},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5442133545875549},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5185309648513794},{"id":"https://openalex.org/C2778012447","wikidata":"https://www.wikidata.org/wiki/Q1034415","display_name":"Scope (computer science)","level":2,"score":0.4397633373737335},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39433079957962036},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34341442584991455},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3246453106403351},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.30390772223472595},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26145318150520325},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17771080136299133},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08857807517051697},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2603088.2603112","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2603088.2603112","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2744107465","display_name":null,"funder_award_id":"EP/K009907/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3109984129","display_name":"Verification of Concurrent and Higher-Order Recursive Programs","funder_award_id":"EP/K009907/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W153330214","https://openalex.org/W174890186","https://openalex.org/W180544992","https://openalex.org/W1493367105","https://openalex.org/W1508360721","https://openalex.org/W1524248088","https://openalex.org/W1546101340","https://openalex.org/W1589224558","https://openalex.org/W1603445208","https://openalex.org/W1691700263","https://openalex.org/W1755598144","https://openalex.org/W1765692042","https://openalex.org/W1939061729","https://openalex.org/W1964874178","https://openalex.org/W1984256985","https://openalex.org/W1987814265","https://openalex.org/W1998717089","https://openalex.org/W2031276295","https://openalex.org/W2035561341","https://openalex.org/W2044772623","https://openalex.org/W2047447540","https://openalex.org/W2074674105","https://openalex.org/W2080263276","https://openalex.org/W2084570980","https://openalex.org/W2100532597","https://openalex.org/W2101936540","https://openalex.org/W2101989701","https://openalex.org/W2105614525","https://openalex.org/W2107398710","https://openalex.org/W2109893633","https://openalex.org/W2114132089","https://openalex.org/W2117331553","https://openalex.org/W2122095746","https://openalex.org/W2145494365","https://openalex.org/W2156751710","https://openalex.org/W2165546792","https://openalex.org/W2176814623","https://openalex.org/W2256242912","https://openalex.org/W2770491639","https://openalex.org/W2805677007","https://openalex.org/W2806135590","https://openalex.org/W3005728772","https://openalex.org/W3102787008","https://openalex.org/W3125224867","https://openalex.org/W4214848047","https://openalex.org/W4244831445","https://openalex.org/W4300724769","https://openalex.org/W6646284625","https://openalex.org/W6649995522","https://openalex.org/W6793064532"],"related_works":["https://openalex.org/W2020140696","https://openalex.org/W2506850889","https://openalex.org/W2584984136","https://openalex.org/W2084570980","https://openalex.org/W2110957508","https://openalex.org/W2591956186","https://openalex.org/W2387511021","https://openalex.org/W1553002193","https://openalex.org/W1805200712","https://openalex.org/W2522627362"],"abstract_inverted_index":{"Ground":[0,30],"Tree":[1,31],"Rewrite":[2,32],"Systems":[3],"with":[4,43],"State":[5],"are":[6,35],"known":[7],"to":[8,81],"have":[9,90],"an":[10,59,91],"undecidable":[11],"control":[12,65,93],"state":[13,44,66,94],"reachability":[14,95,98],"problem.":[15,96],"Taking":[16],"inspiration":[17],"from":[18,83],"the":[19,49],"recent":[20],"introduction":[21],"of":[22,38,48,64,99,103],"scope-bounded":[23,72],"multi-stack":[24,73],"push-down":[25],"systems,":[26,75],"we":[27,76],"define":[28],"Senescent":[29],"Systems.":[33],"These":[34],"a":[36,60,100],"restriction":[37],"ground":[39],"tree":[40,50],"rewrite":[41],"systems":[42,89],"such":[45],"that":[46,87],"nodes":[47],"may":[51],"no":[52],"longer":[53],"be":[54],"rewritten":[55],"after":[56],"having":[57],"witnessed":[58],"priori":[61],"fixed":[62],"number":[63],"changes.":[67],"As":[68],"well":[69],"as":[70],"generalising":[71],"pushdown":[74],"show":[77],"---":[78,86],"via":[79],"reductions":[80],"and":[82],"reset":[84],"Petri-nets":[85],"these":[88],"Ackermann-complete":[92],"However,":[97],"regular":[101],"set":[102],"trees":[104],"remains":[105],"undecidable.":[106]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}