{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:23:08Z","timestamp":1725492188224},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749691"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74970-7_19","type":"book-chapter","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T19:49:08Z","timestamp":1191959348000},"page":"241-255","source":"Crossref","is-referenced-by-count":6,"title":["An Abstract Interpretation Based Combinator for Modelling While Loops in Constraint Programming"],"prefix":"10.1007","author":[{"given":"Tristan","family":"Denmat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Gotlieb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mireille","family":"Ducass\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/3-540-44898-5_19","volume-title":"Static Analysis","author":"R. Bagnara","year":"2003","unstructured":"Bagnara, R., Hill, P.M., Ricci, E., Zaffanella, E.: Precise widening operators for convex polyhedra. In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, pp. 337\u2013354. Springer, Heidelberg (2003)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-45789-5_17","volume-title":"Static Analysis","author":"R. Bagnara","year":"2002","unstructured":"Bagnara, R., Ricci, E., Zaffanella, E., Hill, P.M.: Possibly not closed convex polyhedra and the parma polyhedra library. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 213\u2013229. Springer, Heidelberg (2002)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11889205_7","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"N. Beldiceanu","year":"2006","unstructured":"Beldiceanu, N., Carlsson, M., Demassey, S., Petit, T.: Graph properties based filtering. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 59\u201374. Springer, Heidelberg (2006)"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/978-3-540-30201-8_11","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"N. Beldiceanu","year":"2004","unstructured":"Beldiceanu, N., Carlsson, M., Petit, T.: Deriving filtering algorithms from constraint checkers. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 107\u2013122. Springer, Heidelberg (2004)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BFb0033845","volume-title":"Programming Languages: Implementations, Logics, and Programs","author":"M. Carlsson","year":"1997","unstructured":"Carlsson, M., Ottosson, G., Carlson, B.: An open-ended finite domain constraint solver. In: Hartel, P.H., Kuchen, H. (eds.) PLILP 1997. LNCS, vol.\u00a01292, pp. 191\u2013206. Springer, Heidelberg (1997)"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1145\/512950.512973","volume-title":"POPL 1977","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL 1977. Proc. of Symp. on Principles of Progr. Lang., pp. 238\u2013252. ACM Press, New York (1977)"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/512760.512770","volume-title":"POPL 1978","author":"P. Cousot","year":"1978","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: POPL 1978. Proc. of Symp. on Principles of Progr. Lang., pp. 84\u201396. ACM Press, New York (1978)"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Fruhwirth, T.: Theory and practice of constraint handling rules. Special Issue on Constraint Logic Progr., Journal of Logic Progr.\u00a037(1-3) (1998)","DOI":"10.1016\/S0743-1066(98)10005-5"},{"key":"19_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-44957-4_27","volume-title":"Computational Logic - CL 2000","author":"A. Gotlieb","year":"2000","unstructured":"Gotlieb, A., Botella, B., Rueher, M.: A CLP framework for computing structural test data. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 399\u2013413. Springer, Heidelberg (2000)"},{"key":"19_CR10","unstructured":"Holzbaur, C.: OFAI clp(q,r) Manual. Austrian Research Institute for Artificial Intelligence, Vienna, 1.3.3 edition"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1145\/158511.158685","volume-title":"POPL 1993","author":"K. Marriott","year":"1993","unstructured":"Marriott, K., Stuckey, P.J.: The 3 r\u2019s of optimizing constraint logic programs: Refinement, removal and reordering. In: POPL 1993. Proc. of Symp. on Principles of Progr. Lang., pp. 334\u2013344. ACM Press, New York (1993)"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"G.P. McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: Part 1 - convex underestimating problems. Math. Progr.\u00a010, 147\u2013175 (1976)","journal-title":"Math. Progr."},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10990-006-8609-1","volume":"19","author":"A. Min\u00e9","year":"2006","unstructured":"Min\u00e9, A.: The octagon abstract domain. Higher-Order and Symbolic Computation Journal\u00a019, 31\u2013100 (2006)","journal-title":"Higher-Order and Symbolic Computation Journal"},{"key":"19_CR14","unstructured":"Le Provost, T., Wallace, M.: Domain independent propagation. In: FGCS 1992. Proc. of the Int. Conf. on Fifth Generation Computer Systems, pp. 1004\u20131011 (1992)"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/11609773_8","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S. Sankaranarayanan","year":"2005","unstructured":"Sankaranarayanan, S., Col\u00f2n, M.A., Sipma, H., Manna, Z.: Efficient strongly relational polyhedral analysis. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.\u00a03855, pp. 115\u2013125. Springer, Heidelberg (2005)"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-45619-8_16","volume-title":"Logic Programming","author":"J. Schimpf","year":"2002","unstructured":"Schimpf, J.: Logical loops. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol.\u00a02401, pp. 224\u2013238. Springer, Heidelberg (2002)"},{"key":"19_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/11754602_9","volume-title":"Recent Advances in Constraints","author":"C. Schulte","year":"2006","unstructured":"Schulte, C., Tack, G.: Views and iterators for generic constraint implementations. In: Hnich, B., Carlsson, M., Fages, F., Rossi, F. (eds.) CSCLP 2005. LNCS (LNAI), vol.\u00a03978, pp. 118\u2013132. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74970-7_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:49:13Z","timestamp":1619506153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74970-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749691"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74970-7_19","relation":{},"subject":[]}}