TRSynth: a tool for automatic inference of term equivalence in left-linear term rewriting systems

Authors:
Marco Comini;Luca Torella
Affiliations:
University of Udine, Udine, Italy;University of Siena, Siena, Italy
Venue:
PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation
Year:
2013

Citing 7
Cited 0

A Specifier's Introduction to Formal Methods

Computer
Software engineering: principles and practice

Software engineering: principles and practice
Mining specifications

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Discovering Documentation for Java Container Classes

IEEE Transactions on Software Engineering
Synthesizing intensional behavior models by graph transformation

ICSE '09 Proceedings of the 31st International Conference on Software Engineering
A property based specification formalism classification

Journal of Systems and Software
Automatic synthesis of specifications for first order curry programs

Proceedings of the 14th symposium on Principles and practice of declarative programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a "proof of concept" prototype which is an instance of a semantics-based 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 equations relating (nested) terms (operation calls) that rewrite, for all possible instantiations, to the same set of values. In the the TRS formalism there are several additional issues which arise with respect to the (first order) functional programming case, because variables are admitted in queries and nonconstructor-based rules are allowed. The glass-box semantic-based inference method that we propose can cope with these issues.