{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:29:42Z","timestamp":1743067782123,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319929699"},{"type":"electronic","value":"9783319929705"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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-92970-5_2","type":"book-chapter","created":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T08:54:12Z","timestamp":1527584052000},"page":"21-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["From Software Specifications to Constraint Programming"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Hallerstede","sequence":"first","affiliation":[]},{"given":"Miran","family":"Hasanagi\u0107","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Krings","sequence":"additional","affiliation":[]},{"given":"Peter Gorm","family":"Larsen","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Leuschel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,30]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139195881","volume-title":"Modeling in Event-B \u2013 System and Software Engineering","author":"JR Abrial","year":"2010","unstructured":"Abrial, J.R.: Modeling in Event-B \u2013 System and Software Engineering. Cambridge University Press, Cambridge (2010)"},{"key":"2_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1674-2","volume-title":"Refinement Calculus: A Systematic Introduction","author":"RJ Back","year":"1998","unstructured":"Back, R.J., von Wright, J.: Refinement Calculus: A Systematic Introduction. Springer, New York (1998). \nhttps:\/\/doi.org\/10.1007\/978-1-4612-1674-2"},{"issue":"4","key":"2_CR3","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0012-365X(75)90079-5","volume":"12","author":"A Bruen","year":"1975","unstructured":"Bruen, A., Dixon, R.: The n-queens problem. Discrete Math. 12(4), 393\u2013395 (1975)","journal-title":"Discrete Math."},{"key":"2_CR4","unstructured":"Couto, L.D., Foster, S., Payne, R.J.: Towards verification of constituent systems through automated proof. CoRR abs\/1404.7792 (2014)"},{"key":"2_CR5","series-title":"Workshops in Computing","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-1-4471-3877-8_5","volume-title":"Z User Workshop","author":"AJJ Dick","year":"1990","unstructured":"Dick, A.J.J., Krause, P.J., Cozens, J.: Computer aided transformation of Z into prolog. In: Nicholls, J.E. (ed.) Z User Workshop. Workshops in Computing, pp. 71\u201385. Springer, London (1990). \nhttps:\/\/doi.org\/10.1007\/978-1-4471-3877-8_5"},{"issue":"5","key":"2_CR6","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1049\/sej.1992.0033","volume":"7","author":"NE Fuchs","year":"1992","unstructured":"Fuchs, N.E.: Specifications are (preferably) executable. Softw. Eng. J. 7(5), 323\u2013334 (1992)","journal-title":"Softw. Eng. J."},{"key":"2_CR7","unstructured":"Gomes, C.P., Selman, B., Kautz, H.A.: Boosting combinatorial search through randomization. In: Mostow, J., Rich, C. (eds.) AAAI, pp. 431\u2013437. AAAI Press\/MIT Press (1998)"},{"issue":"4\u20135","key":"2_CR8","first-page":"767","volume":"11","author":"S Hallerstede","year":"2011","unstructured":"Hallerstede, S., Leuschel, M.: Constraint-based deadlock checking of high-level specifications. TPLP 11(4\u20135), 767\u2013782 (2011)","journal-title":"TPLP"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-319-33600-8_10","volume-title":"Abstract State Machines, Alloy, B, TLA, VDM, and Z","author":"D Hansen","year":"2016","unstructured":"Hansen, D., Schneider, D., Leuschel, M.: Using B and ProB for data validation projects. In: Butler, M., Schewe, K.-D., Mashkoor, A., Biro, M. (eds.) ABZ 2016. LNCS, vol. 9675, pp. 167\u2013182. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-33600-8_10"},{"issue":"6","key":"2_CR10","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1049\/sej.1989.0045","volume":"4","author":"I Hayes","year":"1989","unstructured":"Hayes, I., Jones, C.B.: Specifications are not (necessarily) executable. Softw. Eng. J. 4(6), 330\u2013338 (1989)","journal-title":"Softw. Eng. J."},{"key":"2_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8596-5","volume-title":"A Practical Theory of Programming","author":"ECR Hehner","year":"1993","unstructured":"Hehner, E.C.R.: A Practical Theory of Programming. Springer, New York (1993). \nhttps:\/\/doi.org\/10.1007\/978-1-4419-8596-5"},{"key":"2_CR12","volume-title":"Constraint-Based Local Search","author":"PV Hentenryck","year":"2009","unstructured":"Hentenryck, P.V., Michel, L.: Constraint-Based Local Search. MIT Press, Cambridge (2009)"},{"key":"2_CR13","unstructured":"van Hoeve, W.J.: The all different constraint: a survey. arXiv cs\/0105015 (2001)"},{"key":"2_CR14","volume-title":"Systematic Software Development Using VDM","author":"CB Jones","year":"1990","unstructured":"Jones, C.B.: Systematic Software Development Using VDM. Prentice Hall, Englewood Cliffs (1990)"},{"issue":"1","key":"2_CR15","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/181577.181582","volume":"29","author":"A Kans","year":"1994","unstructured":"Kans, A., Hayton, C.: Using ABC to prototype VDM specifications. SIGPLAN Not. 29(1), 27\u201336 (1994)","journal-title":"SIGPLAN Not."},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-319-73305-0_5","volume-title":"Practical Aspects of Declarative Languages","author":"S Krings","year":"2018","unstructured":"Krings, S., Leuschel, M., K\u00f6rner, P., Hallerstede, S., Hasanagi\u0107, M.: Three is a crowd: SAT, SMT and CLP on a chessboard. In: Calimeri, F., Hamlen, K., Leone, N. (eds.) PADL 2018. LNCS, vol. 10702, pp. 63\u201379. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-73305-0_5"},{"issue":"2","key":"2_CR17","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s10009-007-0063-9","volume":"10","author":"M Leuschel","year":"2008","unstructured":"Leuschel, M., Butler, M.J.: ProB: an automated analysis toolset for the B method. STTT 10(2), 185\u2013203 (2008)","journal-title":"STTT"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-662-43652-3_8","volume-title":"International Conference on Abstract State Machines, Alloy, B, TLA, VDM, and Z","author":"M Leuschel","year":"2014","unstructured":"Leuschel, M., Schneider, D.: Towards B as a high-level constraint modelling language \u2013 solving the jobs puzzle challenge. In: Ameur, Y.A., Schewe, K.D. (eds.) ABZ 2014. LNCS, vol. 8477, pp. 101\u2013116. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-43652-3_8"},{"key":"2_CR19","volume-title":"Programming From Specifications","author":"CC Morgan","year":"1994","unstructured":"Morgan, C.C.: Programming From Specifications, 2nd edn. Prentice Hall, Englewood Cliffs (1994)","edition":"2"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL: A Proof Assistant for Higher-Order Logic","year":"2002","unstructured":"Nipkow, T., Wenzel, M., Paulson, L.C. (eds.): Isabelle\/HOL: A Proof Assistant for Higher-Order Logic. LNCS, vol. 2283. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-45949-9"},{"key":"2_CR21","unstructured":"Odersky, M., al.: An Overview of the Scala Programming Language. Technical report. IC\/2004\/64, EPFL, Lausanne, Switzerland (2004)"},{"key":"2_CR22","unstructured":"OscaR Team: OscaR: Scala in OR (2012). \nbitbucket.org\/oscarlib"},{"key":"2_CR23","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02432151","volume":"2","author":"FJ Pelletier","year":"1986","unstructured":"Pelletier, F.J.: Seventy-five problems for testing automatic theorem provers. J. Autom. Reason. 2, 191\u2013216 (1986)","journal-title":"J. Autom. Reason."},{"key":"2_CR24","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511663079","volume-title":"Data Refinement: Model-oriented Proof Theories and their Comparison","author":"WP Roever de","year":"1998","unstructured":"de Roever, W.P., Engelhardt, K.: Data Refinement: Model-oriented Proof Theories and their Comparison, vol. 46. Cambridge University Press, Cambridge (1998)"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/978-3-642-24559-6_42","volume-title":"Formal Methods and Software Engineering","author":"M Schmalz","year":"2011","unstructured":"Schmalz, M.: Term rewriting in logics of partial functions. In: Qin, S., Qiu, Z. (eds.) ICFEM 2011. LNCS, vol. 6991, pp. 633\u2013650. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-24559-6_42"},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-319-19249-9_30","volume-title":"FM 2015: Formal Methods","author":"D Schneider","year":"2015","unstructured":"Schneider, D., Leuschel, M., Witt, T.: Model-based problem solving for university timetable validation and improvement. In: Bj\u00f8rner, N., de Boer, F. (eds.) FM 2015. LNCS, vol. 9109, pp. 487\u2013495. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-19249-9_30"},{"issue":"5","key":"2_CR27","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"JPM Silva","year":"1999","unstructured":"Silva, J.P.M., Sakallah, K.A.: GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48(5), 506\u2013521 (1999)","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92970-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T12:55:18Z","timestamp":1532091318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-92970-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319929699","9783319929705"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92970-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}