{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:35:57Z","timestamp":1742996157229,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319983332"},{"type":"electronic","value":"9783319983349"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-98334-9_46","type":"book-chapter","created":{"date-parts":[[2018,8,22]],"date-time":"2018-08-22T08:33:14Z","timestamp":1534926794000},"page":"727-736","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Metamorphic Testing of Constraint Solvers"],"prefix":"10.1007","author":[{"given":"\u00d6zg\u00fcr","family":"Akg\u00fcn","sequence":"first","affiliation":[]},{"given":"Ian P.","family":"Gent","sequence":"additional","affiliation":[]},{"given":"Christopher","family":"Jefferson","sequence":"additional","affiliation":[]},{"given":"Ian","family":"Miguel","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Nightingale","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,23]]},"reference":[{"key":"46_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of Constraint Programming","author":"K Apt","year":"2003","unstructured":"Apt, K.: Principles of Constraint Programming. Cambridge University Press, New York (2003)"},{"key":"46_CR2","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: ECAI 2004, pp. 482\u2013486 (2004)"},{"key":"46_CR3","doi-asserted-by":"crossref","unstructured":"Brummayer, R., Biere, A.: Fuzzing and delta-debugging SMT solvers. In: Proceedings of the 7th International Workshop on Satisfiability Modulo Theories, SMT 2009, pp. 1\u20135. ACM, New York (2009)","DOI":"10.1145\/1670412.1670413"},{"key":"46_CR4","unstructured":"Budd, T.A.: Mutation analysis of program test data. Ph.D. thesis, New Haven, CT, USA (1980)"},{"key":"46_CR5","unstructured":"Debruyne, R., Bessi\u00e8re, C.: Some practicable filtering techniques for the constraint satisfaction problem. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 1997), pp. 412\u2013417 (1997)"},{"key":"46_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-23786-7_23","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"T Feydy","year":"2011","unstructured":"Feydy, T., Somogyi, Z., Stuckey, P.J.: Half reification and flattening. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 286\u2013301. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-23786-7_23"},{"key":"46_CR7","unstructured":"Gecode Team: Gecode: Generic constraint development environment (2006). \n                      http:\/\/www.gecode.org"},{"key":"46_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/11889205_15","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"IP Gent","year":"2006","unstructured":"Gent, I.P., Jefferson, C., Miguel, I.: Watched literals for constraint propagation in minion. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 182\u2013197. Springer, Heidelberg (2006). \n                      https:\/\/doi.org\/10.1007\/11889205_15"},{"key":"46_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2014.03.001","volume":"211","author":"IP Gent","year":"2014","unstructured":"Gent, I.P., Jefferson, C., Linton, S., Miguel, I., Nightingale, P.: Generating custom propagators for arbitrary constraints. Artif. Intell. 211, 1\u201333 (2014). \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/S000437021400023X","journal-title":"Artif. Intell."},{"key":"46_CR10","unstructured":"Gent, I.P., Jefferson, C., Miguel, I.: Minion: a fast scalable constraint solver. In: ECAI, vol. 141, pp. 98\u2013102 (2006)"},{"issue":"18","key":"46_CR11","doi-asserted-by":"publisher","first-page":"1973","DOI":"10.1016\/j.artint.2008.10.006","volume":"172","author":"IP Gent","year":"2008","unstructured":"Gent, I.P., Miguel, I., Nightingale, P.: Generalised arc consistency for the alldifferent constraint: an empirical survey. Artif. Intell. 172(18), 1973\u20132000 (2008)","journal-title":"Artif. Intell."},{"key":"46_CR12","unstructured":"Gent, I., Jefferson, C., Miguel, I., Nightingale, P.: Data structures for generalised arc consistency for extensional constraints. In: AAAI (CPPOD-19-2006-A), pp. 191\u2013197 (2007). \n                      http:\/\/www.aaai.org\/Papers\/AAAI\/2007\/AAAI07-029.pdf"},{"key":"46_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/978-3-642-04244-7_38","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"C Jefferson","year":"2009","unstructured":"Jefferson, C., Kadioglu, S., Petrie, K.E., Sellmann, M., \u017divn\u00fd, S.: Same-relation constraints. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 470\u2013485. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-04244-7_38"},{"issue":"16\u201317","key":"46_CR14","doi-asserted-by":"publisher","first-page":"1407","DOI":"10.1016\/j.artint.2010.07.001","volume":"174","author":"C Jefferson","year":"2010","unstructured":"Jefferson, C., Moore, N.C.A., Nightingale, P., Petrie, K.E.: Implementing logical connectives in constraint programming. Artif. Intell. 174(16\u201317), 1407\u20131429 (2010)","journal-title":"Artif. Intell."},{"key":"46_CR15","unstructured":"Jefferson, C., Nightingale, P.: Extending simple tabular reduction with short supports. In: IJCAI (2013)"},{"issue":"5","key":"46_CR16","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."},{"issue":"7","key":"46_CR17","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1002\/spe.4380210704","volume":"21","author":"KN King","year":"1991","unstructured":"King, K.N., Offutt, A.J.: A fortran language system for mutation- based software testing. Softw. Pract. Exp. 21(7), 685\u2013718 (1991). \n                      https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/spe.4380210704","journal-title":"Softw. Pract. Exp."},{"issue":"18","key":"46_CR18","doi-asserted-by":"publisher","first-page":"1592","DOI":"10.1016\/j.artint.2009.09.002","volume":"173","author":"C Lecoutre","year":"2009","unstructured":"Lecoutre, C., Sa\u00efs, L., Tabary, S., Vidal, V.: Reasoning from last conflict(s) in constraint programming. Artif. Intell. 173(18), 1592\u20131614 (2009). \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0004370209001040","journal-title":"Artif. Intell."},{"issue":"2","key":"46_CR19","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1016\/j.artint.2010.10.005","volume":"175","author":"P Nightingale","year":"2011","unstructured":"Nightingale, P.: The extended global cardinality constraint: an empirical survey. Artif. Intell. 175(2), 586\u2013614 (2011)","journal-title":"Artif. Intell."},{"issue":"1","key":"46_CR20","first-page":"1","volume":"46","author":"P Nightingale","year":"2013","unstructured":"Nightingale, P., Gent, I.P., Jefferson, C., Miguel, I.: Short and long supports for constraint propagation. J. Artif. Int. Res. 46(1), 1\u201345 (2013). \n                      http:\/\/dl.acm.org\/citation.cfm?id=2512538.2512539","journal-title":"J. Artif. Int. Res."},{"key":"46_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-319-61467-0_10","volume-title":"Tests and Proofs","author":"G Reger","year":"2017","unstructured":"Reger, G., Suda, M., Voronkov, A.: Testing a saturation-based theorem prover: experiences and challenges. In: Gabmeyer, S., Johnsen, E.B. (eds.) TAP 2017. LNCS, vol. 10375, pp. 152\u2013161. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-61467-0_10"},{"volume-title":"Handbook of Constraint Programming","year":"2006","key":"46_CR22","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Elsevier, New York (2006)"},{"key":"46_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/978-3-642-04244-7_56","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"C Schulte","year":"2009","unstructured":"Schulte, C., Tack, G.: Weakly monotonic propagators. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 723\u2013730. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-04244-7_56\n                      \n                    . \n                      http:\/\/www.gecode.org\/paper.html?id=SchulteTack:CP:2009"},{"key":"46_CR24","unstructured":"Chen, T.Y., Cheung, S.C., Yiu, S.M.: Metamorphic testing: a new approach for generating next test cases. Technical report HKUST-CS98-01 (1998)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98334-9_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T04:34:58Z","timestamp":1558326898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98334-9_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319983332","9783319983349"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98334-9_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"23 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lille","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"27 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cp2018.a4cp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"114","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"36% - 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":"3,85","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,75","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"}}]}}