Possessive quantifiers are a way to prevent the regex engine from trying all permutations. This is primarily useful for performance reasons. You can also use possessive quantifiers to eliminate certain matches.
M. Anselmo, D. Giammarresi, and M. Madonia. Theoretical Computer Science, 340 (2):
408 - 431(2005)The Art of Theory <xocs:full-name>The Art of Theory</xocs:full-name>.
M. Vidal, A. da Silva, E. de Moura, and J. Cavalcanti. Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, page 292--299. New York, NY, USA, ACM, (2006)
D. Calvanese, T. Eiter, and M. Ortiz. Proceedings of the 21st International Joint Conference on Artificial Intelligence. AAAI Press/IJCAI, 2009., (July 2009)
C. Chang, R. Stachowitz, and J. Combs. Tools for Artificial Intelligence, 1990.,Proceedings of the 2nd International
IEEE Conference on, (November 1990)
B. Ross. Proceedings of the Genetic and Evolutionary
Computation Conference (GECCO-2001), page 120--128. San Francisco, California, USA, Morgan Kaufmann, (7-11 July 2001)
B. Ross. 6th IASTED International Conference, Artificial
Intelligence and Soft Computing, ASC 2002, The Banff Centre for Conferences, Box 1020, 107 Tunnel
Mountain Drive, Banff, Alberta, T0L 0C0, Canada, (17-19 July 2002)
A. Heddad, M. Brameier, and R. MacCallum. Applications of Evolutionary Computing,
EvoWorkshops2004: EvoBIO, EvoCOMNET, EvoHOT,
EvoIASP, EvoMUSART, EvoSTOC, volume 3005 of LNCS, page 31--40. Coimbra, Portugal, Springer Verlag, (5-7 April 2004)
A. Cetinkaya. Genetic and Evolutionary Computation Conference
(GECCO2007) workshop program, page 2643--2646. London, United Kingdom, ACM Press, (7-11 July 2007)