{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:29:28Z","timestamp":1725701368683},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642333071"},{"type":"electronic","value":"9783642333088"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33308-8_22","type":"book-chapter","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T17:33:52Z","timestamp":1346520832000},"page":"267-274","source":"Crossref","is-referenced-by-count":0,"title":["Generating Test Data Using Symbolic Execution: Challenges with Floating Point Data Types"],"prefix":"10.1007","author":[{"given":"Justinas","family":"Prelgauskas","sequence":"first","affiliation":[]},{"given":"Eduardas","family":"Bareisa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Anand, S., Godefroid, P., Tillmann, N.: Demand-driven compositional symbolic execution, pp. 367\u2013381. Springer (2008)","DOI":"10.1007\/978-3-540-78800-3_28"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-71209-1_12","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Anand","year":"2007","unstructured":"Anand, S., P\u0103s\u0103reanu, C.S., Visser, W.: JPF\u2013SE: A Symbolic Execution Extension to Java PathFinder. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 134\u2013138. Springer, Heidelberg (2007)"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Arcuri, A.: Full theoretical runtime analysis of alternating variable method on the triangle classification problem, pp. 113\u2013121. IEEE (2009)","DOI":"10.1109\/SSBSE.2009.16"},{"key":"22_CR4","unstructured":"Barei\u0161a, E., Jusas, V., Motiej\u016bnas, K., \u0160einauskas, R.: Defining Random Search Termination Conditions. Electronics and Electrical Engineering\u00a02(66), 26\u201331"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Cadar, C., Ganesh, V., Pawlowski, P.M., Dill, D.L., Engler, D.R.: EXE: automatically generating inputs of death. ACM Transactions on Information and System Security (TISSEC)\u00a012(2), 10","DOI":"10.1145\/1455518.1455522"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Godefroid, P.: Compositional dynamic test generation. In: 34th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 47\u201354. ACM (2007)","DOI":"10.1145\/1190216.1190226"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Goldberg, D.: What every computer scientist should know about floating-point arithmetic. ACM Computing Surveys (CSUR)\u00a023(1), 5\u201348","DOI":"10.1145\/103162.103163"},{"key":"22_CR8","unstructured":"Kahan, W.: IEEE standard 754 for binary floating-point arithmetic. Lecture Notes on the Status of IEEE 754. 94720-91776"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"King, J.C.: Symbolic execution and program testing. Commun. ACM\u00a019(7), 385\u2013394","DOI":"10.1145\/360248.360252"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-16573-3_11","volume-title":"Testing Software and Systems","author":"K. Lakhotia","year":"2010","unstructured":"Lakhotia, K., Tillmann, N., Harman, M., de Halleux, J.: FloPSy - Search-Based Floating Point Constraint Solving for Symbolic Execution. In: Petrenko, A., Sim\u00e3o, A., Maldonado, J.C. (eds.) ICTSS 2010. LNCS, vol.\u00a06435, pp. 142\u2013157. Springer, Heidelberg (2010)"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Misevi\u010dius, A.: Generation of grey patterns using an improved genetic evolutionary algorithm: some new results. Information Technology and Control\u00a040(4), 330\u2013343","DOI":"10.5755\/j01.itc.40.4.983"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Mor\u00e9, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Transactions on Mathematical Software (TOMS)\u00a07(1), 17\u201341","DOI":"10.1145\/355934.355936"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Sen, K., Marinov, D., Agha, G.: CUTE: A concolic unit testing engine for C, pp. 263\u2013272. ACM (2005)","DOI":"10.21236\/ADA482657"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-642-20398-5_26","volume-title":"NASA Formal Methods","author":"M. Souza","year":"2011","unstructured":"Souza, M., Borges, M., d\u2019Amorim, M., P\u0103s\u0103reanu, C.S.: CORAL: Solving Complex Constraints for Symbolic PathFinder. In: Bobaru, M., Havelund, K., Holzmann, G.J., Joshi, R. (eds.) NFM 2011. LNCS, vol.\u00a06617, pp. 359\u2013374. Springer, Heidelberg (2011)"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Tillmann, N., De Halleux, J.: Pex\u2013white box test generation for .net. Tests and Proofs, 134\u2013153","DOI":"10.1007\/978-3-540-79124-9_10"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Vanoverberghe, D., Piessens, F.: Theoretical aspects of compositional symbolic execution. In: Fundamental Approaches to Software Engineering, pp. 247\u2013261","DOI":"10.1007\/978-3-642-19811-3_18"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Wegener, J., Baresel, A., Sthamer, H.: Evolutionary test environment for automatic structural testing. Information and Software Technology\u00a043(14), 841\u2013854","DOI":"10.1016\/S0950-5849(01)00190-2"}],"container-title":["Communications in Computer and Information Science","Information and Software Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33308-8_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:04:08Z","timestamp":1620115448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33308-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642333071","9783642333088"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33308-8_22","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2012]]}}}