A calculus for the random generation of labelled combinatorial structures
Theoretical Computer Science
Fast probabilistic modeling for combinatorial optimization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Dynamically discovering likely program invariants to support program evolution
Proceedings of the 21st international conference on Software engineering
IEEE Transactions on Pattern Analysis and Machine Intelligence
Finite-time Analysis of the Multiarmed Bandit Problem
Machine Learning
Toward Optimal Active Learning through Sampling Estimation of Error Reduction
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Stochastic attribute-value grammars
Computational Linguistics
Testing, Optimizaton, and Games
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
A Generic Method for Statistical Testing
ISSRE '04 Proceedings of the 15th International Symposium on Software Reliability Engineering
Prediction, Learning, and Games
Prediction, Learning, and Games
Statistical debugging: simultaneous identification of multiple bugs
ICML '06 Proceedings of the 23rd international conference on Machine learning
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Software testing by active learning for commercial games
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
On prediction using variable order Markov models
Journal of Artificial Intelligence Research
Languages as hyperplanes: grammatical inference with string kernels
ECML'06 Proceedings of the 17th European conference on Machine Learning
Bandit based monte-carlo planning
ECML'06 Proceedings of the 17th European conference on Machine Learning
Actively learning to verify safety for FIFO automata
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Mining past-time temporal rules from execution traces
WODA '08 Proceedings of the 2008 international workshop on dynamic analysis: held in conjunction with the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA 2008)
Non-redundant sequential rules-Theory and algorithm
Information Systems
Using machine learning to refine Category-Partition test specifications and test suites
Information and Software Technology
Structural statistical software testing with active learning in a graph
ILP'07 Proceedings of the 17th international conference on Inductive logic programming
Linking software testing results with a machine learning approach
Engineering Applications of Artificial Intelligence
A learning-based method for combining testing techniques
Proceedings of the 2013 International Conference on Software Engineering
| Hi-index | 0.00 |
Some Statistical Software Testing approaches rely on sampling the feasible paths in the control flow graph of the program; the difficulty comes from the tiny ratio of feasible paths. This paper presents an adaptive sampling mechanismcalled EXIST for Exploration/ eXploitation Inference for Software Testing, able to retrieve distinct feasible paths with high probability. EXIST proceeds by alternatively exploiting and updating a distribution on the set of program paths. An original representation of paths, accommodating long-range dependencies and data sparsity and based on extended Parikh maps, is proposed. Experimental validation on real-world and artificial problems demonstrates dramatic improvements compared to the state of the art.