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 previous work, we have extended the notion of term to the one of anti-term that may contain complement symbols. Matching such anti-terms against terms has the nice property of being unitary. 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 anti-pattern 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00176055
Contributor : Evelyne Contejean <>
Submitted on : Tuesday, October 2, 2007 - 11:26:39 AM
Last modification on : Thursday, January 11, 2018 - 6:19:58 AM
Long-term archiving on : Thursday, September 27, 2012 - 1:15:31 PM

File

antiPatternsModulo.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00176055, version 1

Collections

Citation

Claude Kirchner, Radu Kopetz, Pierre-Etienne Moreau. Anti-Pattern Matching Modulo. 21th International Workshop on Unification - UNIF'07, 2007, Paris, France. ⟨inria-00176055⟩

Share

Metrics

Record views

200

Files downloads

142