Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Liveness Verification in TRSs Using Tree Automata and Termination Analysis

In: Computing and Informatics, vol. 29, no. 3
M. Mousazadeh - B.t. Ladani - H. Zantema

Details:

Year, pages: 2010, 407 - 426
Keywords:
Term rewriting systems, liveness properties, finite tree automata, termination
About article:
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).
How to cite:
ISO 690:
Mousazadeh, M., Ladani, B., Zantema, H. 2010. Liveness Verification in TRSs Using Tree Automata and Termination Analysis. In Computing and Informatics, vol. 29, no.3, pp. 407-426. 1335-9150.

APA:
Mousazadeh, M., Ladani, B., Zantema, H. (2010). Liveness Verification in TRSs Using Tree Automata and Termination Analysis. Computing and Informatics, 29(3), 407-426. 1335-9150.