A machine learning approach for statistical software testing

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 2274-2279

  Baskiotis, Nicolas ^a   Sebag, Michèle ^a   Gaudel, Marie Claude ^a   Gouraud, Sandrine ^a  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SAMPLING; ARTIFICIAL PROBLEMS; CONTROL FLOW GRAPHS; EXPERIMENTAL VALIDATIONS; EXPLORATION/EXPLOITATION; LONG-RANGE DEPENDENCIES; MACHINE LEARNING APPROACHES; STATISTICAL SOFTWARE TESTING;

ARTIFICIAL INTELLIGENCE; DATA FLOW ANALYSIS; SOFTWARE TESTING;

SAMPLING;

EID: 84880898457     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. S. P. Abney. Stochastic attribute-value grammars. Computational Linguistics, 23(4):597-618, 1997.
2. P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47(2-3):235-256, 2002. (Pubitemid 34126111)
3. S. Baluja and S. Davies. Fast probabilistic modeling for combinatorial optimization. In AAAI/IAAI, pages 469-476, 1998.
4. N. Baskiotis, M. Sebag, M.-C. Gaudel, and S. Gouraud. Exploitation / exploration inference for hybrid statistical software testing. Technical report, LRI, Université Paris-Sud, http://www.lri.fr/~nbaskiot, 2006.
5. R. Begleiter, R. El-Yaniv, and G. Yona. On prediction using variable order markov models. JAIR, 22:385-421, 2004. (Pubitemid 41525891)
6. L. Bréhélin, O. Gascuel, and G. Caraux. Hidden markov models with patterns to learn boolean vector sequences and application to the built-in self-test for integrated circuits. IEEE Trans. Pattern Anal. Mach. Intell., 23(9):997-1008, 2001. (Pubitemid 32981618)
7. N. Cesa-Bianchi and G. Lugosi. Prediction, learning, and games. Cambridge University Press, 2006.
8. A. Clark, C. C. Florencio, and C.Watkins. Languages as hyperplanes: Grammatical inference with string kernels. In ECML, to appear, 2006.
9. S. Dasgupta. Coarse sample complexity bounds for active learning. In NIPS, pages 235-242, 2005.
10. A. Denise, M.-C. Gaudel, and S.-D. Gouraud. A generic method for statistical testing. In ISSRE, pages 25-34, 2004.
11. M. D. Ernst, J. Cockrell, W. G. Griswold, and D. Notkin. Dynamically discovering likely program invariants to support program evolution. In ICSE, pages 213-224, 1999.
12. P. Flajolet, P. Zimmermann, and B. Van Cutsem. A calculus for the random generation of labelled combinatorial structures. Theor. Comput. Sci., 132(2):1-35, 1994.
13. S.-D. Gouraud. Statistical Software Testing based on Structural Combinatorics. PhD thesis, LRI, Université Paris-Sud, 2004.
14. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
15. L. Kocsis and C. Szepesvári. Bandit based Monte-Carlo planning. In ECML, pages 282-293, 2006.
16. I. Rish, R. Das, G. Tesauro, and J. Kephart. Ecml-pkdd workshop automatic computing: a new challenge for machine learning. 2006.
17. N. Roy and A. McCallum. Toward optimal active learning through sampling estimation of error reduction. In ICML, pages 441-448, 2001.
18. F. Torre. Boosting correct least general generalizations. Technical Report GRAppA Report 0104, Université Lille III, 2004.
19. A. Vardhan, K. Sen, M. Viswanathan, and G. Agha. Actively learning to verify safety for FIFO automata. In FSTTCS, pages 494-505, 2004.
20. G. Xiao, F. Southey, R. C. Holte, and D. F. Wilkinson. Software testing by active learning for commercial games. In AAAI, pages 898-903, 2005.
21. M. Yannakakis. Testing, optimization, and games. In ICALP, pages 28-45, 2004.
22. A. X. Zheng, M. I. Jordan, B. Liblit, M. N., and A. Aiken. Statistical debugging: simultaneous identification of multiple bugs. In ICML, pages 1105-1112, 2006.