Inspecting Maude variants withGLINTS
- 24 August 2017
- journal article
- conference paper
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 17 (5-6) , 689-707
Abstract
This paper introducesGLINTS, a graphical tool for exploring variant narrowing computations in Maude. The most recent version of Maude, version 2.7.1, provides quite sophisticated unification features, including order-sorted equational unification for convergent theories modulo axioms such as associativity, commutativity, and identity. This novel equational unification relies on built-in generation of the set ofvariantsof a termt, i.e., the canonical form oftσ for a computed substitution σ. Variant generation relies on a novel narrowing strategy calledfolding variant narrowingthat opens up new applications in formal reasoning, theorem proving, testing, protocol analysis, and model checking, especially when the theory satisfies thefinite variant property, i.e., there is a finite number of most general variants for every term in the theory. However, variant narrowing computations can be extremely involved and are simply presented in text format by Maude, often being too heavy to be debugged or even understood. TheGLINTSsystem provides support for (i) determining whether a given theory satisfies the finite variant property, (ii) thoroughly exploring variant narrowing computations, (iii) automatic checking of nodeembeddingandclosednessmodulo axioms, and (iv) querying and inspecting selected parts of the variant trees.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Assertion-based analysis via slicing withABETS(system description)Theory and Practice of Logic Programming, 2016
- Functional Logic Programming: From Theory to Curry2013
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theoriesThe Journal of Logic and Algebraic Programming, 2012
- Folding variant narrowing and optimal variant terminationThe Journal of Logic and Algebraic Programming, 2012
- The Finite Variant Property: How to Get Rid of Some Algebraic Properties2005
- A unifying view of functional and logic program specializationACM Computing Surveys, 1998
- Partial evaluation of functional logic programsACM Transactions on Programming Languages and Systems, 1998
- A comparative revisitation of some program transformation techniques1996
- Tabled evaluation with delaying for general logic programsJournal of the ACM, 1996
- Conditional rewriting logic as a unified model of concurrencyTheoretical Computer Science, 1992