{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T18:38:58Z","timestamp":1730313538910,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,7,17]]},"DOI":"10.1145\/1145735.1145738","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"10-19","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Uniform random sampling of traces in very large models"],"prefix":"10.1145","author":[{"given":"Alain","family":"Denise","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris-Sub, UMR CNRS"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-Claude","family":"Gaudel","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris-Sub, UMR CNRS"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandrine-Dominique","family":"Gouraud","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris-Sub, UMR CNRS"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Lassaigne","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris, UMR CNRS"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Peyronnet","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,7,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01047002"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/381473.381748"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008739929481"},{"key":"e_1_3_2_1_4_1","series-title":"Lecture Notes in Computer Science 1427","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/BFb0028774","volume-title":"Proceedings of the Tenth International Conference on Computer-Aided Verification (CAV)","author":"Alur R.","year":"1998","unstructured":"R. Alur , T. A. Henzinger , F. Y. C. Mang , S. Qadeer , S. K. Rajamani , and S. Tasiran . Mocha: Modularity in model checking . In Proceedings of the Tenth International Conference on Computer-Aided Verification (CAV) , Lecture Notes in Computer Science 1427 , Springer-Verlag , 1998 , pp. 521 -- 525 . R. Alur, T. A. Henzinger, F. Y. C. Mang, S. Qadeer, S. K. Rajamani, and S. Tasiran. Mocha: Modularity in model checking. In Proceedings of the Tenth International Conference on Computer-Aided Verification (CAV), Lecture Notes in Computer Science 1427, Springer-Verlag, 1998, pp. 521--525."},{"key":"e_1_3_2_1_5_1","unstructured":"APMC Website. http:\/\/apmc.berbiqui.org  APMC Website. http:\/\/apmc.berbiqui.org"},{"key":"e_1_3_2_1_6_1","volume-title":"Finite Transition Systems","author":"Arnold A.","year":"1994","unstructured":"A. Arnold , Finite Transition Systems , Prentice-Hall , 1994 . A. Arnold, Finite Transition Systems, Prentice-Hall, 1994."},{"key":"e_1_3_2_1_7_1","unstructured":"J.\n      Berstel\n     and \n      C.\n      Reutenauer Rational series and their languages Springer-Verlag 1987\n  .   J. Berstel and C. Reutenauer Rational series and their languages Springer-Verlag 1987."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"E.\n      Brinksma\n     and \n      J.\n      Tretmans\n  . \n  Testing Transition Systems an annotated bibliography\n  . volume \n  2067\n   of \n  LNCS pages \n  187\n  --\n  195 2001\n  .   E. Brinksma and J. Tretmans. Testing Transition Systems an annotated bibliography. volume 2067 of LNCS pages 187--195 2001.","DOI":"10.1007\/3-540-45510-8_9"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/646217.681857"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/RIVF.2006.1696417"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISSRE.2004.2"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.04.012"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90226-7"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/872023.872550"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31980-1_18"},{"key":"e_1_3_2_1_17_1","volume-title":"Electronic Notes in Theor. Comp. Sci.","author":"Guirado G.","year":"2005","unstructured":"G. Guirado , T. H\u00e9rault , R. Lassaigne and S. Peyronnet . Distribution, approximation and probabilistic model checking. 4th Parallel and Distributed Methods in Verification (PDMC 05) . Electronic Notes in Theor. Comp. Sci. , 2005 . G. Guirado, T. H\u00e9rault, R. Lassaigne and S. Peyronnet. Distribution, approximation and probabilistic model checking. 4th Parallel and Distributed Methods in Verification (PDMC 05). Electronic Notes in Theor. Comp. Sci., 2005."},{"key":"e_1_3_2_1_18_1","first-page":"73","article-title":"Approximate Probabilistic Model Checking. In Proceedings of Fifth International VMCAI'04","volume":"2937","author":"H\u00e9rault T.","year":"2004","unstructured":"T. H\u00e9rault , R. Lassaigne , F. Magniette and S. Peyronnet . Approximate Probabilistic Model Checking. In Proceedings of Fifth International VMCAI'04 , LNCS , 2937 : 73 -- 84 , 2004 . T. H\u00e9rault, R. Lassaigne, F. Magniette and S. Peyronnet. Approximate Probabilistic Model Checking. In Proceedings of Fifth International VMCAI'04, LNCS, 2937:73--84, 2004.","journal-title":"LNCS"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212044"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/329626.329630"},{"key":"e_1_3_2_1_22_1","volume-title":"The Markov chain Monte Carlo method: an approach to approximate counting and integration. Approximation Algorithms for NP-hard Problems","author":"Jerrum M.","year":"1996","unstructured":"M. Jerrum and A. Sinclair . The Markov chain Monte Carlo method: an approach to approximate counting and integration. Approximation Algorithms for NP-hard Problems , D. S. Hochbaum ed., PWS Publishing , Boston , 1996 . M. Jerrum and A. Sinclair. The Markov chain Monte Carlo method: an approach to approximate counting and integration. Approximation Algorithms for NP-hard Problems, D. S. Hochbaum ed., PWS Publishing, Boston, 1996."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(89)90038-2"},{"key":"e_1_3_2_1_24_1","series-title":"LNCS","first-page":"52","volume-title":"Proc. TACAS'02","author":"Kwiatkowska M.","year":"2002","unstructured":"M. Kwiatkowska , G. Norman and D. Parker . Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach . In Proc. TACAS'02 , volume 2280 of LNCS , pages 52 -- 66 , Springer-Verlag . April 2002 . M. Kwiatkowska, G. Norman and D. Parker. Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach. In Proc. TACAS'02, volume 2280 of LNCS, pages 52--66, Springer-Verlag. April 2002."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.05.031"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.494307"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.533956"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/647763.735518"},{"key":"e_1_3_2_1_29_1","unstructured":"PRISM Website. http:\/\/cs.bham.ac.uk\/~dxp\/prism  PRISM Website. http:\/\/cs.bham.ac.uk\/~dxp\/prism"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081180.1081193"},{"key":"e_1_3_2_1_31_1","series-title":"ENTCS","volume-title":"Proc. of Parallel and Distributed Model Checking (PDMC'03)","author":"Sivaraj H.","year":"2003","unstructured":"H. Sivaraj and G. Gopalakrishnan . Random walk based heuristic algorithms for distributed memory model checking . In Proc. of Parallel and Distributed Model Checking (PDMC'03) , volume 89 of ENTCS , 2003 . H. Sivaraj and G. Gopalakrishnan. Random walk based heuristic algorithms for distributed memory model checking. In Proc. of Parallel and Distributed Model Checking (PDMC'03), volume 89 of ENTCS, 2003."},{"key":"e_1_3_2_1_32_1","unstructured":"N. M. Thi\u00e9ry. Mupad-combinat algebraic combinatorics package for MUPAD. http:\/\/mupad-combinat.sourceforge.net\/.  N. M. Thi\u00e9ry. Mupad-combinat algebraic combinatorics package for MUPAD. http:\/\/mupad-combinat.sourceforge.net\/."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/75247.75276"}],"event":{"name":"ISSTA06: International Symposium on Software Testing and Analysis 2006","acronym":"ISSTA06","location":"Portland Maine"},"container-title":["Proceedings of the 1st international workshop on Random testing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1145735.1145738","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T22:37:03Z","timestamp":1673735823000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1145735.1145738"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,17]]},"references-count":32,"alternative-id":["10.1145\/1145735.1145738","10.1145\/1145735"],"URL":"https:\/\/doi.org\/10.1145\/1145735.1145738","relation":{},"subject":[],"published":{"date-parts":[[2006,7,17]]},"assertion":[{"value":"2006-07-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}