G. Arévalo, J. R. Falleri, M. Huchard, and C. Nebut, Building Abstractions in Class Models: Formal Concept Analysis in a Model-Driven Approach, Int. Conf. on MOdel Driven Engineering Languages and Systems, volume LNCS 4199, pp.513-527, 2006.
DOI : 10.1007/11880240_36

T. [. Agrawal, A. N. Imielinski, . Swamias94-]-r, R. Agrawal, and . Srikant, Mining association rules between sets of items in large databases Fast algorithms for mining association rules, Int. Conf. on Management of Data Int. Conf. Very Large Data Bases, pp.487-499, 1993.

S. Brin, R. Motwani, J. D. Ullman, and S. Tsur, Dynamic itemset counting and implication rules for market basket data, Proc. Int. Conf. on Management of Data, pp.255-264, 1997.

P. Cellier, S. Ferré, O. Ridoux, and M. Ducassé, A parameterized algorithm for exploring concept lattices Locating causes of program failures, Int. Conf. on Formal Concept Analysis Int. Conf. on Software Engineering, pp.342-351, 2005.

T. Denmat, M. Ducassé, O. [. Ridoux, P. Godin, and . Valtchev, Data mining and cross-checking of execution traces, Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering , ASE '05, pp.304-323, 1999.
DOI : 10.1145/1101908.1101979

URL : https://hal.archives-ouvertes.fr/hal-00756834

. J. Hrs-+-00-]-m, G. Harrold, K. Rothermel, R. Sayre, L. Wu et al., An empirical investigation of the relationship between spectra differences and regression faults, Softw. Test., Verif. Reliab, vol.10, issue.3, pp.171-194, 2000.

J. A. Jones, M. J. Harrold, and J. T. Stasko, Visualization of test information to assist fault localization, Proceedings of the 24th international conference on Software engineering , ICSE '02, pp.467-477, 2002.
DOI : 10.1145/581396.581397

A. X. Naik, A. Zheng, M. I. Aiken, and . Jordan, Scalable statistical bug isolation, Conf. on Programming Language Design and Implementation, pp.15-26, 2005.

]. C. Lyf-+-05, X. Liu, L. Yan, J. Fei, S. P. Han et al., Sober: statistical modelbased bug localization, European Software Engineering Conf. held jointly with Int. Symp. on Foundations of Software Engineering, 2005.

N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, Discovering Frequent Closed Itemsets for Association Rules, Int. Conf. on Database Theory, pp.398-416, 1999.
DOI : 10.1007/3-540-49257-7_25

URL : https://hal.archives-ouvertes.fr/hal-00467747

L. John, . [. Pfaltz, A. Petit, and . Gotlieb, Using concept lattices to uncover causal dependencies in software Uniform selection of feasible paths as a stochastic constraint problem, Formal Concept Analysis Int. Conf. on Quality Software, IEEE, pp.233-247, 2006.

M. Renieris and S. P. Reiss, Fault localization with nearest neighbor queries Concept lattices in software analysis, Int. Conf. on Automated Software Engineering. IEEE, 2003. [Sne05] G. Snelting Formal Concept Analysis, volume LNCS 3626, pp.272-287, 2005.

T. Tilley, R. Cole, P. Becker, and P. Eklund, A Survey of Formal Concept Analysis Support for Software Engineering Activities, Formal Concept Analysis, volume LNCS 3626, 2005.
DOI : 10.1007/11528784_13