{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:48:59Z","timestamp":1743119339689,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030162016"},{"type":"electronic","value":"9783030162023"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-16202-3_3","type":"book-chapter","created":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T09:04:08Z","timestamp":1552640648000},"page":"39-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Measuring Coverage of Prolog Programs Using Mutation Testing"],"prefix":"10.1007","author":[{"given":"Alexandros","family":"Efremidis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8842-2993","authenticated-orcid":false,"given":"Joshua","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6712-9798","authenticated-orcid":false,"given":"Sebastian","family":"Krings","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7256-9560","authenticated-orcid":false,"given":"Philipp","family":"K\u00f6rner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,16]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Ammann, P., Delamaro, M.E., Offutt, J., et al.: Establishing theoretical minimal sets of mutants. In: IEEE International Conference on Software Testing, Verification, and Validation, vol. 7. IEEE Computer Society (2014)","DOI":"10.1109\/ICST.2014.13"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"KL Clark","year":"1978","unstructured":"Clark, K.L.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293\u2013322. Springer, Boston (1978). https:\/\/doi.org\/10.1007\/978-1-4684-3384-5_11"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Coles, H., Laurent, T., Henard, C., Papadakis, M., Ventresque, A.: PIT: a practical mutation testing tool for Java (Demo). In: International Symposium on Software Testing and Analysis, ISSTA 2016, pp. 449\u2013452. ACM (2016)","DOI":"10.1145\/2931037.2948707"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Denisov, A., Pankevich, S.: Mull it over: mutation testing based on LLVM. In: 2018 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW), pp. 25\u201331, April 2018","DOI":"10.1109\/ICSTW.2018.00024"},{"key":"3_CR5","unstructured":"Deursen, A.V., Moonen, L., Bergh, A., Kok, G.: Refactoring test code. In: International Conference on Extreme Programming and Flexible Processes in Software Engineering, pp. 92\u201395 (2001)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Gr\u00fcn, B.J., Schuler, D., Zeller, A.: The impact of equivalent mutants. In: IEEE International Workshop on Mutation Analysis, pp. 192\u2013199. IEEE (2009)","DOI":"10.1109\/ICSTW.2009.37"},{"issue":"5","key":"3_CR7","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1109\/TSE.2010.62","volume":"37","author":"Y Jia","year":"2011","unstructured":"Jia, Y., Harman, M.: An analysis and survey of the development of mutation testing. IEEE Trans. Softw. Eng. 37(5), 649\u2013678 (2011)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"3_CR8","unstructured":"Krings, S.: Code coverage analysis for prolog. Bachelor\u2019s thesis, Heinrich-Heine-University, Duesseldorf, Germany (2010)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-319-91271-4_6","volume-title":"Abstract State Machines, Alloy, B, TLA, VDM, and Z","author":"S Krings","year":"2018","unstructured":"Krings, S., Schmidt, J., Brings, C., Frappier, M., Leuschel, M.: A translation from alloy to B. In: Butler, M., Raschke, A., Hoang, T.S., Reichl, K. (eds.) ABZ 2018. LNCS, vol. 10817, pp. 71\u201386. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91271-4_6"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"K\u00f6rner, P., Krings, S.: plspec - A specification language for prolog data. In: Seipel, D., Hanus, M., Abreu, S. (eds.) Declare 2017, vol. 499, Technical report. University of W\u00fcrzburg (2017)","DOI":"10.1007\/978-3-030-00801-7_13"},{"key":"3_CR11","unstructured":"K\u00f6rner, P., Schneider, D., Leuschel, M.: Evaluating interpreter design in prolog. In: Kolloquium Programmiersprachen und Grundlagen der Programmierung KPS, Schriftenreihe des Instituts f\u00fcr Computersprachen (2015)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Le, D., Alipour, M., Gopinath, R., Groce, A.: MuCheck: an extensible tool for mutation testing of haskell programs. In: International Symposium on Software Testing and Analysis, ISSTA (2014)","DOI":"10.1145\/2610384.2628052"},{"key":"3_CR13","unstructured":"Le, D., Alipour, M.A., Gopinath, R., Groce, A.: Mutation testing of functional programming languages. Technical report. Oregon State University, School of Software Engineering and Computer Science (2014)"},{"key":"3_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-96826-6","volume-title":"Foundations of Logic Programming","author":"JW Lloyd","year":"1984","unstructured":"Lloyd, J.W.: Foundations of Logic Programming. Springer, Heidelberg (1984). https:\/\/doi.org\/10.1007\/978-3-642-96826-6"},{"key":"3_CR15","unstructured":"Naish, L.: A declarative debugging scheme. J. Funct. Logic Program. 1997(3) (1997). http:\/\/danae.uni-muenster.de\/lehre\/kuchen\/JFLP\/articles\/1997\/A97-03\/A97-03.html"},{"issue":"3","key":"3_CR16","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/(SICI)1099-1689(199709)7:3<165::AID-STVR143>3.0.CO;2-U","volume":"7","author":"AJ Offutt","year":"1997","unstructured":"Offutt, A.J., Pan, J.: Automatically detecting equivalent mutants and infeasible paths. Softw. Testing Verif. Reliab. 7(3), 165\u2013192 (1997)","journal-title":"Softw. Testing Verif. Reliab."},{"key":"3_CR17","unstructured":"Offutt, A.J., Rothermel, G., Zapf, C.: An experimental evaluation of selective mutation. In: International Conference on Software Engineering, pp. 100\u2013107. IEEE Computer Society Press (1993)"},{"issue":"21\u201323","key":"3_CR18","first-page":"61","volume":"26","author":"CH Papadimitriou","year":"1985","unstructured":"Papadimitriou, C.H.: A note the expressive power of prolog. Bull. EATCS 26(21\u201323), 61 (1985)","journal-title":"Bull. EATCS"},{"issue":"5","key":"3_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/MITP.2006.122","volume":"8","author":"RS Sangwan","year":"2006","unstructured":"Sangwan, R.S., LaPlante, P.A.L.: Test-driven development in large projects. IT Prof. 8(5), 25\u201329 (2006)","journal-title":"IT Prof."},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Schuler, D., Zeller, A.: Javalanche: efficient mutation testing for Java. In: Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, ESEC\/FSE 2009, pp. 297\u2013298. ACM (2009)","DOI":"10.1145\/1595696.1595750"},{"key":"3_CR21","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1192.001.0001","volume-title":"Algorithmic Program Debugging","author":"EY Shapiro","year":"1983","unstructured":"Shapiro, E.Y.: Algorithmic Program Debugging. MIT Press, Cambridge (1983)"},{"key":"3_CR22","unstructured":"SICS, Kista, Sweden. SICStus Prolog User\u2019s Manual. http:\/\/www.sics.se\/isl\/sicstuswww\/site\/documentation.html"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Toaldo, J.R., Vergilio, S.R.: Applying mutation testing in prolog programs. In: VII Workshop de Testes e Toler\u00e2ncia a Falhas. Biblioteca Digital Brasileira de Computa\u00e7\u00e3o (2006)","DOI":"10.5753\/wtf.2006.23347"},{"issue":"1\u20132","key":"3_CR24","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 Pract. Logic Program. 12(1\u20132), 67\u201396 (2012)","journal-title":"Theory Pract. Logic Program."}],"container-title":["Lecture Notes in Computer Science","Functional and Constraint Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16202-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T20:40:07Z","timestamp":1721076007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-16202-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030162016","9783030162023"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16202-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WFLP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Functional and Constraint Logic Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Frankfurt\/Main","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wflp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ppdp-lopstr-18.cs.uni-frankfurt.de\/wflp18.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"19","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}