{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:24:12Z","timestamp":1725794652978},"publisher-location":"Cham","reference-count":49,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319073163"},{"type":"electronic","value":"9783319073170"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07317-0_7","type":"book-chapter","created":{"date-parts":[[2014,5,26]],"date-time":"2014-05-26T01:53:38Z","timestamp":1401069218000},"page":"263-309","source":"Crossref","is-referenced-by-count":9,"title":["Test Case Generation by Symbolic Execution: Basic Concepts, a CLP-Based Instance, and Actor-Based Concurrency"],"prefix":"10.1007","author":[{"given":"Elvira","family":"Albert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Puri","family":"Arenas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel","family":"G\u00f3mez-Zamalloa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose Miguel","family":"Rojas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Agha, G.A.: Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press, Cambridge (1986)","DOI":"10.7551\/mitpress\/1086.001.0001"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-540-71316-6_12","volume-title":"Programming Languages and Systems","author":"E. Albert","year":"2007","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Cost Analysis of Java Bytecode. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421, pp. 157\u2013172. Springer, Heidelberg (2007)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Albert, E., Caba\u00f1as, I., Flores-Montoya, A., G\u00f3mez-Zamalloa, M., Guti\u00e9rrez, S.: jPET: an Automatic Test-Case Generator for Java. In: WCRE 2011, pp. 441\u2013442. IEEE Computer Society (2011)","DOI":"10.1109\/WCRE.2011.67"},{"issue":"4-5","key":"7_CR4","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1017\/S1471068413000458","volume":"13","author":"E. Albert","year":"2013","unstructured":"Albert, E., de la Banda, M.G., G\u00f3mez-Zamalloa, M., Rojas, J.M., Stuckey, P.: A CLP Heap Solver for Test Case Generation. Theory and Practice of Logic Programming\u00a013(4-5), 721\u2013735 (2013)","journal-title":"Theory and Practice of Logic Programming"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-20551-4_7","volume-title":"Logic-Based Program Synthesis and Transformation","author":"E. Albert","year":"2011","unstructured":"Albert, E., G\u00f3mez-Zamalloa, M., Rojas, J.M., Puebla, G.: Compositional CLP-Based Test Data Generation for Imperative Languages. In: Alpuente, M. (ed.) LOPSTR 2010. LNCS, vol.\u00a06564, pp. 99\u2013116. Springer, Heidelberg (2011)"},{"issue":"8","key":"7_CR6","doi-asserted-by":"publisher","first-page":"1978","DOI":"10.1016\/j.jss.2013.02.061","volume":"86","author":"S. Anand","year":"2013","unstructured":"Anand, S., Burke, E.K., Chen, T.Y., Clark, J.A., Cohen, M.B., Grieskamp, W., Harman, M., Harrold, M.J., McMinn, P.: An orchestrated survey of methodologies for automated software test case generation. Journal of Systems and Software\u00a086(8), 1978\u20132001 (2013)","journal-title":"Journal of Systems and Software"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-540-78800-3_28","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Anand","year":"2008","unstructured":"Anand, S., Godefroid, P., Tillmann, N.: Demand-Driven Compositional Symbolic Execution. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 367\u2013381. Springer, Heidelberg (2008)"},{"key":"7_CR8","unstructured":"Andrews, G.R.: Concurrent Programming: Principles and Practice. Benjamin\/Cummings (1991)"},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1145\/2408776.2408795","volume":"56","author":"C. Cadar","year":"2013","unstructured":"Cadar, C., Sen, K.: Symbolic Execution for Software Testing: Three Decades Later. Commun. ACM\u00a056(2), 82\u201390 (2013)","journal-title":"Commun. ACM"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Cadar, C., Godefroid, P., Khurshid, S., P\u01ces\u01cereanu, C.S., Sen, K., Tillmann, N., Visser, W.: Symbolic Execution for Software Testing in Practice: Preliminary Assessment. In: ICSE 2011, pp. 1066\u20131071. ACM (2011)","DOI":"10.1145\/1985793.1985995"},{"issue":"3","key":"7_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1109\/TSE.1976.233817","volume":"2","author":"L.A. Clarke","year":"1976","unstructured":"Clarke, L.A.: A System to Generate Test Data and Symbolically Execute Programs. IEEE Transactions on Software Engineering\u00a02(3), 215\u2013222 (1976)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"4","key":"7_CR12","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R. Cytron","year":"1991","unstructured":"Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Kenneth Zadeck, F.: Efficiently Computing Static Single Assignment Form and the Control Dependence Graph. ACM Trans. Program. Lang. Syst.\u00a013(4), 451\u2013490 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-12592-8_10","volume-title":"Logic-Based Program Synthesis and Transformation","author":"F. Degrave","year":"2010","unstructured":"Degrave, F., Schrijvers, T., Vanhoof, W.: Towards a Framework for Constraint-Based Test Case Generation. In: De Schreye, D. (ed.) LOPSTR 2009. LNCS, vol.\u00a06037, pp. 128\u2013142. Springer, Heidelberg (2010)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/11562931_8","volume-title":"Logic Programming","author":"A. Dovier","year":"2005","unstructured":"Dovier, A., Formisano, A., Pontelli, E.: A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 67\u201382. Springer, Heidelberg (2005)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-73770-4_10","volume-title":"Tests and Proofs","author":"C. Engel","year":"2007","unstructured":"Engel, C., H\u00e4hnle, R.: Generating Unit Tests from Formal Proofs. In: Gurevich, Y., Meyer, B. (eds.) TAP 2007. LNCS, vol.\u00a04454, pp. 169\u2013188. Springer, Heidelberg (2007)"},{"issue":"2-3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0167-6423(94)00019-0","volume":"23","author":"J. Esparza","year":"1994","unstructured":"Esparza, J.: Model checking using net unfoldings. Sci. Comput. Program.\u00a023(2-3), 151\u2013195 (1994)","journal-title":"Sci. Comput. Program."},{"issue":"1","key":"7_CR17","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/226155.226158","volume":"5","author":"R. Ferguson","year":"1996","unstructured":"Ferguson, R., Korel, B.: The Chaining Approach for Software Test Data Generation. ACM Trans. Softw. Eng. Methodol.\u00a05(1), 63\u201386 (1996)","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Godefroid, P.: Dynamic partial-order reduction for model checking software. In: POPL, pp. 110\u2013121. ACM (2005)","DOI":"10.1145\/1047659.1040315"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Godefroid, P.: Compositional Dynamic Test Generation. In: POPL 2007, pp. 47\u201354. ACM (2007)","DOI":"10.1145\/1190215.1190226"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-55179-4_32","volume-title":"Computer Aided Verification","author":"P. Godefroid","year":"1992","unstructured":"Godefroid, P.: Using partial orders to improve automatic verification methods. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol.\u00a0575, pp. 176\u2013185. Springer, Heidelberg (1992)"},{"issue":"10","key":"7_CR21","doi-asserted-by":"publisher","first-page":"1409","DOI":"10.1016\/j.infsof.2009.04.010","volume":"51","author":"M. G\u00f3mez-Zamalloa","year":"2009","unstructured":"G\u00f3mez-Zamalloa, M., Albert, E., Puebla, G.: Decompilation of Java Bytecode to Prolog by Partial Evaluation. Information and Software Technology\u00a051(10), 1409\u20131427 (2009)","journal-title":"Information and Software Technology"},{"issue":"4-6","key":"7_CR22","first-page":"659","volume":"10","author":"M. G\u00f3mez-Zamalloa","year":"2010","unstructured":"G\u00f3mez-Zamalloa, M., Albert, E., Puebla, G.: Test Case Generation for Object-Oriented Imperative Languages in CLP. Theory and Practice of Logic Programming, ICLP 2010 Special Issue\u00a010(4-6), 659\u2013674 (2010)","journal-title":"Theory and Practice of Logic Programming, ICLP 2010 Special Issue"},{"key":"7_CR23","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-44957-4_27","volume-title":"Computational Logic - CL 2000","author":"A. Gotlieb","year":"2000","unstructured":"Gotlieb, A., Botella, B., Rueher, M.: A CLP Framework for Computing Structural Test Data. In: Palamidessi, C., et al. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 399\u2013413. Springer, Heidelberg (2000)"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Gupta, N., Mathur, A.P., Soffa, M.L.: Generating Test Data for Branch Coverage. In: ASE 2000, pp. 219\u2013228. IEEE Computer Society (2000)","DOI":"10.1109\/ASE.2000.873666"},{"issue":"2-3","key":"7_CR25","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.tcs.2008.09.019","volume":"410","author":"P. Haller","year":"2009","unstructured":"Haller, P., Odersky, M.: Scala actors: Unifying thread-based and event-based programming. Theor. Comput. Sci.\u00a0410(2-3), 202\u2013220 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"7_CR26","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1109\/TSE.1977.231144","volume":"3","author":"W.E. Howden","year":"1977","unstructured":"Howden, W.E.: Symbolic Testing and the DISSECT Symbolic Evaluation System. IEEE Transactions on Software Engineering\u00a03(4), 266\u2013278 (1977)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"7_CR27","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19\/20","author":"J. Jaffar","year":"1994","unstructured":"Jaffar, J., Maher, M.J.: Constraint Logic Programming: A Survey. Journal of Logic Programming\u00a019\/20, 503\u2013581 (1994)","journal-title":"Journal of Logic Programming"},{"key":"7_CR28","unstructured":"The Java Modelling\u00a0Language homepage (2013), http:\/\/www.eecs.ucf.edu\/~leavens\/JML\/\/index.shtml"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"K\u00e4hk\u00f6nen, K., Saarikivi, O., Heljanko, K.: Using unfoldings in automated testing of multithreaded programs. In: Goedicke, M., Menzies, T., Saeki, M. (eds.) ASE, pp. 150\u2013159. ACM (2012)","DOI":"10.1145\/2351676.2351698"},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/3-540-36577-X_40","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Khurshid","year":"2003","unstructured":"Khurshid, S., P\u0103s\u0103reanu, C.S., Visser, W.: Generalized Symbolic Execution for Model Checking and Testing. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 553\u2013568. Springer, Heidelberg (2003)"},{"issue":"7","key":"7_CR31","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/360248.360252","volume":"19","author":"J.C. King","year":"1976","unstructured":"King, J.C.: Symbolic Execution and Program Testing. Commun. ACM\u00a019(7), 385\u2013394 (1976)","journal-title":"Commun. ACM"},{"key":"7_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-642-12029-9_22","volume-title":"Fundamental Approaches to Software Engineering","author":"S. Lauterburg","year":"2010","unstructured":"Lauterburg, S., Karmani, R.K., Marinov, D., Agha, G.: Evaluating Ordering Heuristics for Dynamic Partial-Order Reduction Techniques. In: Rosenblum, D.S., Taentzer, G. (eds.) FASE 2010. LNCS, vol.\u00a06013, pp. 308\u2013322. Springer, Heidelberg (2010)"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd ext. edn. Springer (1987)","DOI":"10.1007\/978-3-642-83189-8"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Marriott, K., Stuckey, P.J.: Programming with Constraints: an Introduction. MIT Press (1998)","DOI":"10.7551\/mitpress\/5625.001.0001"},{"issue":"2","key":"7_CR35","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1002\/stvr.225","volume":"11","author":"C. Meudec","year":"2001","unstructured":"Meudec, C.: ATGen: Automatic Test Data Generation using Constraint Logic Programming and Symbolic Execution. Softw. Test., Verif. Reliab.\u00a011(2), 81\u201396 (2001)","journal-title":"Softw. Test., Verif. Reliab."},{"key":"7_CR36","unstructured":"M\u00fcller, R.A., Lembeck, C., Kuchen, H.: A Symbolic Java Virtual Machine for Test Case Generation. In: IASTEDSE 2004, pp. 365\u2013371. ACTA Press (2004)"},{"issue":"3","key":"7_CR37","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10515-013-0122-2","volume":"20","author":"C.S. Pasareanu","year":"2013","unstructured":"Pasareanu, C.S., Visser, W., Bushnell, D.H., Geldenhuys, J., Mehlitz, P.C., Rungta, N.: Symbolic pathfinder: integrating symbolic execution with model checking for java bytecode analysis. Autom. Softw. Eng.\u00a020(3), 391\u2013425 (2013)","journal-title":"Autom. Softw. Eng."},{"issue":"4","key":"7_CR38","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10009-009-0118-1","volume":"11","author":"C.S. P\u01ces\u01cereanu","year":"2009","unstructured":"P\u01ces\u01cereanu, C.S., Visser, W.: A Survey of New Trends in Symbolic Execution for Software Testing and Analysis. Int. J. Softw. Tools Technol. Transf.\u00a011(4), 339\u2013353 (2009)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"7_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-642-38197-3_12","volume-title":"Logic-Based Program Synthesis and Transformation","author":"J.M. Rojas","year":"2013","unstructured":"Rojas, J.M., G\u00f3mez-Zamalloa, M.: A Framework for Guided Test Case Generation in Constraint Logic Programming. In: Albert, E. (ed.) LOPSTR 2012. LNCS, vol.\u00a07844, pp. 176\u2013193. Springer, Heidelberg (2013)"},{"key":"7_CR40","unstructured":"Rojas, J.M., P\u0103s\u0103reanu, C.S.: Compositional Symbolic Execution through Program Specialization. In: 8th Workshop on Bytecode Semantics, Verification, Analysis and Transformation, BYTECODE 2013 (March 2013)"},{"key":"7_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/11693017_25","volume-title":"Fundamental Approaches to Software Engineering","author":"K. Sen","year":"2006","unstructured":"Sen, K., Agha, G.: Automated Systematic Testing of Open Distributed Programs. In: Baresi, L., Heckel, R. (eds.) FASE 2006. LNCS, vol.\u00a03922, pp. 339\u2013356. Springer, Heidelberg (2006)"},{"key":"7_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-540-70889-6_13","volume-title":"Hardware and Software, Verification and Testing","author":"K. Sen","year":"2007","unstructured":"Sen, K., Agha, G.: A race-detection and flipping algorithm for automated testing of multi-threaded programs. In: Bin, E., Ziv, A., Ur, S. (eds.) HVC 2006. LNCS, vol.\u00a04383, pp. 166\u2013182. Springer, Heidelberg (2007)"},{"key":"7_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-24730-2_9","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Sen","year":"2004","unstructured":"Sen, K., Ro\u015fu, G., Agha, G.: Online efficient predictive safety analysis of multithreaded programs. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 123\u2013138. Springer, Heidelberg (2004)"},{"key":"7_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/11494881_14","volume-title":"Formal Methods for Open Object-Based Distributed Systems","author":"K. Sen","year":"2005","unstructured":"Sen, K., Ro\u015fu, G., Agha, G.: Detecting errors in multithreaded programs by generalized predictive analysis of executions. In: Steffen, M., Zavattaro, G. (eds.) FMOODS 2005. LNCS, vol.\u00a03535, pp. 211\u2013226. Springer, Heidelberg (2005)"},{"key":"7_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-30793-5_14","volume-title":"Formal Techniques for Distributed Systems","author":"S. Tasharofi","year":"2012","unstructured":"Tasharofi, S., Karmani, R.K., Lauterburg, S., Legay, A., Marinov, D., Agha, G.: TransDPOR: A Novel Dynamic Partial-Order Reduction Technique for Testing Actor Programs. In: Giese, H., Rosu, G. (eds.) FORTE 2012 and FMOODS 2012. LNCS, vol.\u00a07273, pp. 219\u2013234. Springer, Heidelberg (2012)"},{"key":"7_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-79124-9_10","volume-title":"Tests and Proofs","author":"N. Tillmann","year":"2008","unstructured":"Tillmann, N., de Halleux, J.: Pex\u2013White Box Test Generation for.NET. In: Beckert, B., H\u00e4hnle, R. (eds.) TAP 2008. LNCS, vol.\u00a04966, pp. 134\u2013153. Springer, Heidelberg (2008)"},{"key":"7_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-642-29822-6_24","volume-title":"Functional and Logic Programming","author":"M. Triska","year":"2012","unstructured":"Triska, M.: The Finite Domain Constraint Solver of SWI-Prolog. In: Schrijvers, T., Thiemann, P. (eds.) FLOPS 2012. LNCS, vol.\u00a07294, pp. 307\u2013316. Springer, Heidelberg (2012)"},{"issue":"1-2","key":"7_CR48","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1017\/S1471068411000494","volume":"12","author":"J. Wielemaker","year":"2012","unstructured":"Wielemaker, J., Schrijvers, T., Triska, M., Lager, T.: SWI-prolog. Theory and Practice of Logic Programming\u00a012(1-2), 67\u201396 (2012)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"4","key":"7_CR49","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1145\/267580.267590","volume":"29","author":"H. Zhu","year":"1997","unstructured":"Zhu, H., Hall, P.A.V., May, J.H.R.: Software Unit Test Coverage and Adequacy. ACM Comput. Surv.\u00a029(4), 366\u2013427 (1997)","journal-title":"ACM Comput. Surv."}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Executable Software Models"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07317-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T03:46:20Z","timestamp":1597895180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07317-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319073163","9783319073170"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07317-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}