Skip to Main content Skip to Navigation
New interface
Conference papers

Anti-Pattern Matching Modulo

Claude Kirchner 1, 2 Radu Kopetz 1 Pierre-Etienne Moreau 1, * 
* Corresponding author
1 PAREO - Formal islands: foundations and applications
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 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 metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Pierre-Etienne Moreau Connect in order to contact the contributor
Submitted on : Friday, November 7, 2008 - 5:18:02 PM
Last modification on : Wednesday, February 2, 2022 - 3:51:27 PM
Long-term archiving on: : Tuesday, October 9, 2012 - 3:10:31 PM


Publisher files allowed on an open archive




Claude Kirchner, Radu Kopetz, Pierre-Etienne Moreau. Anti-Pattern Matching Modulo. Second International Conference on Language and Automata Theory and Applications - LATA 2008, Mar 2008, Tarragone, Italy. pp.275-286, ⟨10.1007/978-3-540-88282-4_26⟩. ⟨inria-00337722⟩



Record views


Files downloads