{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T00:11:46Z","timestamp":1675901506415},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540421276","type":"print"},{"value":"9783540451426","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45142-0_3","type":"book-chapter","created":{"date-parts":[[2007,7,31]],"date-time":"2007-07-31T21:17:34Z","timestamp":1185916654000},"page":"38-56","source":"Crossref","is-referenced-by-count":2,"title":["A Technique for Modular Logic Program Refinement"],"prefix":"10.1007","author":[{"given":"Robert","family":"Colvin","sequence":"first","affiliation":[]},{"given":"Ian","family":"Hayes","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Strooper","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,5,2]]},"reference":[{"key":"3_CR1","unstructured":"P. Bancroft and I. J. Hayes. Refining a module with opaque types. In Gopal Gupta, George Mohay, and Rodney Topor, editors, Proceedings, 16th Australian Computer Science Conference, Bris b ane, Australian Computer Science Communications, volume 15(1), pages 615\u2013624, February 1993."},{"key":"3_CR2","unstructured":"R. Colvin, I. J. Hayes, and P. Strooper. Data refining logic programs. In J. Grundy, M. Schwenke, and T. Vickers, editors, International Refinement Workshop and Formal Methods Pacific 1998, Discrete Mathematics and Theoretical Computer Science, pages 100\u2013116. Springer, 1998."},{"key":"3_CR3","unstructured":"R. Colvin, I. J. Hayes, and P. Strooper. Refining logic programs using types. In J. Edwards, editor, Australasian Computer Science Conference (ACSC 2000), pages 43\u201350. IEEE Computer Society, 2000. For an extended version see SVRCTR-99-25."},{"issue":"20","key":"3_CR4","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0743-1066(94)90029-9","volume":"19","author":"Y. Deville","year":"1994","unstructured":"Y. Deville and K.-K. Lau. Logic program synthesis. Journal of Logic Programming, 19,20:321\u2013350, 1994. Special Issue: Ten Years of Logic Programming.","journal-title":"Journal of Logic Programming"},{"key":"3_CR5","unstructured":"Yves Deville. Logic Programming: Systematic Program Development. International series in logic programming. Addison-Wesley, 1990."},{"key":"3_CR6","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Logic Program Synthesis and Transformation. Proc. of the 6th Int. Workshop, LOPSTR\u201996, Stockholm, Sweden, August 1996","author":"I. Hayes","year":"1997","unstructured":"I. Hayes, R. Nickson, and P. Strooper. Refining specifications to logic programs. In J. Gallagher, editor, Logic Program Synthesis and Transformation. Proc. of the 6th Int. Workshop, LOPSTR\u201996, Stockholm, Sweden, August 1996, volume 1207 of Lecture Notes in Computer Science, pages 1\u201319. Springer, 1997."},{"key":"3_CR7","unstructured":"I. Hayes, R. Nickson, P. Strooper, and R. Colvin. Ad eclarative semantics for logic program refinement. Technical Report 00-30, Software Verification Research Centre, The University of Queensland, 2000."},{"key":"3_CR8","unstructured":"D. Hemer. Building tool support for refinement calculus for logic programming: Acom parison of interactive theorem provers. Technical Report 00-06, Software Verification Research Centre, The University of Queensland, 2000."},{"key":"3_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-58792-6_7","volume-title":"Proc. LOPSTR 94 and META 94","author":"K.-K. Lau","year":"1994","unstructured":"K.-K. Lau and M. Ornaghi. On specification frameworks and deductive synthesis of logic programs. In L. Fribourg and F. Turini, editors, Proc. LOPSTR 94 and META 94, Lecture Notes in Computer Science 883, pages 104\u2013121. Springer-Verlag, 1994."},{"key":"3_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/3-540-62718-9_17","volume-title":"Logic Program Synthesis and Transformation. Proc. of the 6th Int. Workshop, LOPSTR\u201996, Stockholm, Sweden, August 1996","author":"K.-K. Lau","year":"1997","unstructured":"K.-K Lau and M. Ornaghi. Forms of logic specifications: Ap reliminary study. In J. Gallagher, editor, Logic Program Synthesis and Transformation. Proc. of the 6th Int. Workshop, LOPSTR\u201996, Stockholm, Sweden, August 1996, volume 1207 of Lecture Notes in Computer Science, pages 295\u2013312. Springer, 1997."},{"key":"3_CR11","unstructured":"B. Liskov and J. Guttag. Abstraction and Specification in Program Development. MIT Press, third edition, 1986."},{"key":"3_CR12","unstructured":"C. C. Morgan. Programming from Specifications. Prentice Hall, second edition, 1994."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"M. G. Read and E. Kazmierczak. Formal program development in modular Prolog. In T. P. Clement and K.-K. Lau, editors, Logic Program Synthesis and Transformation. Proc. of LOPSTR\u201991, University of Manchester, July 1991, Workshops in Computing, pages 69\u201393. Springer-Verlag, 1992.","DOI":"10.1007\/978-1-4471-3494-7_6"},{"key":"3_CR14","unstructured":"Z. Somogyi, F. J. Henderson, and T. C. Conway. Mercury, an efficient purely declarative logic programming language. In R. Kotagiri, editor, Proc. of the Eighteenth Australasian Computer Science Conference, pages 499\u2013512, Glenelg, South Australia, 1995. Australian Computer Science Communications."},{"key":"3_CR15","unstructured":"J. M. Spivey. The Z Notation: A Reference Manual. Prentice Hall, second edition, 1992."},{"key":"3_CR16","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the Conference on Mathematics of Program Construction","author":"Y. V. Srinivas","year":"1995","unstructured":"Y. V. Srinivas and R. Jullig. Specware: Formal support for composing software. In Bernhard Moller, editor, Proceedings of the Conference on Mathematics of Program Construction, volume 947 of Lecture Notes in Computer Science. Kloster Irsee, Germany, 1995."},{"key":"3_CR17","unstructured":"W. M. Turski and T. S. E. Maibaum. Specification of Computer Programs. Addison-Wesley, 1987."}],"container-title":["Logic Based Program Synthesis and Transformation","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45142-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:27:21Z","timestamp":1556713641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45142-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540421276","9783540451426"],"references-count":17,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-45142-0_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[2001]]}}}