{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:08:32Z","timestamp":1725890912978},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650744"},{"type":"electronic","value":"9783540496748"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49674-2_7","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T05:41:54Z","timestamp":1187070114000},"page":"128-147","source":"Crossref","is-referenced-by-count":9,"title":["On Correct Program Schemas"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Flener","sequence":"first","affiliation":[]},{"given":"Kung-Kiu","family":"Lau","sequence":"additional","affiliation":[]},{"given":"Mario","family":"Ornaghi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1998,11,18]]},"reference":[{"key":"7_CR1","unstructured":"D. Barker-Plummer. Cliche Programming in Prolog. In M. Bruynooghe, editor, Proc. META 90, pages 246\u2013256, 1992."},{"key":"7_CR2","unstructured":"E. Chasseur and Y. Deville. Logic program schemas, semi-unification and constraints. This volume."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"N. Dershowitz. The Evolution of Programs. Birkh\u00e4user, 1983.","DOI":"10.1007\/978-1-4612-5621-2"},{"key":"7_CR4","unstructured":"Y. Deville and J. Burnay. Generalization and program schemata: A step towards computer-aided construction of logic programs. In E.L. Lusk and R.A. Overbeek, editors, Proc. NACLP\u201989, pages 409\u2013425. MIT Press, 1989."},{"key":"7_CR5","unstructured":"Y. Deville. Logic Programming: Systematic Program Development. Addison-Wesley, 1990."},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"P. Flener. Logic Program Synthesis from Incomplete Information. Kluwer, 1995.","DOI":"10.1007\/978-1-4615-2205-8"},{"key":"7_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/3-540-60939-3_13","volume-title":"Proc. LOPSTR\u201995","author":"P. Flener","year":"1996","unstructured":"P. Flener and Y. Deville. Logic program transformation through generalization schemata. In M. Proietti, editor, Proc. LOPSTR\u201995, pages 171\u2013173. LNCS 1048, Springer-Verlag, 1996."},{"key":"7_CR8","series-title":"Tech Rep","volume-title":"Program Schemas as Steadfast Programs and their Usage in Deductive Synthesis","author":"P. Flener","year":"1997","unstructured":"P. Flener and K.-K. Lau. Program Schemas as Steadfast Programs and their Usage in Deductive Synthesis. Tech Rep BU-CEIS-9705, Bilkent University, Ankara, Turkey, 1997."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"P. Flener, K.-K. Lau, and M. Ornaghi, Correct-schema-guided Synthesis of Steadfast Programs, Proc. 12th IEEE International Automated Software Engineering Conference, pages 153\u2013160, IEEE Computer Society, 1997.","DOI":"10.1109\/ASE.1997.632835"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"T. S. Gegg-Harrison. Representing logic program schemata in \u03bb-Prolog. In L. Sterling, editor, Proc. ICLP\u201995, pages 467\u2013481. MIT Press, 1995.","DOI":"10.7551\/mitpress\/4298.003.0049"},{"key":"7_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-62718-9_15","volume-title":"Proc. LOPSTR\u201996","author":"T. S. Gegg-Harrison","year":"1997","unstructured":"T. S. Gegg-Harrison. Extensible Logic Program Schemata. In J. Gallagher, editor, Proc. LOPSTR\u201996, LNCS 1207, pages 256\u2013274, Springer-Verlag, 1997."},{"key":"7_CR12","unstructured":"J. A. Goguen, J.W. Thatcher, and E. Wagner. An initial algebra approach to specification, correctness and implementation. In R. Yeh, editor, Current Trends in Programming Methodology, IV, pages 80\u2013149. Prentice-Hall, 1978."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"J. A. Goguen and J. Meseguer. Unifying functional, object-oriented and relational programming with logical semantics. In B. Shriver and P. Wegner, editors, Research Directions in Object-Oriented Programming, pages 417\u2013477. MIT Press, 1987.","DOI":"10.1145\/323779.323755"},{"key":"7_CR14","series-title":"GMD-Studien","first-page":"85","volume-title":"Proc. ILP\u201994","author":"A. Hamfelt","year":"1994","unstructured":"A. Hamfelt and J. Fischer-Nilsson. Inductive metalogic programming. In S. Wrobel, editor, Proc. ILP\u201994, pages 85\u201396. GMD-Studien Nr. 237, Sankt Augustin, Germany, 1994."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"W. Hodges. Logical features of Horn clauses. In D.M. Gabbay, C.J. Hogger, and J.A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 1: Logical Foundations, pages 449\u2013503, Oxford University Press, 1993.","DOI":"10.1093\/oso\/9780198537458.003.0007"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"A.-L. Johansson. Interactive program derivation using program schemata and incrementally generated strategies. In Y. Deville, editor, Proc. LOPSTR\u201993, pages 100\u2013112. Springer-Verlag, 1994.","DOI":"10.1007\/978-1-4471-3234-9_10"},{"key":"7_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/3-540-62718-9_17","volume-title":"Proc. LOPSTR\u201996","author":"K.-K. Lau","year":"1997","unstructured":"K.-K. Lau and M. Ornaghi. Forms of logic specifications: A preliminary study. In J. Gallagher, editor, Proc. LOPSTR\u201996, pages 295\u2013312, LNCS 1207, Springer-Verlag, 1997."},{"key":"7_CR18","unstructured":"K.-K. Lau, M. Ornaghi, and S.-\u00c5. T\u00e4rnlund. The halting problem for deductive synthesis of logic programs. In P. van Hentenryck, editor, Proc. ICLP\u201994, pages 665\u2013683. MIT Press, 1994."},{"key":"7_CR19","unstructured":"K.-K. Lau, M. Ornaghi, and S.-\u00c5. T\u00e4rnlund. Steadfast logic programs. J. Logic Programming, submitted."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 2nd edition, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"7_CR21","unstructured":"Z. Manna. Mathematical Theory of Computation. McGraw-Hill, 1974."},{"key":"7_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/3-540-58792-6_9","volume-title":"Proc. LOP-STR\/META\u201994","author":"E. Marakakis","year":"1994","unstructured":"E. Marakakis and J.P. Gallagher. Schema-based top-down design of logic programs using abstract data types. In L. Fribourg and F. Turini, editors, Proc. LOP-STR\/META\u201994, pages 138\u2013153, LNCS 883, Springer-Verlag, 1994."},{"key":"7_CR23","unstructured":"J. Richardson and N. Fuchs. Development of correct transformational schemata for Prolog programs. This volume."},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"D. Sannella and A. Tarlecki. Essential concepts of algebraic specification and program development. Formal Aspects of Computer Science, forthcoming.","DOI":"10.1007\/BF01211084"},{"issue":"1","key":"7_CR25","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0004-3702(85)90083-9","volume":"27","author":"D. R. Smith","year":"1985","unstructured":"D. R. Smith. Top-down synthesis of divide-and-conquer algorithms. Artificial Intelligence 27(1):43\u201396, 1985.","journal-title":"Artificial Intelligence"},{"issue":"9","key":"7_CR26","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1109\/32.58788","volume":"16","author":"D. R. Smith","year":"1990","unstructured":"D. R. Smith. KIDS: A semiautomatic program development system. IEEE Trans. Software Engineering 16(9):1024\u20131043, 1990.","journal-title":"IEEE Trans. Software Engineering"},{"key":"7_CR27","unstructured":"L. S. Sterling and M. Kirschenbaum. Applying techniques to skeletons. In J.-M. Jacquet, editor, Constructing Logic Programs, pages 127\u2013140. John Wiley, 1993."},{"key":"7_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-60939-3_14","volume-title":"Proc. LOPSTR\u201995","author":"W. W. Vasconcelos","year":"1996","unstructured":"W. W. Vasconcelos and N.E. Fuchs. An opportunistic approach for logic program analysis and optimisation using enhanced schema-based transformations. In M. Proietti, editor, Proc. LOPSTR\u201995, pages 174\u2013188. LNCS 1048, Springer-Verlag, 1996."},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"M. Wirsing. Algebraic specification. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 675\u2013788. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50018-4"}],"container-title":["Lecture Notes in Computer Science","Logic Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49674-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T11:01:51Z","timestamp":1708167711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49674-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650744","9783540496748"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-49674-2_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}