{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T06:37:45Z","timestamp":1648622265914},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T00:00:00Z","timestamp":1228089600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":1701,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1016\/j.entcs.2008.11.002","type":"journal-article","created":{"date-parts":[[2008,12,4]],"date-time":"2008-12-04T12:28:12Z","timestamp":1228393692000},"page":"3-14","source":"Crossref","is-referenced-by-count":7,"title":["Coverage-biased Random Exploration of Models"],"prefix":"10.1016","volume":"220","author":[{"given":"Marie-Claude","family":"Gaudel","sequence":"first","affiliation":[]},{"given":"Alain","family":"Denise","sequence":"additional","affiliation":[]},{"given":"Sandrine-Dominique","family":"Gouraud","sequence":"additional","affiliation":[]},{"given":"Richard","family":"Lassaigne","sequence":"additional","affiliation":[]},{"given":"Johan","family":"Oudinet","sequence":"additional","affiliation":[]},{"given":"Sylvain","family":"Peyronnet","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.entcs.2008.11.002_bib001","series-title":"Finite Transition Systems","author":"Arnold","year":"1994"},{"key":"10.1016\/j.entcs.2008.11.002_bib002","series-title":"15th IEEE Int. Symp. on Software Reliability Engineering (ISSRE)","first-page":"25","article-title":"A Generic Method for Statistical Testing","author":"Denise","year":"2004"},{"key":"10.1016\/j.entcs.2008.11.002_bib003","series-title":"1st Int. ACM Workshop on Random Testing","first-page":"10","article-title":"Uniform Random Sampling of Traces in very Large Models","author":"Denise","year":"2006"},{"key":"10.1016\/j.entcs.2008.11.002_bib004","unstructured":"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 \u201cAnalytic Combinatorics\u201d. URL: http:\/\/algo.inria.fr\/flajolet\/Publications\/books.html"},{"key":"10.1016\/j.entcs.2008.11.002_bib005","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(94)90226-7","article-title":"A Calculus for the Random Generation of Labelled Combinatorial Structures","volume":"132","author":"Flajolet","year":"1994","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2008.11.002_bib006","unstructured":"Gouraud S.-D. \u201cUtilisation des Structures Combinatoires pour le Test Statistique\u201d. PhD thesis, Universit\u00e9 Paris-Sud 11, Orsay, 2004"},{"key":"10.1016\/j.entcs.2008.11.002_bib007","series-title":"IEEE Int. Conf. on Automated Software Engineering (ASE)","first-page":"5","article-title":"A new way of automating statistical testing methods","author":"Gouraud","year":"2001"},{"key":"10.1016\/j.entcs.2008.11.002_bib008","series-title":"Approximation Algorithms for NP-hard Problems","article-title":"The Markov chain Monte Carlo method: an approach to approximate counting integration","author":"Jerrum","year":"1996"},{"key":"10.1016\/j.entcs.2008.11.002_bib009","doi-asserted-by":"crossref","unstructured":"Oudinet J. \u201cUniform random walks in concurrent models\u201d. Master thesis, Universit\u00e9 de Paris-Sud, 2007 URL: http:\/\/www.lri.fr\/~oudinet\/publis\/07\/mthesis.pdf","DOI":"10.1145\/1292414.1292422"},{"key":"10.1016\/j.entcs.2008.11.002_bib010","series-title":"2nd Int. ACM workshop on Random testing","first-page":"26","article-title":"Uniform random walks in very large models","author":"Oudinet","year":"2007"},{"issue":"2","key":"10.1016\/j.entcs.2008.11.002_bib011","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1002\/stvr.4370010203","article-title":"An investigation of software statistical testing","volume":"1","author":"Th\u00e9venod-Fosse","year":"1991","journal-title":"Journal of Software Testing, Verification and Reliability"},{"key":"10.1016\/j.entcs.2008.11.002_bib012","unstructured":"Thi\u00e9ry N.M. Mupad-combinat algebraic combinatorics package for MUPAD. URL: http:\/\/mupad-combinat.sourceforge.net\/"},{"issue":"6","key":"10.1016\/j.entcs.2008.11.002_bib013","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1006\/jsco.2002.0562","article-title":"Relax, but dont be too lazy","volume":"34","author":"van der Hoeven","year":"2002","journal-title":"Journal of Symbolic Computation"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066108004398?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066108004398?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T00:15:36Z","timestamp":1557965736000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066108004398"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["S1571066108004398"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2008.11.002","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2008,12]]}}}