Liveness Verification in TRSs Using Tree Automata and Termination Analysis

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).

[1]  Terese.  Term rewriting systems , 2003, Cambridge tracts in theoretical computer science.

[2]  Jürgen Giesl,et al.  Automatic Termination Proofs in the Dependency Pair Framework , 2006, IJCAR.

[3]  Bowen Alpern,et al.  Defining Liveness , 1984, Inf. Process. Lett..

[4]  Hans Zantema,et al.  Simulating liveness by reduction strategies , 2003, WRS.

[5]  Valérie Viet Triem Tong,et al.  Reachability Analysis over Term Rewriting Systems , 2004, Journal of Automated Reasoning.

[6]  Enno Ohlebusch,et al.  Term Rewriting Systems , 2002 .

[7]  Jörg Endrullis,et al.  Local Termination , 2009, RTA.

[8]  Hans Zantema,et al.  Termination of Term Rewriting: Interpretation and Type Elimination , 1994, J. Symb. Comput..

[9]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[10]  Hans Zantema,et al.  Proving Liveness with Fairness Using Rewriting , 2005, FroCoS.

[11]  José Meseguer,et al.  Termination of just/fair computations in term rewriting , 2008, Inf. Comput..

[12]  Leslie Lamport,et al.  Proving the Correctness of Multiprocess Programs , 1977, IEEE Transactions on Software Engineering.

[13]  Hans Zantema,et al.  Liveness in Rewriting , 2003, RTA.

[14]  Thomas Genet,et al.  Rewriting for Cryptographic Protocol Verification , 2000, CADE.

[15]  Pierre Lescanne,et al.  Termination of Rewriting Systems by Polynomial Interpretations and Its Implementation , 1987, Sci. Comput. Program..

[16]  Alfons Geser,et al.  Relative Termination , 1990 .