Anti-Pattern Matching Modulo

Claude Kirchner 1 Radu Kopetz 1 Pierre-Etienne Moreau 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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 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.
Type de document :
Rapport
[Research Report] 2007, pp.21
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00129421
Contributeur : Radu Kopetz <>
Soumis le : mardi 30 octobre 2007 - 15:28:16
Dernière modification le : jeudi 11 janvier 2018 - 06:19:58
Document(s) archivé(s) le : jeudi 23 septembre 2010 - 16:17:08

Fichier

apModulo.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00129421, version 3

Collections

Citation

Claude Kirchner, Radu Kopetz, Pierre-Etienne Moreau. Anti-Pattern Matching Modulo. [Research Report] 2007, pp.21. 〈inria-00129421v3〉

Partager

Métriques

Consultations de la notice

162

Téléchargements de fichiers

68