Anti-pattern Matching Modulo

Authors:
Claude Kirchner;Radu Kopetz;Pierre-Etienne Moreau
Affiliations:
INRIA Bordeaux --- Sud Ouest,;INRIA Nancy --- Grand Est,;INRIA Nancy --- Grand Est,
Venue:
Language and Automata Theory and Applications
Year:
2008

Citing 9
Cited 2

Combining matching algorithms: The regular case

Journal of Symbolic Computation
A new method for undecidability proofs of first order theories

Journal of Symbolic Computation
Combining decision algorithms for matching in the union of disjoint equational theories

Information and Computation
Normalized rewriting: an alternative to rewriting modulo a set of equations

Journal of Symbolic Computation
Constraint solving on terms

Constraints in computational logics
The ASF+SDF Meta-environment: A Component-Based Language Development Environment

CC '01 Proceedings of the 10th International Conference on Compiler Construction
Associative matching for linear terms

Associative matching for linear terms
Anti-pattern matching

ESOP'07 Proceedings of the 16th European conference on Programming
Tom: piggybacking rewriting on java

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications

Constraint based strategies

WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
Connectors as designs: Modeling, refinement and test case generation

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. In a recent work, the notion of term was extended to the one of anti-term, i.e.terms that may contain complement symbols.Here we generalize the syntactic anti-pattern matching to anti-pattern matching moduloan arbitrary equational theory ε, and we study the specific and practically very useful case of associativity, possibly with a unity ($\mathcal{AU}$). To this end, based on the syntacticnessof associativity, we present a rule-based associative matching algorithm, and we extend it to $\mathcal{AU}$. This algorithm is then used to solve $\mathcal{AU}$ anti-pattern matching problems. This allows us to be generic enough so that for instance, the AllDiffstandard predicate of constraint programming becomes simply expressible in this framework. $\mathcal{AU}$ anti-patterns are implemented in the Tomlanguage and we show some examples of their usage.