This paper introduces some novel features of Maude 2.6 focusing on the variants of a term. Given an equational theory (Sigma,Ax cup E), the E,Ax-variants of a term t are understood as the set of all pairs consisting of a substitution sigma and the E,Ax-canonical form of t sigma. The equational theory (Ax cup E ) has the finite variant property if there is a finite set of most general variants. We have added support in Maude 2.6 for: (i) order-sorted unification modulo associativity, commutativity and identity, (ii) variant generation, (iii) order-sorted unification modulo finite variant theories, and (iv) narrowing-based symbolic reachability modulo finite variant theories. We also explain how these features have a number of interesting ap...
This paper introduces Presto, a symbolic partial evaluator for Maude's rewriting logic theories that...
Variants and the finite variant property were originally introduced about a decade ago by Hurbert Co...
For an unconditional equational theory (Sigma, E) whose oriented equations (E) over arrow are conflu...
This paper introduces some novel features of Maude 2.7. We have added support for: (i) built-in orde...
[EN] This paper introduces GLINTS, a graphical tool for exploring variant narrowing computations in ...
AbstractNarrowing is a well-known complete procedure for equational E-unification when E can be deco...
Narrowing is a well-known complete procedure for equational E-unification when E can be decomposed a...
Concurrent functional languages that are endowed with symbolic reasoning capabilities such as Maude ...
[EN] Equational unification of two terms consists of finding a substitution that, when applied to bo...
Automated reasoning modulo an equational theory E is a fundamental technique in many applications. I...
Automated reasoning modulo an equational theory E is a fundamental technique in many applications. I...
AbstractAutomated reasoning modulo an equational theory E is a fundamental technique in many applica...
There is a growing interest in formal methods and tools to analyze cryptographic protocols modulo al...
International audienceWe investigate the unification problemin theories defined by rewrite systems w...
An equational theory decomposed into a set B of equational axioms and a set \Delta of rewrite rules ...
This paper introduces Presto, a symbolic partial evaluator for Maude's rewriting logic theories that...
Variants and the finite variant property were originally introduced about a decade ago by Hurbert Co...
For an unconditional equational theory (Sigma, E) whose oriented equations (E) over arrow are conflu...
This paper introduces some novel features of Maude 2.7. We have added support for: (i) built-in orde...
[EN] This paper introduces GLINTS, a graphical tool for exploring variant narrowing computations in ...
AbstractNarrowing is a well-known complete procedure for equational E-unification when E can be deco...
Narrowing is a well-known complete procedure for equational E-unification when E can be decomposed a...
Concurrent functional languages that are endowed with symbolic reasoning capabilities such as Maude ...
[EN] Equational unification of two terms consists of finding a substitution that, when applied to bo...
Automated reasoning modulo an equational theory E is a fundamental technique in many applications. I...
Automated reasoning modulo an equational theory E is a fundamental technique in many applications. I...
AbstractAutomated reasoning modulo an equational theory E is a fundamental technique in many applica...
There is a growing interest in formal methods and tools to analyze cryptographic protocols modulo al...
International audienceWe investigate the unification problemin theories defined by rewrite systems w...
An equational theory decomposed into a set B of equational axioms and a set \Delta of rewrite rules ...
This paper introduces Presto, a symbolic partial evaluator for Maude's rewriting logic theories that...
Variants and the finite variant property were originally introduced about a decade ago by Hurbert Co...
For an unconditional equational theory (Sigma, E) whose oriented equations (E) over arrow are conflu...