Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems 英文论文文献.docVIP

Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems Beno??t Boyer Thomas Genet Universit′e Rennes 1, France Universit′e Rennes 1, France Benoit.Boyer@irisa.fr Thomas.Genet@irisa.fr The tree automaton completion is an algorithm used for proving safety properties of systems that can be modeled by a term rewriting system. This representation and veri?cation technique works well for proving properties of in?nite systems like cryptographic protocols or more recently on Java Bytecode programs. This algorithm computes a tree automaton which represents a (regular) o