{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:39:24Z","timestamp":1725680364520},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298271"},{"type":"electronic","value":"9783642298288"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29828-8_2","type":"book-chapter","created":{"date-parts":[[2012,5,14]],"date-time":"2012-05-14T07:59:40Z","timestamp":1336982380000},"page":"17-33","source":"Crossref","is-referenced-by-count":2,"title":["fdcc: A Combined Approach for Solving Constraints over Finite Domains and Arrays"],"prefix":"10.1007","author":[{"given":"S\u00e9bastien","family":"Bardin","sequence":"first","affiliation":[]},{"given":"Arnaud","family":"Gotlieb","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/11513988_34","volume-title":"Computer Aided Verification","author":"M. Bozzano","year":"2005","unstructured":"Bozzano, M., Bruttomesso, R., Cimatti, A., Junttila, T.A., Ranise, S., van Rossum, P., Sebastiani, R.: Efficient Satisfiability Modulo Theories via Delayed Theory Combination. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 335\u2013349. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Bruttomesso, R., Cimatti, A., Franz\u00e9n, A., Griggio, A., Sebastiani, R.: Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis. Ann. Math. Artif. Intell.\u00a055(1-2) (2009)","key":"2_CR2","DOI":"10.1007\/s10472-009-9152-7"},{"doi-asserted-by":"crossref","unstructured":"Bardin, S., Herrmann, P.: Structural testing of executables. In: 1th Int. Conf. on Soft. Testing, Verif. and Valid. (ICST 2008), pp. 22\u201331 (2008)","key":"2_CR3","DOI":"10.1109\/ICST.2008.8"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-12002-2_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Bardin","year":"2010","unstructured":"Bardin, S., Herrmann, P., Perroud, F.: An Alternative to SAT-Based Approaches for Bit-Vectors. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 84\u201398. Springer, Heidelberg (2010)"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10601-005-2809-x","volume":"10","author":"N. Beldiceanu","year":"2005","unstructured":"Beldiceanu, N., Carlsson, M., Debruyne, R., Petit, T.: Reformulation of global constraints based on constraints checkers. Constraints\u00a010, 339\u2013362 (2005)","journal-title":"Constraints"},{"issue":"2","key":"2_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/stvr.333","volume":"16","author":"B. Botella","year":"2006","unstructured":"Botella, B., Gotlieb, A., Michel, C.: Symbolic execution of floating-point computations. The Software Testing, Verification and Reliability Journal\u00a016(2), 97\u2013121 (2006)","journal-title":"The Software Testing, Verification and Reliability Journal"},{"unstructured":"Brand, S.: Constraint propagation in presence of arrays. In: 6th Workshop of the ERCIM Working Group on Constraints, Computing Research Repository (2001)","key":"2_CR7"},{"doi-asserted-by":"crossref","unstructured":"Brummayer, R., Biere, A.: Lemmas on demand for the extensional theory of arrays. In: SMT 2008\/BPR 2008, pp. 6\u201311. ACM (2008)","key":"2_CR8","DOI":"10.1145\/1512464.1512467"},{"doi-asserted-by":"crossref","unstructured":"Carlsson, M., Ottosson, G., Carlson, B.: An open\u2013ended finite domain constraint solver. In: Proc. of Programming Languages: Implementations, Logics, and Programs (1997)","key":"2_CR9","DOI":"10.1007\/BFb0033845"},{"issue":"11","key":"2_CR10","doi-asserted-by":"publisher","first-page":"1755","DOI":"10.1016\/j.jss.2009.06.029","volume":"82","author":"F. Charreteur","year":"2009","unstructured":"Charreteur, F., Botella, B., Gotlieb, A.: Modelling dynamic memory management in constraint-based testing. The Journal of Systems and Software\u00a082(11), 1755\u20131766 (2009); Special Issue: TAIC-PART 2007 and MUTATION 2007","journal-title":"The Journal of Systems and Software"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-540-85958-1_22","volume-title":"Principles and Practice of Constraint Programming","author":"H. Collavizza","year":"2008","unstructured":"Collavizza, H., Rueher, M., Van Hentenryck, P.: CPBPV: A Constraint-Programming Framework for Bounded Program Verification. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 327\u2013341. Springer, Heidelberg (2008)"},{"issue":"2","key":"2_CR12","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.entcs.2008.04.079","volume":"198","author":"L. Moura de","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Model-based theory combination. Electron. Notes Theor. Comput. Sci.\u00a0198(2), 37\u201349 (2008)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"2_CR13","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. Moura de","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.S.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 337\u2013340. Springer, Heidelberg (2008)"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/322092.322104","volume":"25","author":"P.J. Downey","year":"1978","unstructured":"Downey, P.J., Sethi, R.: Assignment commands with array references. J. ACM\u00a025, 652\u2013666 (1978)","journal-title":"J. ACM"},{"key":"2_CR15","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)"},{"unstructured":"Gotlieb, A., Leconte, M., Marre, B.: Constraint solving on modular integers. In: Proc. of the 9th Int. Workshop on Constraint Modelling and Reformulation (ModRef 2010), co-located with CP 2010, St Andrews, Scotland (September 2010) XX^em","key":"2_CR16"},{"unstructured":"Van Hentenryck, P., Carillon, J.-P.: Generality versus specificity: An experience with ai and or techniques. In: Proc. of AAAI 1988, pp. 660\u2013664. AAAI Press\/The MIT Press (1988)","key":"2_CR17"},{"unstructured":"Kroening, D., Strichman, O.: Decision Procedures: An Algorithmic Point of View (2008)","key":"2_CR18"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"2076","DOI":"10.1137\/S0036142903436174","volume":"42","author":"Y. Lebbah","year":"2005","unstructured":"Lebbah, Y., Michel, C., Rueher, M., Daney, D.: Efficient and safe global constraints for handling numerical constraint systems. SIAM J. Numer. Anal.\u00a042, 2076\u20132097 (2005)","journal-title":"SIAM J. Numer. Anal."},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.entcs.2004.12.010","volume":"111","author":"B. Marre","year":"2005","unstructured":"Marre, B., Blanc, B.: Test selection strategies for lustre descriptions in gatel. Electronic Notes in Theoretical Computer Science\u00a0111, 93\u2013111 (2005)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Michel, L., Van Hentenryck, P.: Constraint-Based Local Search. MIT Press (2005)","key":"2_CR21","DOI":"10.1007\/11889205_26"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/357073.357079","volume":"1","author":"G. Nelson","year":"1979","unstructured":"Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Trans. Program. Lang. Syst.\u00a01, 245\u2013257 (1979)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"2_CR23","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1145\/322186.322198","volume":"27","author":"G. Nelson","year":"1980","unstructured":"Nelson, G., Oppen, D.C.: Fast decision procedures based on congruence closure. J. ACM\u00a027(2), 356\u2013364 (1980)","journal-title":"J. ACM"},{"unstructured":"R\u00e9gin, J.-C.: A filtering algorithm for constraints of difference in csps. In: Proc. of the Twelfth National Conference on Artificial Intelligence, AAAI 1994, vol.\u00a01, pp. 362\u2013367 (1994)","key":"2_CR24"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-69149-5_18","volume-title":"Verified Software: Theories, Tools, Experiments","author":"J. Rushby","year":"2008","unstructured":"Rushby, J.: Automated Test Generation and Verified Software. In: Meyer, B., Woodcock, J. (eds.) VSTTE 2005. LNCS, vol.\u00a04171, pp. 161\u2013172. Springer, Heidelberg (2008)"},{"issue":"1","key":"2_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1452044.1452046","volume":"31","author":"C. Schulte","year":"2008","unstructured":"Schulte, C., Stuckey, P.J.: Efficient constraint propagation engines. Transactions on Programming Languages and Systems\u00a031(1), 2:1\u20132:43 (2008)","journal-title":"Transactions on Programming Languages and Systems"},{"issue":"6","key":"2_CR27","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1017\/S1471068403001741","volume":"3","author":"P. Roy Van","year":"2003","unstructured":"Van Roy, P., Brand, P., Duchier, D., Haridi, S., Henz, M., Schulte, C.: Logic programming in the context of multiparadigm programming: the Oz experience. Theory and Practice of Logic Programming\u00a03(6), 715\u2013763 (2003)","journal-title":"Theory and Practice of Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29828-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:37:25Z","timestamp":1558312645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29828-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298271","9783642298288"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29828-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}