{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T12:54:46Z","timestamp":1725627286570},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642245794"},{"type":"electronic","value":"9783642245800"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24580-0_1","type":"book-chapter","created":{"date-parts":[[2011,11,2]],"date-time":"2011-11-02T10:21:42Z","timestamp":1320229302000},"page":"1-8","source":"Crossref","is-referenced-by-count":2,"title":["Counting for Random Testing"],"prefix":"10.1007","author":[{"given":"Marie-Claude","family":"Gaudel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/BF01047002","volume":"4","author":"D. Aldous","year":"1991","unstructured":"Aldous, D.: An introduction to covering problems for random walks on graphs. J. Theoret Probab.\u00a04, 197\u2013211 (1991)","journal-title":"J. Theoret Probab."},{"key":"1_CR2","volume-title":"Finite Transition Systems","author":"A. Arnold","year":"1994","unstructured":"Arnold, A.: Finite Transition Systems. Prentice-Hall, Englewood Cliffs (1994)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Denise, A., Gaudel, M.C., Gouraud, S.D.: A generic method for statistical testing. In: IEEE Int. Symp. on Software Reliability Engineering (ISSRE), pp. 25\u201334 (2004)","DOI":"10.1109\/ISSRE.2004.2"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Denise, A., Gaudel, M.C., Gouraud, S.D., Lassaigne, R., Peyronnet, S.: Uniform random sampling of traces in very large models. In: 1st International ACM Workshop on Random Testing, pp. 10\u201319 (July 2006)","DOI":"10.1145\/1145735.1145738"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Denise, A., Gaudel, M.C., Gouraud, S.D., Lassaigne, R., Oudinet, J., Peyronnet, S.: Coverage-biased random exploration of large models and application to testing. STTT, International Journal on Software Tools for Technology Transfer Online First, 26 pages (2011)","DOI":"10.1007\/s10009-011-0190-1"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0304-3975(98)00323-5","volume":"218","author":"A. Denise","year":"1999","unstructured":"Denise, A., Zimmermann, P.: Uniform random generation of decomposable structures using floating-point arithmetic. Theoretical Computer Science\u00a0218, 233\u2013248 (1999)","journal-title":"Theoretical Computer Science"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(94)90226-7","volume":"132","author":"P. Flajolet","year":"1994","unstructured":"Flajolet, P., Zimmermann, P., Cutsem, B.V.: A calculus for the random generation of labelled combinatorial structures. Theoretical Computer Science\u00a0132, 1\u201335 (1994)","journal-title":"Theoretical Computer Science"},{"key":"1_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801655","volume-title":"Analytic Combinatorics","author":"P. Flajolet","year":"2009","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Gaudel, M.C., Denise, A., Gouraud, S.D., Lassaigne, R., Oudinet, J., Peyronnet, S.: Coverage-biased random exploration of large models. In: 4th ETAPS Workshop on Model Based Testing. Electronic Notes in Theoretical Computer Science, vol.\u00a0220(1), 10, pp. 3\u201314 (2008), invited lecture","DOI":"10.1016\/j.entcs.2008.11.002"},{"issue":"4","key":"1_CR10","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(95)00025-8","volume":"54","author":"M. Goldwurm","year":"1995","unstructured":"Goldwurm, M.: Random generation of words in an algebraic language in linear binary space. Information Processing Letters\u00a054(4), 229\u2013233 (1995)","journal-title":"Information Processing Letters"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Gouraud, S.D., Denise, A., Gaudel, M.C., Marre, B.: A new way of automating statistical testing methods. In: IEEE International Conference on Automated Software Engineering (ASE), pp. 5\u201312 (2001)","DOI":"10.1109\/ASE.2001.989785"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-540-31980-1_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R. Grosu","year":"2005","unstructured":"Grosu, R., Smolka, S.A.: Monte-Carlo Model Checking. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 271\u2013286. Springer, Heidelberg (2005)"},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/0097-3165(79)90023-2","volume":"27","author":"A. Nijenhuis","year":"1979","unstructured":"Nijenhuis, A., Wilf, H.S.: The enumeration of connected graphs and linked diagrams. J. Comb. Theory, Ser. A\u00a027(3), 356\u2013359 (1979)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Oudinet, J.: Uniform random walks in very large models. In: RT 2007: Proceedings of the 2nd International Workshop on Random Testing, pp. 26\u201329. ACM Press, Atlanta (2007)","DOI":"10.1145\/1292414.1292422"},{"key":"1_CR15","unstructured":"Oudinet, J.: Approches combinatoires pour le test statistique \u00e0 grande \u00e9chelle. Tech. rep., LRI, Universit\u00e9 Paris-Sud 11, Ph. D. thesis, 118 pages (November 2010), http:\/\/www.lri.fr\/~oudinet\/en\/research.html#publications"},{"key":"1_CR16","unstructured":"Oudinet, J.: Random exploration of models. Tech. Rep. 1534, LRI, Universit\u00e9 Paris-Sud XI, 15 pages (June 2010)"},{"key":"1_CR17","unstructured":"Oudinet, J., Denise, A., Gaudel, M.C.: A new dichotomic algorithm for the uniform random generation of words in regular languages. In: Conference on random and exhaustive generation of combinatorial objects (GASCom), Montreal, Canada, 10 pages (September 2010) (to appear)"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-642-19811-3_10","volume-title":"Fundamental Approaches to Software Engineering","author":"J. Oudinet","year":"2011","unstructured":"Oudinet, J., Denise, A., Gaudel, M.C., Lassaigne, R., Peyronnet, S.: Uniform Monte-Carlo model checking. In: Giannakopoulou, D., Orejas, F. (eds.) FASE 2011. LNCS, vol.\u00a06603, pp. 127\u2013140. Springer, Heidelberg (2011)"},{"key":"1_CR19","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0001-8708(77)80046-7","volume":"24","author":"H. Wilf","year":"1977","unstructured":"Wilf, H.: A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects. Advances in Mathematics\u00a024, 281\u2013291 (1977)","journal-title":"Advances in Mathematics"}],"container-title":["Lecture Notes in Computer Science","Testing Software and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24580-0_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:16:53Z","timestamp":1606187813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24580-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642245794","9783642245800"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24580-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}