Automatic Inference of Term Equivalence in Term Rewriting Systems

12 pages•Published: June 19, 2013

Abstract

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

Links:	https://easychair.org/publications/paper/5LqG
	https://doi.org/10.29007/qsmm

BibTeX entry

@inproceedings{SCSS2013:Automatic_Inference_Term_Equivalence,
  author    = {Marco Comini and Luca Torella},
  title     = {Automatic Inference of Term Equivalence in Term Rewriting Systems},
  booktitle = {SCSS 2013. 5th International Symposium on Symbolic Computation in Software Science},
  editor    = {Laura Kovacs and Temur Kutsia},
  series    = {EPiC Series in Computing},
  volume    = {15},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/5LqG},
  doi       = {10.29007/qsmm},
  pages     = {19-30},
  year      = {2013}}

Download PDF Open PDF in browser