论文信息 - A Verification Technique Using Term Rewriting Systems and Abstract Interpretation

A Verification Technique Using Term Rewriting Systems and Abstract Interpretation

Verifying the safety property of a transition system given by a term rewriting system is an undecidable problem. In this paper, we give an abstraction for the problem which is automatically generated from a given TRS by using abstract interpretation. Then we show that there are some cases in which the problem can be decided. Also we show a new decidable subclass of term rewriting systems which effectively preserves recognizability.

Toshinori Takai | Toshinori Takai

[1] David Monniaux,et al. Abstracting cryptographic protocols with tree automata , 1999, Sci. Comput. Program..

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

[3] Patrick Cousot,et al. Abstract interpretation , 1996, CSUR.

[4] Hubert Comon. Equational Formulas in Order-Sorted Algebras , 1990 .

[5] Hiroyuki Seki,et al. Layered Transducing Term Rewriting System and Its Recognizability Preserving Property , 2002, RTA.

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

[7] Hiroyuki Seki,et al. Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability , 2000, RTA.

[8] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[9] Kai Salomaa. Decidability of Confluence and Termination of Monadic Term Rewriting Systems , 1991, RTA.

[10] Tobias Nipkow,et al. Term rewriting and all that , 1998 .

[11] Sándor Vágvölgyi,et al. Linear Generalized Semi-Monadic Rewrite Systems Effectively Preserve Recognizability , 1998, Theor. Comput. Sci..