Liveness verification in trss using tree automata and termination analysis

Autor:	Mousazadeh, B.T., Ladani, H., Zantema, H.
Přispěvatelé:	Formal System Analysis
Předmět:	Term rewriting systems liveness properties finite tree automata termination Data Science GeneralLiterature_REFERENCE(e.g. dictionaries encyclopedias glossaries)
Zdroj:	Scopus-Elsevier Computing and Informatics, 29, 3, pp. 407-426 COMPUTING AND INFORMATICS; Vol 29, No 3 (2010): Computing and Informatics; 407-426 Computing and Informatics, 29(3), 407-426. Slovak Academy of Sciences Computing and Informatics, 29, 407-426
ISSN:	1335-9150 0232-0274
Popis:	This paper considers verification of the liveness property Live(R, I, G) for a term rewrite system (TRS) R, where I (Initial states) and G (Good states) are two sets of ground terms represented by finite tree automata. Considering I and G, we transform R to a new TRS R' such that termination of R' proves the property Live(R, I, G).
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2866110b340290585ee32f86ccccd433 http://www.scopus.com/inward/record.url?eid=2-s2.0-77956952512&partnerID=MN8TOARS Zobrazit plný text záznamu