{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T01:10:04Z","timestamp":1744161004058,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642336652"},{"type":"electronic","value":"9783642336669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33666-9_26","type":"book-chapter","created":{"date-parts":[[2012,9,18]],"date-time":"2012-09-18T16:50:20Z","timestamp":1347987020000},"page":"399-414","source":"Crossref","is-referenced-by-count":9,"title":["Detecting Specification Errors in Declarative Languages with Constraints"],"prefix":"10.1007","author":[{"given":"Ethan K.","family":"Jackson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfram","family":"Schulte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaj","family":"Bj\u00f8rner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Chang, F.S.H., Jackson, D.: Symbolic model checking of declarative relational models. In: ICSE, pp. 312\u2013320 (2006)","DOI":"10.1145\/1134285.1134329"},{"issue":"3-4","key":"26_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s00165-009-0140-9","volume":"22","author":"A. Boronat","year":"2010","unstructured":"Boronat, A., Meseguer, J.: An algebraic semantics for mof. Formal Asp. Comput.\u00a022(3-4), 269\u2013296 (2010)","journal-title":"Formal Asp. Comput."},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-642-24485-8_48","volume-title":"Model Driven Engineering Languages and Systems","author":"E.K. Jackson","year":"2011","unstructured":"Jackson, E.K., Levendovszky, T., Balasubramanian, D.: Reasoning about Metamodeling with Formal Specifications and Automatic Proofs. In: Whittle, J., Clark, T., K\u00fchne, T. (eds.) MODELS 2011. LNCS, vol.\u00a06981, pp. 653\u2013667. Springer, Heidelberg (2011)"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Klar, F., K\u00f6nigs, A., Sch\u00fcrr, A.: Model transformation in the large. In: ESEC\/SIGSOFT FSE, pp. 285\u2013294 (2007)","DOI":"10.1145\/1287624.1287664"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.entcs.2008.04.038","volume":"211","author":"J. Winkelmann","year":"2008","unstructured":"Winkelmann, J., Taentzer, G., Ehrig, K., K\u00fcster, J.M.: Translation of restricted ocl constraints into graph constraints for generating meta model instances by graph grammars. Electr. Notes Theor. Comput. Sci.\u00a0211, 159\u2013170 (2008)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-04425-0_9","volume-title":"Model Driven Engineering Languages and Systems","author":"\u00c1. Horv\u00e1th","year":"2009","unstructured":"Horv\u00e1th, \u00c1., Varr\u00f3, D.: CSP(M): Constraint Satisfaction Problem over Models. In: Sch\u00fcrr, A., Selic, B. (eds.) MODELS 2009. LNCS, vol.\u00a05795, pp. 107\u2013121. Springer, Heidelberg (2009)"},{"key":"26_CR7","unstructured":"Jackson, E.K., Bj\u00f8rner, N., Schulte, W.: Canonical regular types. In: ICLP (Technical Communications), pp. 73\u201383 (2011)"},{"issue":"4","key":"26_CR8","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.ic.2006.08.009","volume":"205","author":"R. Nieuwenhuis","year":"2007","unstructured":"Nieuwenhuis, R., Oliveras, A.: Fast congruence closure and extensions. Inf. Comput.\u00a0205(4), 557\u2013580 (2007)","journal-title":"Inf. Comput."},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L.M. Moura de","year":"2008","unstructured":"de Moura, L.M., Bj\u00f8rner, N.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 337\u2013340. Springer, Heidelberg (2008)"},{"key":"26_CR10","unstructured":"Dart, P.W., Zobel, J.: A Regular Type Language for Logic Programs. In: Types in Logic Programming, pp. 157\u2013187. MIT Press (1992)"},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/1053468.1053470","volume":"27","author":"H. Hosoya","year":"2005","unstructured":"Hosoya, H., Vouillon, J., Pierce, B.C.: Regular expression types for XML. ACM Trans. Program. Lang. Syst.\u00a027(1), 46\u201390 (2005)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-45587-6_16","volume-title":"Practical Aspects of Declarative Languages","author":"J.P. Gallagher","year":"2002","unstructured":"Gallagher, J.P., Puebla, G.: Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs. In: Adsul, B., Ramakrishnan, C.R. (eds.) PADL 2002. LNCS, vol.\u00a02257, pp. 243\u2013261. Springer, Heidelberg (2002)"},{"issue":"2&3","key":"26_CR13","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P. Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract Interpretation and Application to Logic Programs. J. Log. Program.\u00a013(2&3), 103\u2013179 (1992)","journal-title":"J. Log. Program."},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Benzaken, V., Castagna, G., Frisch, A.: CDuce: an XML-centric general-purpose language. In: Runciman, C., Shivers, O. (eds.) ICFP, pp. 51\u201363. ACM (2003)","DOI":"10.1145\/944746.944711"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/3540543961_21","volume-title":"Functional Programming Languages and Computer Architecture","author":"A. Aiken","year":"1991","unstructured":"Aiken, A., Murphy, B.R.: Implementing Regular Tree Expressions. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol.\u00a0523, pp. 427\u2013447. Springer, Heidelberg (1991)"},{"issue":"3","key":"26_CR16","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0743-1066(93)90043-G","volume":"16","author":"H. A\u00eft-Kaci","year":"1993","unstructured":"A\u00eft-Kaci, H., Podelski, A.: Towards a Meaning of LIFE. J. Log. Program\u00a016(3), 195\u2013234 (1993)","journal-title":"J. Log. Program"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Frisch, A., Castagna, G., Benzaken, V.: Semantic subtyping: Dealing set-theoretically with function, union, intersection, and negation types. J. ACM\u00a055(4) (2008)","DOI":"10.1145\/1391289.1391293"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Sch\u00e4fer, M., de Moor, O.: Type inference for datalog with complex type hierarchies. In: POPL, pp. 145\u2013156 (2010)","DOI":"10.1145\/1707801.1706317"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Fruhwirth, T., Shapiro, E., Vardi, M., Yardeni, E.: Logic programs as types for logic programs. In: LICS 1991, pp. 300\u2013309 (1991)","DOI":"10.1109\/LICS.1991.151654"},{"issue":"1-2","key":"26_CR20","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.scico.2005.02.006","volume":"58","author":"M.V. Hermenegildo","year":"2005","unstructured":"Hermenegildo, M.V., Puebla, G., Bueno, F., L\u00f3pez-Garc\u00eda, P.: Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor). Sci. Comput. Program.\u00a058(1-2), 115\u2013140 (2005)","journal-title":"Sci. Comput. Program."},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-11319-2_11","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"L. Chen","year":"2010","unstructured":"Chen, L., Min\u00e9, A., Wang, J., Cousot, P.: An Abstract Domain to Discover Interval Linear Equalities. In: Barthe, G., Hermenegildo, M. (eds.) VMCAI 2010. LNCS, vol.\u00a05944, pp. 112\u2013128. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Model Driven Engineering Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33666-9_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T00:34:00Z","timestamp":1744158840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33666-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642336652","9783642336669"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33666-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}