{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:08:03Z","timestamp":1725890883644},"publisher-location":"London","reference-count":26,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540198062"},{"type":"electronic","value":"9781447135609"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/978-1-4471-3560-9_8","type":"book-chapter","created":{"date-parts":[[2012,12,30]],"date-time":"2012-12-30T01:49:46Z","timestamp":1356832186000},"page":"99-117","source":"Crossref","is-referenced-by-count":2,"title":["Deriving Transformations of Logic Programs Using Abstract Interpretation"],"prefix":"10.1007","author":[{"given":"Dmitri","family":"Boulanger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Bruynooghe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A Aho","year":"1974","unstructured":"Aho,A., Hoperoft,J., Ulhnan,J., The Design and Analysis of Computer Algorithms, Addison-Wesly, Reading, Mass., 1974."},{"key":"8_CR2","first-page":"343","volume-title":"North American Conf","author":"K Benkerimi","year":"1990","unstructured":"Benkerimi,K., Lloyd,J., A Partial Evaluation Procedure for Logic Programs, Proc. 1990 North American Conf. on Logic Programming, Austin, November 1990, 343\u2013358."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Boulanger,D., Deep Logic Program Transformation Using Abstract Interpretation, Proc. 1st and 2nd Russian Conf. on Logic Programming, LNAI, Vol.592, Springer-Verlag, 1992, 79\u2013101.","DOI":"10.1007\/3-540-55460-2_7"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/321992.321996","volume":"24","author":"R Burstall","year":"1977","unstructured":"Burstall,R., Darlington,J., A Transformation System for Developing Recursive Programs, JACM, Jan.1977, Vol. 24, No. 1, 44\u201367","journal-title":"Jacm"},{"issue":"2\u20133","key":"8_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0743-1066(89)90033-2","volume":"6","author":"M Bruynooghe","year":"1989","unstructured":"Bruynooghe,M., De Schreye,D., Krekels,B., Compiling Control, J. Logic Programming, 1989, Vol. 6, Nos. 2\u20133, 135\u2013162.","journal-title":"Compiling Control, J. Logic Programming"},{"issue":"7","key":"8_CR6","first-page":"297","volume":"23","author":"S Debray","year":"1988","unstructured":"Debray,S., Unfold\/Fold Transformations and Loop Optimization of Logic Programs, Proc. SIGPLAN88 Conf. on Programming Language Design and Implementation, SIGPLAN Notices, July 1988, Vol. 23, No. 7, 297\u2013307.","journal-title":"Sigplan88 Conf. on Programming Language Design and Implementation, Sigplan Notices"},{"key":"8_CR7","first-page":"337","volume-title":"Compiling Bottom-Up and Mixed Derivations into Top-Down Executable Logic Programs","author":"D Schreye","year":"1991","unstructured":"DMB91]De Schreye,D., Martens,B., Sablon,G., Bruynooghe,M., Compiling Bottom-Up and Mixed Derivations into Top-Down Executable Logic Programs, J. Automated Reasoning, 1991, 337\u2013358."},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","volume":"69","author":"M Falaschi","year":"1989","unstructured":"Falaschi,M., Levi,G., Martelli,M., Palamidessi,C., Declarative Modelling of the Operational Behavior of Logic Languages, Theoretical Computer Science, 1989, Vol. 69, No. 3, 289\u2013318.","journal-title":"Theoretical Computer Science"},{"key":"8_CR9","first-page":"45","volume":"25","author":"Y Futamura","year":"1971","unstructured":"Futamura,Y., Partial Evaluation of Computation Process\u2013An Approach to a Compiler-Compiler, Systems,Computers,Control, 1971,Vol. 25, 45\u201350.","journal-title":"Systems,computers,control"},{"key":"8_CR10","unstructured":"Gallagher,J., Bruynooghe,M., Some Low Level Transformations of Logic Programs, Proc. 2nd Workshop in Meta-Programming in Logic, Leuven, 1990, 229\u2013244"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF03037167","volume":"9","author":"J Gallagher","year":"1991","unstructured":"Gallagher,J., Bruynooghe,M., The Derivation of an Algorithm for Program Specialization, New Generation Computing, 1991, Vol. 9, 305\u2013333.","journal-title":"New Generation Computing"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0020-0190(78)90015-7","volume":"7","author":"M Garey","year":"1978","unstructured":"Garey,M., Tarjan,R., A Linear-Time Algorithm for Finding all Feedback Vertices, Information Processing Letters, 1978, Vol. 7, 274\u2013276.","journal-title":"Information Processing Letters"},{"issue":"2\u20133","key":"8_CR13","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF03037136","volume":"6","author":"J Gallagher","year":"1988","unstructured":"Gallagher, J., Codish M., Shapiro E., Specialization of Prolog and FCP Programs Using Abstract Interpretation, New Generation Computing, 1988, Vol. 6, Nos. 2\u20133, 159\u2013186.","journal-title":"New Generation Computing"},{"key":"8_CR14","volume-title":"Unfold\/fold Logic Program Transformation, Proc. 4th Int. Conf","author":"T Kawamura","year":"1988","unstructured":"Kawamura, T., Kanamori, T., Preservation of Stronger Equivalence in Unfold\/Fold Logic Program Transformation, Proc. 4th Int. Conf. on FGCS, Tokyo,1988."},{"key":"8_CR15","unstructured":"Kanamori, T., Kawamura, T., Abstract Interpretation Based on OLDT Resolution, J. Logic Programming, 1992 (to appear)."},{"key":"8_CR16","first-page":"516","volume-title":"North American Conf","author":"R Kemp","year":"1990","unstructured":"Kemp,R., Ringwood,G., An Algebraic Framework for Abstract Interpretation of Defmite Programs, Proc. 1990 North American Conf. on Logic Programming, Austin, Nov. 1990, 516\u2013530."},{"key":"8_CR17","first-page":"614","volume-title":"Proving Program Properties by means of SLS-resolution, Proc","author":"J Lever","year":"1991","unstructured":"Lever,J., Proving Program Properties by means of SLS-resolution, Proc. 8th Int. Conf. on Logic Programming, Paris, June 1991, 614\u2013628."},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Lloyd,L., Shepherdson J., Partial Evaluation in Logic Programming, J. Logic Programming, 1991, Vol. 11, Nos. 3\u20134, 217\u2013242.","DOI":"10.1016\/0743-1066(91)90027-M"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of logic Programming","author":"L Lloyd","year":"1987","unstructured":"Lloyds, Foundations of logic Programming, Springer-Verlag, Berlin, 1987."},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Plumer,L., Tenninaiion Proofs for Logic Programs, LNAI Vol.446, Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52837-7"},{"key":"8_CR21","first-page":"57","volume-title":"Construction of Efficient Logic Programs by Loop Absorption and Generalization, Proc","author":"M Proietti","year":"1990","unstructured":"Proietti,M., Pettorossi,A., Construction of Efficient Logic Programs by Loop Absorption and Generalization, Proc. 2nd Workshop in Meta-Programming in Logic, Leuven, 1990, 57\u201381."},{"key":"8_CR22","unstructured":"Proietti,M., Pettorossi,A., Unfolding\u2013Definition\u2013Folding, In this Order, For Avoiding Unnecessary Variables in Logic Programs, Proc. 3rd Int. Symp. on Programming Languages Implementation and Logic Programming, Aug. 1991, LNCS No.528, Springer-Verlag, 1991, 347\u2013358."},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0304-3975(91)90007-O","volume":"86","author":"H Seki","year":"1991","unstructured":"Seki,H., Unfold\/Fold Transformation of stratified programs, J. Theoretical Computer Science, 1991, Vol. 86, 107\u2013139.","journal-title":"J. Theoretical Computer Science"},{"key":"8_CR24","first-page":"127","volume-title":"Unfold\/fold Transformation of Logic Programs, Proc","author":"H Tamaki","year":"1984","unstructured":"Tamaki,H., Sato,T., Unfold\/Fold Transformation of Logic Programs, Proc. 2nd International Conference on Logic Programming, Uppsala, 1984, 127\u2013138."},{"key":"8_CR25","first-page":"84","volume-title":"Old Resolution with Tabulation, Proc","author":"H Tamaki","year":"1986","unstructured":"Tamaki,H., Sato,T., OLD Resolution with Tabulation, Proc. 3rd Int. Conf. on Logic Programming, London, July 1986, 84\u201398."},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Vielle,L., Recursive Query Processing: The power of Logic, Theoretical Computer Science, 1989, Vol. 69, No. 1, 1\u201353.","DOI":"10.1016\/0304-3975(89)90088-1"}],"container-title":["Workshops in Computing","Logic Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-3560-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T22:56:44Z","timestamp":1557442604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-3560-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540198062","9781447135609"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-3560-9_8","relation":{},"ISSN":["1431-1682"],"issn-type":[{"type":"print","value":"1431-1682"}],"subject":[],"published":{"date-parts":[[1993]]}}}