{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:27:44Z","timestamp":1767929264269,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642162411","type":"print"},{"value":"9783642162428","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16242-8_10","type":"book-chapter","created":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T12:51:59Z","timestamp":1286196719000},"page":"127-141","source":"Crossref","is-referenced-by-count":2,"title":["Generating Counterexamples for Structural Inductions by\u00a0Exploiting Nonstandard Models"],"prefix":"10.1007","author":[{"given":"Jasmin Christian","family":"Blanchette","sequence":"first","affiliation":[]},{"given":"Koen","family":"Claessen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-45620-1_18","volume-title":"Automated Deduction - CADE-18","author":"W. Ahrendt","year":"2002","unstructured":"Ahrendt, W.: Deductive search for errors in free data type specifications using model generation. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, pp. 211\u2013225. Springer, Heidelberg (2002)"},{"key":"10_CR2","first-page":"230","volume-title":"SEFM 2004","author":"S. Berghofer","year":"2004","unstructured":"Berghofer, S., Nipkow, T.: Random testing in Isabelle\/HOL. In: Cuellar, J., Liu, Z. (eds.) SEFM 2004, pp. 230\u2013239. IEEE C.S., Los Alamitos (2004)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-48256-3_3","volume-title":"Theorem Proving in Higher Order Logics","author":"S. Berghofer","year":"1999","unstructured":"Berghofer, S., Wenzel, M.: Inductive datatypes in HOL\u2014lessons learned in formal-logic engineering. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Th\u00e9ry, L. (eds.) TPHOLs 1999. LNCS, vol.\u00a01690, pp. 19\u201336. Springer, Heidelberg (1999)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/978-3-642-13977-2_11","volume-title":"TAP 2010","author":"J.C. Blanchette","year":"2010","unstructured":"Blanchette, J.C.: Relational analysis of (co)inductive predicates (co)inductive datatypes, and (co)recursive functions. In: Fraser, G., Gargantini, A. (eds.) TAP 2010. LNCS, vol.\u00a06143, pp. 117\u2013134. Springer, Heidelberg (2010)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-3-642-14052-5_11","volume-title":"ITP 2010","author":"J.C. Blanchette","year":"2010","unstructured":"Blanchette, J.C., Nipkow, T.: Nitpick: A counterexample generator for higher-order logic based on a relational model finder. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol.\u00a06172, pp. 131\u2013146. Springer, Heidelberg (2010)"},{"key":"10_CR6","series-title":"Applied Logic","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4020-2653-9","volume-title":"Automated Model Building","author":"R. Caferra","year":"2004","unstructured":"Caferra, R., Leitsch, A., Peltier, N.: Automated Model Building. Applied Logic, vol.\u00a031. Springer, Heidelberg (2004)"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"56","DOI":"10.2307\/2266170","volume":"5","author":"A. Church","year":"1940","unstructured":"Church, A.: A formulation of the simple theory of types. J. Symb. Log.\u00a05, 56\u201368 (1940)","journal-title":"J. Symb. Log."},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-79124-9_5","volume-title":"Tests and Proofs","author":"K. Claessen","year":"2008","unstructured":"Claessen, K., Svensson, H.: Finding counter examples in induction proofs. In: Beckert, B., H\u00e4hnle, R. (eds.) TAP 2008. LNCS, vol.\u00a04966, pp. 48\u201365. Springer, Heidelberg (2008)"},{"key":"10_CR9","volume-title":"Introduction to HOL: A Theorem Proving Environment for Higher Order Logic","year":"1993","unstructured":"Gordon, M.J.C., Melham, T.F. (eds.): Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, Cambridge (1993)"},{"key":"10_CR10","unstructured":"Klein, G., Nipkow, T., Paulson, L.: The archive of formal proofs, \n                  \n                    http:\/\/afp.sf.net\/"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10817-007-9085-y","volume":"40","author":"J. Meng","year":"2008","unstructured":"Meng, J., Paulson, L.C.: Translating higher-order clauses to first-order clauses. J. Auto. Reas.\u00a040(1), 35\u201360 (2008)","journal-title":"J. Auto. Reas."},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.jal.2007.07.004","volume":"7","author":"J. Meng","year":"2009","unstructured":"Meng, J., Paulson, L.C.: Lightweight relevance filtering for machine-generated resolution problems. J. Applied Logic\u00a07(1), 41\u201357 (2009)","journal-title":"J. Applied Logic"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL","author":"T. Nipkow","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle\/HOL. LNCS, vol.\u00a02283. Springer, Heidelberg (2002)"},{"key":"10_CR14","unstructured":"Owre, S., Shankar, N.: Abstract datatypes in PVS. Technical report, SRI (1993)"},{"key":"10_CR15","doi-asserted-by":"crossref","first-page":"150","DOI":"10.4064\/fm-23-1-150-161","volume":"23","author":"T. Skolem","year":"1934","unstructured":"Skolem, T.: \u00dcber die Nicht-charakterisierbarkeit der Zahlenreihe mittels endlich oder abz\u00e4hlbar unendlich vieler Aussagen mit ausschlie\u00dflich Zahlenvariablen. Fundam. Math.\u00a023, 150\u2013161 (1934)","journal-title":"Fundam. Math."},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-48958-4_15","volume-title":"Logic-Based Program Synthesis and Transformation","author":"J. Stark","year":"1999","unstructured":"Stark, J., Ireland, A.: Invariant discovery via failed proof attempts. In: Flener, P. (ed.) LOPSTR 1998. LNCS, vol.\u00a01559, pp. 271\u2013288. Springer, Heidelberg (1999)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/978-3-540-71209-1_49","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E. Torlak","year":"2007","unstructured":"Torlak, E., Jackson, D.: Kodkod: A relational model finder. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 632\u2013647. Springer, Heidelberg (2007)"},{"issue":"3\u20134","key":"10_CR18","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1023\/A:1021935419355","volume":"29","author":"M. Wenzel","year":"2002","unstructured":"Wenzel, M., Wiedijk, F.: A comparison of the mathematical proof languages Mizar and Isar. J. Auto. Reas.\u00a029(3\u20134), 389\u2013411 (2002)","journal-title":"J. Auto. Reas."}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16242-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T13:32:25Z","timestamp":1553175145000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16242-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642162411","9783642162428"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16242-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}