Skip to Main content Skip to Navigation

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.
Document type :
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Radu Kopetz Connect in order to contact the contributor
Submitted on : Tuesday, October 30, 2007 - 3:28:16 PM
Last modification on : Friday, February 4, 2022 - 3:23:17 AM
Long-term archiving on: : Thursday, September 23, 2010 - 4:17:08 PM


Files produced by the author(s)


  • HAL Id : inria-00129421, version 3



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



Record views


Files downloads