Liveness Verification in TRSs Using Tree Automata and Termination Analysis
Keywords:
Term rewriting systems, liveness properties, finite tree automata, terminationAbstract
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).Downloads
Download data is not yet available.
Downloads
Published
2012-01-26
How to Cite
Mousazadeh, M., Ladani, B. T., & Zantema, H. (2012). Liveness Verification in TRSs Using Tree Automata and Termination Analysis. Computing and Informatics, 29(3), 407–426. Retrieved from http://147.213.75.17/ojs/index.php/cai/article/view/91
Issue
Section
Articles