Coverage-biased Random Exploration of Models

Electronic Notes in Theoretical Computer Science

Volumn 220, Issue 1, 2008, Pages 3-14

  Gaudel, Marie Claude ^a   Denise, Alain ^a   Gouraud, Sandrine Dominique ^a   Lassaigne, Richard ^b   Oudinet, Johan ^b   Peyronnet, Sylvain ^b  

^a Laboratoire Interdisciplinaire des Sciences du Numérique   (France)

^b UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

D.2.4 Software Program Verification; D.2.5 Testing and Debugging; G.2.1 Combinatorics

Indexed keywords

PROGRAM DEBUGGING; RANDOM PROCESSES; SOFTWARE TESTING; VERIFICATION;

COVERAGE CRITERIA; D.2.4 SOFTWARE/PROGRAM VERIFICATION; D.2.5 TESTING AND DEBUGGING; G.2.1 COMBINATORICS; GLOBAL ANALYSIS; IRREGULAR TOPOLOGY; RANDOM-WALK METHOD; UNDERLYING GRAPHS;

TOPOLOGY;

EID: 56849112277     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.11.002     Document Type: Article

References (13)

1. Arnold A. Finite Transition Systems (1994), Prentice-Hall
2. Denise A., Gaudel M.-C., and Gouraud S.-D. A Generic Method for Statistical Testing. 15th IEEE Int. Symp. on Software Reliability Engineering (ISSRE) (2004) 25-34
3. Denise A., Gaudel M.-C., Gouraud S.-D., Lassaigne R., and Peyronnet S. Uniform Random Sampling of Traces in very Large Models. 1st Int. ACM Workshop on Random Testing (2006), ACM Press 10-19
4. Ph. Flajolet and R. Sedgewick. Analytic combinatorics: functional equations, rational, and algebraic functions, INRIA Research Report RR4103, January 2001, 98 pages. Part of the book project "Analytic Combinatorics". URL: http://algo.inria.fr/flajolet/Publications/books.html
5. Flajolet Ph., Zimmermann P., and Van Cutsem B. A Calculus for the Random Generation of Labelled Combinatorial Structures. Theoretical Computer Science 132 (1994) 1-35
6. Gouraud S.-D. "Utilisation des Structures Combinatoires pour le Test Statistique". PhD thesis, Université Paris-Sud 11, Orsay, 2004
7. Gouraud S.-D., Denise A., Gaudel M.-C., and Marre B. A new way of automating statistical testing methods. IEEE Int. Conf. on Automated Software Engineering (ASE) (2001) 5-12
8. Jerrum M., and Sinclair A. The Markov chain Monte Carlo method: an approach to approximate counting integration. In: Hochbaum D.S. (Ed). Approximation Algorithms for NP-hard Problems (1996), PWS Publishing, Boston
9. Oudinet J. "Uniform random walks in concurrent models". Master thesis, Université de Paris-Sud, 2007 URL: http://www.lri.fr/~oudinet/publis/07/mthesis.pdf
10. Oudinet J. Uniform random walks in very large models. 2nd Int. ACM workshop on Random testing (2007), ACM Press 26-29
11. Thévenod-Fosse P., and Waeselynck H. An investigation of software statistical testing. Journal of Software Testing, Verification and Reliability 1 2 (1991) 5-26
12. Thiéry N.M. Mupad-combinat algebraic combinatorics package for MUPAD. URL: http://mupad-combinat.sourceforge.net/
13. van der Hoeven J. Relax, but dont be too lazy. Journal of Symbolic Computation 34 6 (2002) 479-542