Anti-Pattern Matching Modulo - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2007

Anti-Pattern Matching Modulo


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 modulo an arbitrary equational theory E, and we study the specific and practically very useful case of associativity, possibly with a unity (AU). To this end, based on the syntacticness of associativity, we present a rule-based associative matching algorithm, and we extend it to AU. This algorithm is then used to solve AU antipattern matching problems. This allows us to be generic enough so that for instance, the AllDiff standard predicate of constraint programming becomes simply expressible in this framework. AU anti-patterns are implemented in the Tom language and we show some examples of their usage.
Fichier principal
Vignette du fichier
apModulo.pdf (323.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00129421 , version 1 (07-02-2007)
inria-00129421 , version 2 (15-06-2007)
inria-00129421 , version 3 (30-10-2007)


  • HAL Id : inria-00129421 , version 3


Claude Kirchner, Radu Kopetz, Pierre-Etienne Moreau. Anti-Pattern Matching Modulo. [Research Report] 2007, pp.21. ⟨inria-00129421v3⟩
119 View
108 Download


Gmail Facebook X LinkedIn More