Anti-Pattern Matching

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 : It is quite appealing to base the description of pattern-based searches on positive as well as negative conditions. We would like for example to specify that we search for white cars that are not station wagons. To this end, we define the notion of anti-patterns and their semantics along with some of their properties. We then extend the classical notion of matching between patterns and ground terms to matching between anti-patterns and ground terms. We provide a rule-based algorithm that finds the solutions to such problems and prove its correctness and completeness. Anti-pattern matching is by nature different from disunification and quite interestingly the anti-pattern matching problem is unitary. Therefore the concept is appropriate to ground a powerful extension to pattern-based programming languages and we show how this is used to extend the expressiveness and usability of the Tom language.
Document type :
Conference papers
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/inria-00129419
Contributor : Radu Kopetz <>
Submitted on : Wednesday, February 7, 2007 - 12:13:24 PM
Last modification on : Thursday, January 11, 2018 - 6:19:58 AM
Long-term archiving on : Tuesday, April 6, 2010 - 11:20:27 PM

File

antiPatternsEsop2007.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Claude Kirchner, Radu Kopetz, Pierre-Etienne Moreau. Anti-Pattern Matching. 16th European Symposium on Programming - ESOP'07, Mar 2007, Braga, Portugal. pp.110-124, ⟨10.1007/978-3-540-71316-6_9⟩. ⟨inria-00129419⟩

Share

Metrics

Record views

254

Files downloads

168