In this paper we propose a method to automatically infer algebraic property-oriented specications from Term Rewriting Systems. Namely, having three semantics with suitable properties, given the source code of a TRS we infer a specication which consists of a set of most general equations relating terms that rewrite, for all possible instantiations, to the same set of constructor terms. The semantic-based inference method that we propose can cope with non-constructorbased TRSs, and considers non-ground terms. Particular emphasis is put on avoiding the generation of \redundant" equations that can be a logical consequence of other ones.
['Marco Comini', 'Luca Torella']
Automatic Inference of Term Equivalence in Term Rewriting Systems.