Inspecting Maude Variants with GLINTS

07/18/2017
by   María Alpuente, et al.
0

This paper introduces GLINTS, 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 (ACU). This novel equational unification relies on built-in generation of the set of 'variants' of a term t, i.e., the canonical form of t σ for a computed substitution σ. Variant generation relies on a novel narrowing strategy called 'folding variant narrowing' that opens up new applications in formal reasoning, theorem proving, testing, protocol analysis, and model checking, especially when the theory satisfies the 'finite 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. The GLINTS system provides support for (i) determining whether a given theory satisfies the finite variant property, (ii) thoroughly exploring variant narrowing computations, (iii) automatic checking of node 'embedding' and 'closedness' modulo axioms, and (iv) querying and inspecting selected parts of the variant trees. This paper is under consideration for acceptance in TPLP.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2019

Most General Variant Unifiers

Equational unification of two terms consists of finding a substitution t...
research
09/22/2020

Variant-based Equational Unification under Constructor Symbols

Equational unification of two terms consists of finding a substitution t...
research
12/19/2021

Symbolic Specialization of Rewriting Logic Theories with Presto

This paper introduces Presto, a symbolic partial evaluator for Maude's r...
research
07/25/2019

Symbolic Analysis of Maude Theories with Narval

Concurrent functional languages that are endowed with symbolic reasoning...
research
09/15/2017

Variant-Based Decidable Satisfiability in Initial Algebras with Predicates

Decision procedures can be either theory-specific, e.g., Presburger arit...
research
09/21/2017

Learning to Prove Safety over Parameterised Concurrent Systems (Full Version)

We revisit the classic problem of proving safety over parameterised conc...
research
10/01/2021

Relative Contagiousness of Emerging Virus Variants: An Analysis of SARS-CoV-2 Alpha and Delta Variants

We propose a simple dynamic model for estimating the relative contagious...

Please sign up or login with your details

Forgot password? Click here to reset