Download PDFOpen PDF in browserAutomatic Inference of Term Equivalence in Term Rewriting Systems12 pages•Published: June 19, 2013AbstractIn this paper we propose a parametric technique to automatically infer algebraic property-oriented specifications from Term Rewriting Systems. Namely, given the source code of a TRS we infer a specification which consists of a set of most general equations relating terms that rewrite, for all possible instantiations, to the same set of normal forms.The semantic-based inference method that we propose can cope with non-constructor-based TRSs, and considers non-ground terms. Particular emphasis is posed to avoid the generation of “redundant” equations that can be a logical consequence of other ones. To experiment on the validity of our proposal we have considered an instance of the method employing a novel (condensed) semantics for left-linear TRSs and we have implemented a “proof of concept” prototype in Haskell which is available online. Keyphrases: property oriented specifications, semantics based inference methods, term rewriting systems In: Laura Kovacs and Temur Kutsia (editors). SCSS 2013. 5th International Symposium on Symbolic Computation in Software Science, vol 15, pages 19-30.
|