{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:20:26Z","timestamp":1726410026757},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319929934"},{"type":"electronic","value":"9783319929941"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-92994-1_2","type":"book-chapter","created":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T10:48:51Z","timestamp":1527850131000},"page":"27-43","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Approximation-Based Approach for the Random Exploration of Large Models"],"prefix":"10.1007","author":[{"given":"Julien","family":"Bernard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Cyrille","family":"H\u00e9am","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Kouchnarenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,2]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38916-0_1","volume-title":"Tests and Proofs","author":"BK Aichernig","year":"2013","unstructured":"Aichernig, B.K., J\u00f6bstl, E., Kegele, M.: Incremental refinement checking for test case generation. In: Veanes, M., Vigan\u00f2, L. (eds.) TAP 2013. LNCS, vol. 7942, pp. 1\u201319. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38916-0_1"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.infsof.2016.04.003","volume":"81","author":"ADB Alberto","year":"2017","unstructured":"Alberto, A.D.B., Cavalcanti, A., Gaudel, M.-C., Sim\u00e3o, A.: Formal mutation testing for circus. Inf. Softw. Technol. 81, 131\u2013153 (2017)","journal-title":"Inf. Softw. Technol."},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/11817963_9","volume-title":"Computer Aided Verification","author":"S Bardin","year":"2006","unstructured":"Bardin, S., Leroux, J., Point, G.: FAST extended release. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 63\u201366. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817963_9"},{"issue":"1\u20132","key":"2_CR4","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/s00453-010-9446-5","volume":"62","author":"O Bernardi","year":"2012","unstructured":"Bernardi, O., Gim\u00e9nez, O.: A linear algorithm for the random sampling from regular languages. Algorithmica 62(1\u20132), 130\u2013145 (2012)","journal-title":"Algorithmica"},{"key":"2_CR5","first-page":"309","volume":"37","author":"I-J Bienaym\u00e9","year":"1853","unstructured":"Bienaym\u00e9, I.-J.: Consid\u00e9rations \u00e0 l\u2019appui de la d\u00e9couverte de Laplace. Comptes Rendus de l\u2019Acad\u00e9mie des Sciences 37, 309\u2013324 (1853)","journal-title":"Comptes Rendus de l\u2019Acad\u00e9mie des Sciences"},{"key":"2_CR6","unstructured":"Carayol, A., Nicaud, C.: Distribution of the number of accessible states in a random deterministic automaton. In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, Paris, France, 29th February\u20133rd March 2012. LIPIcs, pp. 194\u2013205 (2012)"},{"key":"2_CR7","first-page":"177","volume":"12","author":"P Chebishev","year":"1867","unstructured":"Chebishev, P.: Des valeurs moyennes. Journal de math\u00e9matiques pures et appliqu\u00e9es 12, 177\u2013184 (1867)","journal-title":"Journal de math\u00e9matiques pures et appliqu\u00e9es"},{"issue":"5\u20137","key":"2_CR8","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1002\/stvr.1531","volume":"25","author":"F Dadeau","year":"2015","unstructured":"Dadeau, F., H\u00e9am, P.-C., Kheddam, R., Maatoug, G., Rusinowitch, M.: Model-based mutation testing from security protocols in HLPSL. Softw. Test. Verif. Reliab. 25(5\u20137), 684\u2013711 (2015)","journal-title":"Softw. Test. Verif. Reliab."},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10009-011-0190-1","volume":"14","author":"A Denise","year":"2012","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 14(1), 73\u201393 (2012)","journal-title":"STTT"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Dreyfus, A., H\u00e9am, P.-C., Kouchnarenko, O.: Random grammar-based testing for covering all non-terminals. In: Sixth IEEE International Conference on Software Testing, Verification and Validation, ICST 2013 Workshops Proceedings, Luxembourg, 18\u201322 March 2013, pp. 210\u2013215. IEEE Computer Society (2013)","DOI":"10.1109\/ICSTW.2013.32"},{"issue":"8","key":"2_CR11","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/stvr.1526","volume":"24","author":"A Dreyfus","year":"2014","unstructured":"Dreyfus, A., H\u00e9am, P.-C., Kouchnarenko, O., Masson, C.: A random testing approach using pushdown automata. Softw. Test. Verif. Reliab. 24(8), 656\u2013683 (2014)","journal-title":"Softw. Test. Verif. Reliab."},{"key":"2_CR12","unstructured":"Duran, J.W., Ntafos, S.C.: A report on random testing. In: Proceedings of the 5th International Conference on Software Engineering, San Diego, California, USA, 9\u201312 March 1981, pp. 179\u2013183. IEEE Computer Society (1981)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Godefroid, P., Klarlund, N., Sen, K.: DART: directed automated random testing. In: Proceedings of the ACM SIGPLAN 2005 Conference on Programming Language Design and Implementation, Chicago, IL, USA, 12\u201315 June 2005, pp. 213\u2013223. ACM (2005)","DOI":"10.1145\/1065010.1065036"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Groce, A., Joshi, R.: Random testing and model checking: building a common framework for nondeterministic exploration. In: 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), WODA 2008, Seattle, Washington, USA, 21 July 2008, pp. 22\u201328. ACM (2008)","DOI":"10.1145\/1401827.1401833"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-21768-5_10","volume-title":"Tests and Proofs","author":"P-C H\u00e9am","year":"2011","unstructured":"H\u00e9am, P.-C., Masson, C.: A random testing approach using pushdown automata. In: Gogolla, M., Wolff, B. (eds.) TAP 2011. LNCS, vol. 6706, pp. 119\u2013133. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21768-5_10"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"H\u00e9am, P.-C., Nicaud, C.: Seed: an easy-to-use random generator of recursive data structures for testing. In: Fourth IEEE International Conference on Software Testing, Verification and Validation, ICST 2011, Berlin, Germany, 21\u201325 March 2011, pp. 60\u201369. IEEE Computer Society (2011)","DOI":"10.1109\/ICST.2011.31"},{"issue":"301","key":"2_CR17","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1109\/5.533956","volume":"84","author":"D Lee","year":"1996","unstructured":"Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines-a survey. Proc. IEEE 84, 1090\u20131123 (1996)","journal-title":"Proc. IEEE"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Lima, B., Faria, J.P.: A model-based approach for product testing and certification in digital ecosystems. In: Ninth IEEE International Conference on Software Testing, Verification and Validation Workshops, ICST Workshops 2016, Chicago, IL, USA, 11\u201315 April 2016, pp. 199\u2013208. IEEE Computer Society (2016)","DOI":"10.1109\/ICSTW.2016.22"},{"key":"2_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing - Randomized Algorithms and Probabilistic Analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing - Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/11558569_18","volume-title":"Quality of Software Architectures and Software Quality","author":"C Oriat","year":"2005","unstructured":"Oriat, C.: Jartege: a tool for random generation of unit tests for Java classes. In: Reussner, R., Mayer, J., Stafford, J.A., Overhage, S., Becker, S., Schroeder, P.J. (eds.) QoSA\/SOQUA - 2005. LNCS, vol. 3712, pp. 242\u2013256. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11558569_18"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.tcs.2012.07.025","volume":"502","author":"J Oudinet","year":"2013","unstructured":"Oudinet, J., Denise, A., Gaudel, M.-C.: A new dichotomic algorithm for the uniform random generation of words in regular languages. Theor. Comput. Sci. 502, 165\u2013176 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Tang, J., Cui, X., Zhao, Z., Guo, S., Xu, X.-S., Hu, C., Ban, T., Mao, B.: NIVAnalyzer: a tool for automatically detecting and verifying next-intent vulnerabilities in android apps. In: 2017 IEEE International Conference on Software Testing, Verification and Validation, ICST 2017, Tokyo, Japan, 13\u201317 March 2017, pp. 492\u2013499. IEEE Computer Society (2017)","DOI":"10.1109\/ICST.2017.56"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Thummala, S., Offutt, J.: Using Petri nets to test concurrent behavior of web applications. In: Ninth IEEE International Conference on Software Testing, Verification and Validation Workshops, ICST Workshops 2016, Chicago, IL, USA, 11\u201315 April 2016, pp. 189\u2013198. IEEE Computer Society (2016)","DOI":"10.1109\/ICSTW.2016.15"},{"issue":"5","key":"2_CR25","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/stvr.456","volume":"22","author":"M Utting","year":"2012","unstructured":"Utting, M., Pretschner, A., Legeard, B.: A taxonomy of model-based testing approaches. Softw. Test. Verif. Reliab. 22(5), 297\u2013312 (2012)","journal-title":"Softw. Test. Verif. Reliab."},{"issue":"1","key":"2_CR26","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1002\/(SICI)1099-1689(199603)6:1<49::AID-STVR113>3.0.CO;2-O","volume":"6","author":"KS How Tai Wah","year":"1996","unstructured":"How Tai Wah, K.S.: Black-box testing: techniques for functional testing of software and systems. Softw. Test. Verif. Reliab. 6(1), 49\u201350 (1996). By Beizer, B. Wiley (1995) (book review)","journal-title":"Softw. Test. Verif. Reliab."},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Wang, C., Pastore, F., Briand, L.C.: System testing of timing requirements based on use cases and timed automata. In: 2017 IEEE International Conference on Software Testing, Verification and Validation, ICST 2017, Tokyo, Japan, 13\u201317 March 2017, pp. 299\u2013309. IEEE Computer Society (2017)","DOI":"10.1109\/ICST.2017.34"}],"container-title":["Lecture Notes in Computer Science","Tests and Proofs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92994-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,18]],"date-time":"2019-10-18T23:55:15Z","timestamp":1571442915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-92994-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319929934","9783319929941"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92994-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}