{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:05Z","timestamp":1750308125412,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,1,9]],"date-time":"2006-01-09T00:00:00Z","timestamp":1136764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,1,9]]},"DOI":"10.1145\/1111542.1111557","type":"proceedings-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T15:52:40Z","timestamp":1139241160000},"page":"88-94","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["The Ecce and Logen partial evaluators and their web interfaces"],"prefix":"10.1145","author":[{"given":"Michael","family":"Leuschel","sequence":"first","affiliation":[{"name":"University of D\u00fcsseldorf, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Elphick","sequence":"additional","affiliation":[{"name":"University of Southampton, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauricio","family":"Varea","sequence":"additional","affiliation":[{"name":"University of Southampton, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen-John","family":"Craig","sequence":"additional","affiliation":[{"name":"University of D\u00fcsseldorf, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Fontaine","sequence":"additional","affiliation":[{"name":"University of D\u00fcsseldorf, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,1,9]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014007.1014026"},{"key":"e_1_3_2_1_3_1","first-page":"198","volume-title":"Proceedings PLILP'91, LNCS 844","author":"Birkedal L.","year":"1994","unstructured":"L. Birkedal and M. Welinder . Hand-writing program generator generators . In M. Hermenegildo and J. Penjam, editors, Proceedings PLILP'91, LNCS 844 , pages 198 -- 214 , Madrid, Spain , 1994 . Springer-Verlag .]] L. Birkedal and M. Welinder. Hand-writing program generator generators. In M. Hermenegildo and J. Penjam, editors, Proceedings PLILP'91, LNCS 844, pages 198--214, Madrid, Spain, 1994. Springer-Verlag.]]"},{"key":"e_1_3_2_1_5_1","first-page":"148","volume-title":"Proceedings of PSI'03","author":"Craig S.","year":"2003","unstructured":"S. Craig and M. Leuschel . A compiler generator for constraint logic programs. In M. Broy and A. V. Zamulin, editors , Proceedings of PSI'03 , LNCS 2890, pages 148 -- 161 . Springer-Verlag , 2003 .]] S. Craig and M. Leuschel. A compiler generator for constraint logic programs. In M. Broy and A. V. Zamulin, editors, Proceedings of PSI'03, LNCS 2890, pages 148--161. Springer-Verlag, 2003.]]"},{"key":"e_1_3_2_1_6_1","first-page":"53","volume-title":"Proceedings LOPSTR 2004","author":"Craig S.-J.","year":"2004","unstructured":"S.-J. Craig , J. Gallagher , M. Leuschel , and K. S. Henriksen . Fully automatic binding-time analysis for Prolog. In S. Etalle, editor , Proceedings LOPSTR 2004 , LNCS 3573, pages 53 -- 68 . Springer-Verlag , August 2004 .]] S.-J. Craig, J. Gallagher, M. Leuschel, and K. S. Henriksen. Fully automatic binding-time analysis for Prolog. In S. Etalle, editor, Proceedings LOPSTR 2004, LNCS 3573, pages 53--68. Springer-Verlag, August 2004.]]"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1069774.1069777"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(99)00030-8"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1013963.1013970"},{"key":"e_1_3_2_1_10_1","volume-title":"The derivation of an algorithm for program specialisation. New Generation Computing, 9(3 & 4):305--333","author":"Gallagher J.","year":"1991","unstructured":"J. Gallagher and M. Bruynooghe . The derivation of an algorithm for program specialisation. New Generation Computing, 9(3 & 4):305--333 , 1991 .]] J. Gallagher and M. Bruynooghe. The derivation of an algorithm for program specialisation. New Generation Computing, 9(3 & 4):305--333, 1991.]]"},{"key":"e_1_3_2_1_11_1","first-page":"599","volume-title":"Proceedings ICLP'94","author":"Gallagher J.","year":"1994","unstructured":"J. Gallagher and D. A. de Waal . Fast and precise regular approximations of logic programs. In P. Van Hentenryck, editor , Proceedings ICLP'94 , pages 599 -- 613 . The MIT Press , 1994 .]] J. Gallagher and D. A. de Waal. Fast and precise regular approximations of logic programs. In P. Van Hentenryck, editor, Proceedings ICLP'94, pages 599--613. The MIT Press, 1994.]]"},{"key":"e_1_3_2_1_12_1","first-page":"27","volume-title":"Proceedings ICLP 2004","author":"Gallagher J. P.","year":"2004","unstructured":"J. P. Gallagher and K. S. Henriksen . Abstract domains based on regular types. In B. Demoen and V. Lifschitz, editors . Proceedings ICLP 2004 , LNCS 3132, pages 27 -- 42 , January 2004 .]] J. P. Gallagher and K. S. Henriksen. Abstract domains based on regular types. In B. Demoen and V. Lifschitz, editors. Proceedings ICLP 2004, LNCS 3132, pages 27--42, January 2004.]]"},{"key":"e_1_3_2_1_13_1","first-page":"259","volume-title":"Proceedings PLILP'95, LNCS 982","author":"Gl\u00fcck R.","year":"1995","unstructured":"R. Gl\u00fcck and J. J\u00f8rgensen . Efficient multi-level generating extensions for program specialization . In S. Swierstra and M. Hermenegildo, editors, Proceedings PLILP'95, LNCS 982 , pages 259 -- 278 , Utrecht, The Netherlands , September 1995 . Springer-Verlag .]] R. Gl\u00fcck and J. J\u00f8rgensen. Efficient multi-level generating extensions for program specialization. In S. Swierstra and M. Hermenegildo, editors, Proceedings PLILP'95, LNCS 982, pages 259--278, Utrecht, The Netherlands, September 1995. Springer-Verlag.]]"},{"key":"e_1_3_2_1_14_1","first-page":"93","volume-title":"Proceedings of the Third International Ershov Conference on Perspectives of System Informatics, LNCS 1755","author":"Gl\u00fcck R.","year":"1999","unstructured":"R. Gl\u00fcck and M. Leuschel . Abstraction-based partial deduction for solving inverse problems - a transformational approach to software verification . In Proceedings of the Third International Ershov Conference on Perspectives of System Informatics, LNCS 1755 , pages 93 -- 100 , Novosibirsk, Russia , 1999 . Springer-Verlag.]] R. Gl\u00fcck and M. Leuschel. Abstraction-based partial deduction for solving inverse problems - a transformational approach to software verification. In Proceedings of the Third International Ershov Conference on Perspectives of System Informatics, LNCS 1755, pages 93--100, Novosibirsk, Russia, 1999. Springer-Verlag.]]"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.2004.1399774"},{"key":"e_1_3_2_1_16_1","volume-title":"DIKU, Department of Computer Science","author":"Holst C. K.","year":"1989","unstructured":"C. K. Holst . Syntactic currying: yet another approach to partial evaluation. Technical report , DIKU, Department of Computer Science , University of Copenhagen , 1989 .]] C. K. Holst. Syntactic currying: yet another approach to partial evaluation. Technical report, DIKU, Department of Computer Science, University of Copenhagen, 1989.]]"},{"key":"e_1_3_2_1_17_1","first-page":"210","volume-title":"Draft Proceedings, Fourth Annual Glasgow Workshop on Functional Programming, Skye, Scotland","author":"Holst C. K.","year":"1991","unstructured":"C. K. Holst and J. Launchbury . Handwriting cogen to avoid problems with static typing . In Draft Proceedings, Fourth Annual Glasgow Workshop on Functional Programming, Skye, Scotland , pages 210 -- 218 . Glasgow University , 1991 .]] C. K. Holst and J. Launchbury. Handwriting cogen to avoid problems with static typing. In Draft Proceedings, Fourth Annual Glasgow Workshop on Functional Programming, Skye, Scotland, pages 210--218. Glasgow University, 1991.]]"},{"key":"e_1_3_2_1_18_1","volume-title":"Partial Evaluation and Automatic Program Generation","author":"Jones N. D.","year":"1993","unstructured":"N. D. Jones , C. K. Gomard , and P. Sestoft . Partial Evaluation and Automatic Program Generation . Prentice Hall , 1993 .]] N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, 1993.]]"},{"key":"e_1_3_2_1_19_1","first-page":"238","volume-title":"Partial Evaluation, International Seminar, LNCS 1110","author":"J\u00f8rgensen J.","year":"1996","unstructured":"J. J\u00f8rgensen and M. Leuschel . Efficiently generating efficient generating extensions in Prolog . In O. Danvy, R. Gl\u00fck, and P. Thiemann, editors, Partial Evaluation, International Seminar, LNCS 1110 , pages 238 -- 262 , Schlo\u00df Dagstuhl, 1996 . Springer-Verlag .]] J. J\u00f8rgensen and M. Leuschel. Efficiently generating efficient generating extensions in Prolog. In O. Danvy, R. Gl\u00fck, and P. Thiemann, editors, Partial Evaluation, International Seminar, LNCS 1110, pages 238--262, Schlo\u00df Dagstuhl, 1996. Springer-Verlag.]]"},{"key":"e_1_3_2_1_20_1","first-page":"59","volume-title":"Proceedings LOPSTR'96","author":"J\u00f8rgensen J.","year":"1996","unstructured":"J. J\u00f8rgensen , M. Leuschel , and B. Martens . Conjunctive partial deduction in practice. In J. Gallagher, editor , Proceedings LOPSTR'96 , LNCS 1207, pages 59 -- 82 , Stockholm, Sweden , August 1996 . Springer-Verlag.]] J. J\u00f8rgensen, M. Leuschel, and B. Martens. Conjunctive partial deduction in practice. In J. Gallagher, editor, Proceedings LOPSTR'96, LNCS 1207, pages 59--82, Stockholm, Sweden, August 1996. Springer-Verlag.]]"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/61352.61367"},{"key":"e_1_3_2_1_22_1","first-page":"451","volume-title":"Proceedings LPAR'2000, LNAI","author":"Lehmann H.","year":"1955","unstructured":"H. Lehmann and M. Leuschel . Solving planning problems by partial deduction . In M. Parigot and A. Voronkov, editors, Proceedings LPAR'2000, LNAI 1955 , pages 451 -- 468 , Reunion Island, France , 2000. Springer-Verlag .]] H. Lehmann and M. Leuschel. Solving planning problems by partial deduction. In M. Parigot and A. Voronkov, editors, Proceedings LPAR'2000, LNAI 1955, pages 451--468, Reunion Island, France, 2000. Springer-Verlag.]]"},{"key":"e_1_3_2_1_23_1","first-page":"379","volume-title":"T. \u00c6","author":"Leuschel M.","year":"2002","unstructured":"M. Leuschel . Homeomorphic embedding for online termination of symbolic methods . In T. \u00c6 . Mogensen, D. Schmidt, and I. H. Sudborough, editors, The Essence of Computation - Essays dedicated to Neil Jones, LNCS 2566, pages 379 -- 403 . Springer-Verlag , 2002 .]] M. Leuschel. Homeomorphic embedding for online termination of symbolic methods. In T. \u00c6. Mogensen, D. Schmidt, and I. H. Sudborough, editors, The Essence of Computation - Essays dedicated to Neil Jones, LNCS 2566, pages 379--403. Springer-Verlag, 2002.]]"},{"key":"e_1_3_2_1_24_1","first-page":"341","volume-title":"M. Bruynooghe and K.-K","author":"Leuschel M.","year":"2004","unstructured":"M. Leuschel , S. Craig , M. Bruynooghe , and W. Vanhoof . Specializing interpreters using offline partial deduction . In M. Bruynooghe and K.-K . Lau, editors, Program Development in Computational Logic, LNCS 3049, pages 341 -- 376 . Springer-Verlag , 2004 .]] M. Leuschel, S. Craig, M. Bruynooghe, and W. Vanhoof. Specializing interpreters using offline partial deduction. In M. Bruynooghe and K.-K. Lau, editors, Program Development in Computational Logic, LNCS 3049, pages 341--376. Springer-Verlag, 2004.]]"},{"key":"e_1_3_2_1_25_1","first-page":"137","volume-title":"Proceedings PLILP'96","author":"Leuschel M.","year":"1996","unstructured":"M. Leuschel and D. De Schreye . Logic program specialisation: How to be more specific. In H. Kuchen and S. Swierstra, editors , Proceedings PLILP'96 , LNCS 1140, pages 137 -- 151 , Aachen, Germany , September 1996 . Springer-Verlag.]] M. Leuschel and D. De Schreye. Logic program specialisation: How to be more specific. In H. Kuchen and S. Swierstra, editors, Proceedings PLILP'96, LNCS 1140, pages 137--151, Aachen, Germany, September 1996. Springer-Verlag.]]"},{"key":"e_1_3_2_1_26_1","first-page":"319","volume-title":"Proceedings JICSLP'96","author":"Leuschel M.","year":"1996","unstructured":"M. Leuschel , D. De Schreye , and A. de Waal . A conceptual embedding of folding into partial deduction: Towards a maximal integration. In M. Maher, editor , Proceedings JICSLP'96 , pages 319 -- 332 , Bonn, Germany , September 1996 . MIT Press.]] M. Leuschel, D. De Schreye, and A. de Waal. A conceptual embedding of folding into partial deduction: Towards a maximal integration. In M. Maher, editor, Proceedings JICSLP'96, pages 319--332, Bonn, Germany, September 1996. MIT Press.]]"},{"key":"e_1_3_2_1_27_1","first-page":"91","volume-title":"Proceedings LOPSTR'2001","author":"Leuschel M.","year":"2001","unstructured":"M. Leuschel and S. Gruner . Abstract partial deduction using regular types and its application to model checking. In A. Pettorossi, editor , Proceedings LOPSTR'2001 , LNCS 2372, pages 91 -- 110 , Paphos, Cyprus , 2001 . Springer-Verlag.]] M. Leuschel and S. Gruner. Abstract partial deduction using regular types and its application to model checking. In A. Pettorossi, editor, Proceedings LOPSTR'2001, LNCS 2372, pages 91--110, Paphos, Cyprus, 2001. Springer-Verlag.]]"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001662"},{"key":"e_1_3_2_1_29_1","first-page":"101","volume-title":"Proceedings of the International Conference on Computational Logic (CL'2000)","author":"Leuschel M.","year":"1861","unstructured":"M. Leuschel and H. Lehmann . Coverability of reset Petri nets and other well-structured transition systems by partial deduction. In J. Lloyd, editor , Proceedings of the International Conference on Computational Logic (CL'2000) , LNAI 1861 , pages 101 -- 115 , London, UK , 2000. Springer-Verlag.]] M. Leuschel and H. Lehmann. Coverability of reset Petri nets and other well-structured transition systems by partial deduction. In J. Lloyd, editor, Proceedings of the International Conference on Computational Logic (CL'2000), LNAI 1861, pages 101--115, London, UK, 2000. Springer-Verlag.]]"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/351268.351298"},{"key":"e_1_3_2_1_31_1","volume-title":"Proceedings LOPSTR'03, LNCS 3018","author":"Leuschel M.","year":"2004","unstructured":"M. Leuschel and H. Lehmann . Inductive theorem proving by program specialisation: Generating proofs for Isabelle using Ecce (invited talk) . In M. Bruynooghe, editor, Proceedings LOPSTR'03, LNCS 3018 . Springer-Verlag , 2004 .]] M. Leuschel and H. Lehmann. Inductive theorem proving by program specialisation: Generating proofs for Isabelle using Ecce (invited talk). In M. Bruynooghe, editor, Proceedings LOPSTR'03, LNCS 3018. Springer-Verlag, 2004.]]"},{"key":"e_1_3_2_1_32_1","first-page":"263","volume-title":"Partial Evaluation, International Seminar, LNCS 1110","author":"Leuschel M.","year":"1996","unstructured":"M. Leuschel and B. Martens . Global control for partial deduction through characteristic atoms and global trees . In O. Danvy, R. Gl\u00fcck, and P. Thiemann, editors, Partial Evaluation, International Seminar, LNCS 1110 , pages 263 -- 283 , Schlo\u00df Dagstuhl, 1996 . Springer-Verlag .]] M. Leuschel and B. Martens. Global control for partial deduction through characteristic atoms and global trees. In O. Danvy, R. Gl\u00fcck, and P. Thiemann, editors, Partial Evaluation, International Seminar, LNCS 1110, pages 263--283, Schlo\u00df Dagstuhl, 1996. Springer-Verlag.]]"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/271510.271525"},{"key":"e_1_3_2_1_34_1","first-page":"63","volume-title":"Proceedings LOPSTR'99","author":"Leuschel M.","year":"1817","unstructured":"M. Leuschel and T. Massart . Infinite state model checking by abstract interpretation and program specialisation. In A. Bossi, editor , Proceedings LOPSTR'99 , LNCS 1817 , pages 63 -- 82 , Venice, Italy , 2000.]] M. Leuschel and T. Massart. Infinite state model checking by abstract interpretation and program specialisation. In A. Bossi, editor, Proceedings LOPSTR'99, LNCS 1817, pages 63--82, Venice, Italy, 2000.]]"},{"key":"e_1_3_2_1_35_1","first-page":"83","volume-title":"Proceedings LOPSTR'96","author":"Leuschel M.","year":"1996","unstructured":"M. Leuschel and M. H. S\u00f8rensen . Redundant argument filtering of logic programs. In J. Gallagher, editor , Proceedings LOPSTR'96 , LNCS 1207, pages 83 -- 103 , Stockholm, Sweden , August 1996 . Springer-Verlag.]] M. Leuschel and M. H. S\u00f8rensen. Redundant argument filtering of logic programs. In J. Gallagher, editor, Proceedings LOPSTR'96, LNCS 1207, pages 83--103, Stockholm, Sweden, August 1996. Springer-Verlag.]]"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31987-0_6"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01531082"},{"key":"e_1_3_2_1_38_1","first-page":"597","volume-title":"Proceedings ICLP'95","author":"Martens B.","year":"1995","unstructured":"B. Martens and J. Gallagher . Ensuring global termination of partial deduction while allowing flexible polyvariance. In L. Sterling, editor , Proceedings ICLP'95 , pages 597 -- 613 , Kanagawa, Japan , June 1995 . MIT Press.]] B. Martens and J. Gallagher. Ensuring global termination of partial deduction while allowing flexible polyvariance. In L. Sterling, editor, Proceedings ICLP'95, pages 597--613, Kanagawa, Japan, June 1995. MIT Press.]]"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/11531142_10"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/154630.154642"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/11562931_32"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03038271"},{"key":"e_1_3_2_1_43_1","volume-title":"7th International Workshop on Termination (WST 2004)","author":"Tamary L.","year":"2004","unstructured":"L. Tamary and M. Codish . Abstract partial evaluation for termination analysis . In 7th International Workshop on Termination (WST 2004) , June 2004 .]] L. Tamary and M. Codish. Abstract partial evaluation for termination analysis. In 7th International Workshop on Termination (WST 2004), June 2004.]]"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/232627.232647"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30557-6_9"}],"event":{"name":"PEPM06: Partial Evaluation and Program Manipulation 2006","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Charleston South Carolina","acronym":"PEPM06"},"container-title":["Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1111542.1111557","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1111542.1111557","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:24Z","timestamp":1750262904000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1111542.1111557"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,1,9]]},"references-count":43,"alternative-id":["10.1145\/1111542.1111557","10.1145\/1111542"],"URL":"https:\/\/doi.org\/10.1145\/1111542.1111557","relation":{},"subject":[],"published":{"date-parts":[[2006,1,9]]},"assertion":[{"value":"2006-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}