{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T17:27:04Z","timestamp":1750440424044,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221524"},{"type":"electronic","value":"9783540259510"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25951-0_3","type":"book-chapter","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T06:46:58Z","timestamp":1280904418000},"page":"66-89","source":"Crossref","is-referenced-by-count":2,"title":["Developing Logic Programs from Specifications Using Stepwise Refinement"],"prefix":"10.1007","author":[{"given":"Robert","family":"Colvin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lindsay","family":"Groves","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian J.","family":"Hayes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Hemer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ray","family":"Nickson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Strooper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Back, R.-J.: Correctness preserving program refinements: Proof theory and applications. Tract 131, Mathematisch Centrum, Amsterdam (1980)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/BF00291051","volume":"25","author":"R.J.R. Back","year":"1988","unstructured":"Back, R.J.R.: A calculus of refinements for program derivations. Acta Informatica\u00a025, 593\u2013624 (1988)","journal-title":"Acta Informatica"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Basin, D., Deville, Y., Flener, P., Hamfelt, A., Nilsson, J.F.: Synthesis of programs in computational logic. In: Ten years of LOPSTR 2004 (2004)","DOI":"10.1007\/978-3-540-25951-0_2"},{"key":"3_CR4","unstructured":"Clark, K.: The synthesis and verification of logic programs. Research report, Imperial College (1978)"},{"key":"3_CR5","unstructured":"Colvin, R., Hayes, I., Hemer, D., Strooper, P.: Translating refined logic programs to Mercury. In: Oudshoorn, M. (ed.) Proceedings of the Twenty-Fifth Australasian Computer Science Conference, January 2002. Conferences in Research and Practice in Information Technology, vol.\u00a04, pp. 33\u201340. Australian Computer Society (2002)"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/3-540-45142-0_3","volume-title":"Logic Based Program Synthesis and Transformation","author":"R. Colvin","year":"2001","unstructured":"Colvin, R., Hayes, I., Strooper, P.: A technique for modular logic program refinement. In: Lau, K.-K. (ed.) LOPSTR 2000. LNCS, vol.\u00a02042, pp. 38\u201356. Springer, Heidelberg (2001)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-45013-0_11","volume-title":"Logic Based Program Synthesis and Transformation","author":"R. Colvin","year":"2003","unstructured":"Colvin, R., Hayes, I.J., Hemer, D., Strooper, P.A.: Refinement of higher-order logic programs. In: Leuschel, M. (ed.) LOPSTR 2002. LNCS, vol.\u00a02664, pp. 126\u2013143. Springer, Heidelberg (2003)"},{"key":"3_CR8","series-title":"Discrete Mathematics and Theoretical Computer Science","first-page":"100","volume-title":"International Refinement Workshop and Formal Methods Pacific 1998","author":"R. Colvin","year":"1998","unstructured":"Colvin, R., Hayes, I.J., Strooper, P.: Data refining logic programs. In: Grundy, J., Schwenke, M., Vickers, T. (eds.) International Refinement Workshop and Formal Methods Pacific 1998. Discrete Mathematics and Theoretical Computer Science, pp. 100\u2013116. Springer, Heidelberg (1998)"},{"key":"3_CR9","unstructured":"Colvin, R.: Contextual and Data Refinement for the Refinement Calculus for Logic Programs. PhD thesis, School of Information Technology and Electrical Engineering, University of Queensland (August. 2002)"},{"key":"3_CR10","volume-title":"Logic Programming: Systematic Program Development","author":"Y. Deville","year":"1990","unstructured":"Deville, Y.: Logic Programming: Systematic Program Development. Addison-Wesley, Reading (1990)"},{"issue":"20","key":"3_CR11","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0743-1066(94)90029-9","volume":"19","author":"Y. Deville","year":"1994","unstructured":"Deville, Y., Lau, K.-K.: Logic program synthesis. Journal of Logic Programming\u00a019(20), 321\u2013350 (1994); Special Issue: Ten Years of Logic Programming","journal-title":"Journal of Logic Programming"},{"issue":"4-5","key":"3_CR12","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1017\/S1471068402001448","volume":"2","author":"J. Hayes","year":"2002","unstructured":"Hayes, J., Colvin, R., Hemer, D., Nickson, R., Strooper, P.A.: A refinement calculus for logic programs. Theory and Practice of Logic Programming\u00a02(4-5), 425\u2013460 (2002)","journal-title":"Theory and Practice of Logic Programming"},{"key":"3_CR13","first-page":"103","volume-title":"Proc. Formal Methods Pacific (FMP 1997), Discrete Mathematics and Theoretical Computer Science","author":"D. Hemer","year":"1997","unstructured":"Hemer, D.: An algorithm for pattern-matching mathematical expressions. In: Groves, L., Reeves, S. (eds.) Proc. Formal Methods Pacific (FMP 1997), Discrete Mathematics and Theoretical Computer Science, July 1997, pp. 103\u2013123. Springer, Heidelberg (1997)"},{"key":"3_CR14","series-title":"Electronic Notes in Computer Science (ENTCS)","volume-title":"Proceeding of Computing: the Australasian Theory Symposium","author":"D. Hemer","year":"2002","unstructured":"Hemer, D., Colvin, R., Hayes, I., Strooper, P.: Don\u2019t care non-determinism in logic program refinement. In: Harland, J. (ed.) Proceeding of Computing: the Australasian Theory Symposium, January 2002. Electronic Notes in Computer Science (ENTCS), vol.\u00a061, Elsevier Science, Amsterdam (2002), \n                      http:\/\/www.elsevier.nl\/locate\/entcs\/volume61.html"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/3-540-44755-5_18","volume-title":"Theorem Proving in Higher Order Logics","author":"D. Hemer","year":"2001","unstructured":"Hemer, D., Hayes, I., Strooper, P.: Refinement Calculus for Logic Programming in Isabelle\/HOL. In: Boulton, R.J., Jackson, P.B. (eds.) TPHOLs 2001. LNCS, vol.\u00a02152, pp. 249\u2013264. Springer, Heidelberg (2001)"},{"issue":"2","key":"3_CR16","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/322248.322258","volume":"28","author":"C.J. Hogger","year":"1981","unstructured":"Hogger, C.J.: Derivation of logic programs. Journal of the ACM\u00a028(2), 372\u2013392 (1981)","journal-title":"Journal of the ACM"},{"key":"3_CR17","unstructured":"Jacquet, J.-M. (ed.): Constructing Logic Programs. Wiley Professional Computing (1993)"},{"issue":"3","key":"3_CR18","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0743-1066(96)00128-8","volume":"30","author":"K.-K. Lau","year":"1997","unstructured":"Lau, K.-K., Ornaghi, M.: The relationship between logic programs and specifications \u2014 the subset example revisited. J. Logic Programming\u00a030(3), 239\u2013257 (1997)","journal-title":"J. Logic Programming"},{"key":"3_CR19","unstructured":"Marakakis, E.I.: Logic Program Development Based on Typed Moded Schemata and Data Types. PhD thesis, Department of Computer Science, University of Bristol (February 1997)"},{"key":"3_CR20","volume-title":"Programming from Specifications","author":"C.C. Morgan","year":"1994","unstructured":"Morgan, C.C.: Programming from Specifications, 2nd edn. Prentice Hall, Englewood Cliffs (1994)","edition":"2"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Morgan, C.C., Robinson, K.A.: Specification statements and refinement. IBM Journal of Research and Development\u00a031(5) (September 1987)","DOI":"10.1147\/rd.315.0546"},{"issue":"3","key":"3_CR22","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0167-6423(87)90011-6","volume":"9","author":"J.M. Morris","year":"1987","unstructured":"Morris, J.M.: A theoretical basis for stepwise refinement and the programming calculus. Science of Computer Programming\u00a09(3), 287\u2013306 (1987)","journal-title":"Science of Computer Programming"},{"key":"3_CR23","first-page":"69","volume-title":"Proc. of LOPSTR 1991, Workshops in Computing","author":"M.G. Read","year":"1991","unstructured":"Read, M.G., Kazmierczak, E.A.: Formal program development in Modular Prolog: A case study. In: Clement, T.P., Lau, K.-K. (eds.) Proc. of LOPSTR 1991, Workshops in Computing, pp. 69\u201393. Springer, Heidelberg (1991)"},{"key":"3_CR24","unstructured":"Somogyi, Z., Henderson, F.J., Conway, T.C.: Mercury, an efficient purely declarative logic programming language. In: Kotagiri, R. (ed.) Proceedings of the Eighteenth Australasian Computer Science Conference, Glenelg, South Australia, pp. 499\u2013512 (1995), Australian Computer Science Communications"}],"container-title":["Lecture Notes in Computer Science","Program Development in Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25951-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T23:49:11Z","timestamp":1675900151000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-25951-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221524","9783540259510"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25951-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}