{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:16:37Z","timestamp":1725905797128},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319631387"},{"type":"electronic","value":"9783319631394"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-63139-4_12","type":"book-chapter","created":{"date-parts":[[2017,7,24]],"date-time":"2017-07-24T03:22:55Z","timestamp":1500866575000},"page":"205-221","source":"Crossref","is-referenced-by-count":2,"title":["On the Completeness of Selective Unification in Concolic Testing of Logic Programs"],"prefix":"10.1007","author":[{"given":"Fred","family":"Mesnard","sequence":"first","affiliation":[]},{"given":"\u00c9tienne","family":"Payet","sequence":"additional","affiliation":[]},{"given":"Germ\u00e1n","family":"Vidal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,25]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10009-008-0090-1","volume":"11","author":"S Anand","year":"2009","unstructured":"Anand, S., Pasareanu, C.S., Visser, W.: Symbolic execution with abstraction. STTT 11(1), 53\u201367 (2009)","journal-title":"STTT"},{"key":"12_CR2","volume-title":"From Logic Programming to Prolog","author":"KR Apt","year":"1997","unstructured":"Apt, K.R.: From Logic Programming to Prolog. Prentice Hall, Englewood Cliffs (1997)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Clarke, L.A.: A program testing system. In: Proceedings of the 1976 Annual Conference (ACM 1976), pp. 488\u2013491 (1976)","DOI":"10.1145\/800191.805647"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Godefroid, P., Klarlund, N., Sen, K.: DART: directed automated random testing. In: Proceedings of PLDI 2005, pp. 213\u2013223. ACM (2005)","DOI":"10.1145\/1065010.1065036"},{"issue":"3","key":"12_CR5","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1145\/2093548.2093564","volume":"55","author":"P Godefroid","year":"2012","unstructured":"Godefroid, P., Levin, M.Y., Molnar, D.A.: Sage: whitebox fuzzing for security testing. CACM 55(3), 40\u201344 (2012)","journal-title":"CACM"},{"issue":"7","key":"12_CR6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/360248.360252","volume":"19","author":"JC King","year":"1976","unstructured":"King, J.C.: Symbolic execution and program testing. CACM 19(7), 385\u2013394 (1976)","journal-title":"CACM"},{"issue":"4\u20135","key":"12_CR7","first-page":"711","volume":"15","author":"F Mesnard","year":"2015","unstructured":"Mesnard, F., Payet, \u00c9., Vidal, G.: Concolic testing in logic programming. TPLP 15(4\u20135), 711\u2013725 (2015)","journal-title":"TPLP"},{"key":"12_CR8","unstructured":"Mesnard, F., Payet, \u00c9., Vidal, G.: Concolic testing in logic programming (extended version). CoRR abs\/1507.05454 (2015). \nhttp:\/\/arxiv.org\/abs\/1507.05454"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/BFb0032046","volume-title":"Automata, Languages and Programming","author":"C Palamidessi","year":"1990","unstructured":"Palamidessi, C.: Algebraic properties of idempotent substitutions. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 386\u2013399. Springer, Heidelberg (1990). doi:\n10.1007\/BFb0032046"},{"key":"12_CR10","unstructured":"Pasareanu, C.S., Rungta, N., PathFinder, S.: symbolic execution of Java bytecode. In: Pecheur, C., Andrews, J., Nitto, E.D. (eds.) ASE, pp. 179\u2013180. ACM (2010)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Sen, K., Marinov, D., Agha, G.: CUTE: a concolic unit testing engine for C. In: Proceedings of ESEC\/SIGSOFT FSE 2005, pp. 263\u2013272. ACM (2005)","DOI":"10.1145\/1081706.1081750"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-642-32211-2_16","volume-title":"Logic-Based Program Synthesis and Transformation","author":"T Str\u00f6der","year":"2012","unstructured":"Str\u00f6der, T., Emmes, F., Schneider-Kamp, P., Giesl, J., Fuhs, C.: A linear operational semantics for termination and complexity analysis of ISO Prolog. In: Vidal, G. (ed.) LOPSTR 2011. LNCS, vol. 7225, pp. 237\u2013252. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-32211-2_16"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63139-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,24]],"date-time":"2017-07-24T03:26:41Z","timestamp":1500866801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63139-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319631387","9783319631394"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63139-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}