{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:02:50Z","timestamp":1725487370310},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404385"},{"type":"electronic","value":"9783540450139"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45013-0_17","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:06:29Z","timestamp":1184601989000},"page":"219-237","source":"Crossref","is-referenced-by-count":2,"title":["Forward Slicing of Multi-paradigm Declarative Programs Based on Partial Evaluation"],"prefix":"10.1007","author":[{"given":"Germ\u00e1n","family":"Vidal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"17_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/10722010_13","volume-title":"Mathematics of Program Construction. Proceedings","author":"S.M. Abramov","year":"2000","unstructured":"S.M. Abramov and R. Gl\u00fcck. The Universal Resolving Algorithm: Inverse Computation in a Functional Language. In Mathematics of Program Construction. Proceedings, pages 187\u2013212. Springer LNCS 1837, 2000."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"E. Albert, M. Hanus, F. Huch, J. Olvier, and G. Vidal. Operational Semantics for Functional Logic Languages. In Proc. of the Int\u2019l Workshop on Functional and (Constraint) Logic Programming (WFLP\u201902), volume 76 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2002.","DOI":"10.1016\/S1571-0661(04)80782-5"},{"key":"17_CR3","unstructured":"E. Albert, M. Hanus, and G. Vidal. A Practical Partial Evaluation Scheme for Multi-Paradigm Declarative Languages. Journal of Functional and Logic Programming, 2002(1), 2002."},{"issue":"1","key":"17_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF03037257","volume":"20","author":"E. Albert","year":"2002","unstructured":"E. Albert and G. Vidal. The Narrowing-Driven Approach to Functional Logic Program Specialization. New Generation Computing, 20(1):3\u201326, 2002.","journal-title":"New Generation Computing"},{"issue":"4","key":"17_CR5","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1145\/291891.291896","volume":"20","author":"M. Alpuente","year":"1998","unstructured":"M. Alpuente, M. Falaschi, and G. Vidal. Partial Evaluation of Functional Logic Programs. ACM TOPLAS, 20(4):768\u2013844, 1998.","journal-title":"ACM TOPLAS"},{"key":"17_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BFb0013825","volume-title":"Proc. of the 3rd Int\u2019l Conference on Algebraic and Logic Programming (ALP\u201992)","author":"S. Antoy","year":"1992","unstructured":"S. Antoy. Definitional trees. In Proc. of the 3rd Int\u2019l Conference on Algebraic and Logic Programming (ALP\u201992), pages 143\u2013157. Springer LNCS 632, 1992."},{"issue":"4","key":"17_CR7","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1145\/347476.347484","volume":"47","author":"S. Antoy","year":"2000","unstructured":"S. Antoy, R. Echahed, and M. Hanus. A Needed Narrowing Strategy. Journal of the ACM, 47(4): 776\u2013822, 2000.","journal-title":"Journal of the ACM"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"M. Das, T. Reps, and P. Van Hentenryck. Semantic Foundations of Binding-Time Analysis for Imperative Programs. In Proc. of the Symp. on Partial Evaluation and Semantics-Based Program Manipulation (PEPM\u201995), pages 100\u2013110, 1995.","DOI":"10.1145\/215465.215569"},{"issue":"2&3","key":"17_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0743-1066(99)00030-8","volume":"41","author":"D. Schreye De","year":"1999","unstructured":"D. De Schreye, R. Gl\u00fcck, J. J\u00f8rgensen, M. Leuschel, B. Martens, and M.H. S\u00f8rensen. Conjunctive Partial Deduction: Foundations, Control, Algorihtms, and Experiments. Journal of Logic Programming, 41(2&3):231\u2013277, 1999.","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1145\/24039.24041","volume":"9","author":"J. Ferrante","year":"1987","unstructured":"J. Ferrante, K.J. Ottenstein, and J.D. Warren. The Program Dependence Graph and Its Use in Optimization. ACM Transactions on Programming Languages and Systems, 9(3):319\u2013349, 1987.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1145\/154630.154640","volume-title":"Proc. of the ACM Symp. on Partial Evaluation and Semantics-Based Program Manipulation (PEPM\u201993)","author":"J. Gallagher","year":"1993","unstructured":"J. Gallagher. Tutorial on Specialisation of Logic Programs. In Proc. of the ACM Symp. on Partial Evaluation and Semantics-Based Program Manipulation (PEPM\u201993), pages 88\u201398. ACM, New York, 1993."},{"key":"17_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/3-540-61580-6_8","volume-title":"Partial Evaluation, Int\u2019l Seminar, Dagstuhl Castle, Germany","author":"R. Gl\u00fcck","year":"1996","unstructured":"R. Gl\u00fcck and M.H. S\u00f8rensen. A Roadmap to Metacomputation by Supercompilation. In O. Danvy, R. Gl\u00fcck, and P. Thiemann, editors, Partial Evaluation, Int\u2019l Seminar, Dagstuhl Castle, Germany, pages 137\u2013160. Springer LNCS 1110, 1996."},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"V. Gouranton. Deriving Analysers by Folding\/Unfolding of Natural Semantics and a Case Study: Slicing. In Proc. of SAS\u201998, pages 115\u2013133, 1998.","DOI":"10.1007\/3-540-49727-7_7"},{"key":"17_CR14","first-page":"80","volume-title":"Proc. of ACM Symp. on Principles of Programming Languages (POPL\u201997)","author":"M. Hanus","year":"1997","unstructured":"M. Hanus. A Unified Computation Model for Functional and Logic Programming. In Proc. of ACM Symp. on Principles of Programming Languages (POPL\u201997), pages 80\u201393. ACM, New York, 1997."},{"key":"17_CR15","volume-title":"Technical report","author":"M. Hanus","year":"2000","unstructured":"M. Hanus, S. Antoy, J. Koj, R. Sadre, and F. Steiner. PAKCS 1.2: The Portland Aachen Kiel Curry System User Manual. Technical report, University of Kiel, Germany, 2000."},{"issue":"1","key":"17_CR16","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1017\/S0956796899003330","volume":"9","author":"M. Hanus","year":"1999","unstructured":"M. Hanus and C. Prehofer. Higher-Order Narrowing with Definitional Trees. Journal of Functional Programming, 9(1):33\u201375, 1999.","journal-title":"Journal of Functional Programming"},{"key":"17_CR17","unstructured":"M. Hanus (ed.). Curry: An Integrated Functional Logic Language. Available at: http:\/\/www.informatik.uni-kiel.de\/~mh\/curry\/ ."},{"key":"17_CR18","first-page":"187","volume-title":"Proc. of the Int\u2019l Workshop on Partial Evaluation and Mixed Computation","author":"J. Hughes","year":"1988","unstructured":"J. Hughes. Backwards Analysis of Functional Programs. In Proc. of the Int\u2019l Workshop on Partial Evaluation and Mixed Computation, pages 187\u2013208. North-Holland, Amsterdam, 1988."},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"D.J. Kuck, R.H. Kuhn, D.A. Padua, B. Leasure, and M. Wolfe. Dependence Graphs and Compiler Optimization. In Proc. of the 8th Symp. on the Principles of Programming Languages (POPL\u201981), SIGPLAN Notices, pages 207\u2013218, 1981.","DOI":"10.1145\/567532.567555"},{"key":"17_CR20","unstructured":"M. Leuschel. Program Specialization and Abstract Interpretation Reconciled. In Proc. of the Joint Int\u2019l Conf. and Symp. on Logic Programming (JICSLP\u201998), pages 220\u2013234. MIT Press, 1998."},{"key":"17_CR21","series-title":"Lect Notes Comput Sci","first-page":"83","volume-title":"Proc. of LOPSTR\u201996","author":"M. Leuschel","year":"1996","unstructured":"M. Leuschel and M.H. S\u00f8rensen. Redundant Argument Filtering of Logic Programs. In Proc. of LOPSTR\u201996, pages 83\u2013103. LNCS 1207 83\u2013103, 1996."},{"key":"17_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/3-540-48685-2_19","volume-title":"Proc. of RTA\u201999","author":"F. L\u00f3pez-Fraguas","year":"1999","unstructured":"F. L\u00f3pez-Fraguas and J. S\u00e1nchez-Hern\u00e1ndez. TOY: A Multiparadigm Declarative System. In Proc. of RTA\u201999, pages 244\u2013247. Springer LNCS 1631, 1999."},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/99370.99372","volume-title":"Proc. of 4th Int\u2019l Conf. on Functional Programming and Computer Architecture (FPCA\u201989)","author":"T. Mogensen","year":"1989","unstructured":"T. Mogensen. Separating Binding-Times in Language Specifications. In Proc. of 4th Int\u2019l Conf. on Functional Programming and Computer Architecture (FPCA\u201989), pages 12\u201325. ACM, New York, 1989."},{"key":"17_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/3-540-61580-6_20","volume-title":"Partial Evaluation. Dagstuhl Castle, Germany, February 1996","author":"T. Reps","year":"1996","unstructured":"T. Reps and T. Turnidge. Program Specialization via Program Slicing. In O. Danvy, R. Gl\u00fcck, and P. Thiemann, editors, Partial Evaluation. Dagstuhl Castle, Germany, February 1996, pages 409\u2013429. Springer LNCS 1110, 1996."},{"key":"17_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/3-540-61739-6_50","volume-title":"Proc. of SAS\u201996","author":"S. Schoenig","year":"1996","unstructured":"S. Schoenig and M. Ducasse. A Backward Slicing Algorithm for Prolog. In Proc. of SAS\u201996, pages 317\u2013331. Springer LNCS 1145, 1996."},{"key":"17_CR26","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/503032.503036","volume-title":"ACM Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM\u201902)","author":"J.P. Secher","year":"2002","unstructured":"J.P. Secher and M.H. S\u00f8rensen. From Checking to Inference via Driving and Dag Grammars. In ACM Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM\u201902), pages 41\u201351. ACM, New York, 2002."},{"issue":"3","key":"17_CR27","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1017\/S0956796897002712","volume":"7","author":"P. Sestoft","year":"1997","unstructured":"P. Sestoft. Deriving a Lazy Abstract Machine. Journal of Functional Programming, 7(3):231\u2013264, 1997.","journal-title":"Journal of Functional Programming"},{"issue":"6","key":"17_CR28","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1017\/S0956796800002008","volume":"6","author":"M.H. S\u00f8rensen","year":"1996","unstructured":"M.H. S\u00f8rensen, R. Gl\u00fcck, and N.D. Jones. A Positive Supercompiler. Journal of Functional Programming, 6(6):811\u2013838, 1996.","journal-title":"Journal of Functional Programming"},{"issue":"1","key":"17_CR29","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/A:1013280119003","volume":"9","author":"G. Szilagyi","year":"2002","unstructured":"G. Szilagyi, T. Gyimothy, and J. Maluszynski. Static and Dynamic Slicing of Constraint Logic Programs. J. Automated Software Engineering, 9(1):41\u201365, 2002.","journal-title":"J. Automated Software Engineering"},{"key":"17_CR30","first-page":"121","volume":"3","author":"F. Tip","year":"1995","unstructured":"F. Tip. A Survey of Program Slicing Techniques. Journal of Programming Languages, 3:121\u2013189, 1995.","journal-title":"Journal of Programming Languages"},{"issue":"3","key":"17_CR31","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1145\/5956.5957","volume":"8","author":"V.F. Turchin","year":"1986","unstructured":"V.F. Turchin. The Concept of a Supercompiler. ACM Transactions on Programming Languages and Systems, 8(3):292\u2013325, July 1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"17_CR32","unstructured":"G. Vidal. Forward Slicing by Partial Evaluation. Technical report, DSIC, Technical University of Valencia, 2003. Available from http:\/\/www.dsic.upv.es\/~gvidal ."},{"key":"17_CR33","unstructured":"M.D. Weiser. Program Slices: Formal, Psychological, and Practical Investigations of an Automatic Program Abstraction Method. PhD thesis, The University of Michigan, 1979."},{"issue":"4","key":"17_CR34","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1109\/TSE.1984.5010248","volume":"10","author":"M.D. Weiser","year":"1984","unstructured":"M.D. Weiser. Program Slicing. IEEE Transactions on Software Engineering, 10(4):352\u2013357, 1984.","journal-title":"IEEE Transactions on Software Engineering"}],"container-title":["Lecture Notes in Computer Science","Logic Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45013-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T10:30:53Z","timestamp":1683973853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45013-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404385","9783540450139"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/3-540-45013-0_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}