{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:02:53Z","timestamp":1725487373337},"publisher-location":"Berlin, Heidelberg","reference-count":28,"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_8","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:06:29Z","timestamp":1184601989000},"page":"90-108","source":"Crossref","is-referenced-by-count":9,"title":["Convex Hull Abstractions in Specialization of CLP Programs"],"prefix":"10.1007","author":[{"given":"Julio C.","family":"Peralta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John P.","family":"Gallagher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"8_CR1","unstructured":"Krysztof R. Apt and Ernst-R\u00fcdiger Olderog. Verification of Sequential and Concurrent Programs. Springer-Verlag, 1991."},{"key":"8_CR2","series-title":"Lect Notes Comput Sci","first-page":"204","volume-title":"Proceedings of the 6th International Workshop on Logic Program Synthesis and Transformation","author":"F. Benoy","year":"1996","unstructured":"F. Benoy and A. King. Inferring argument size relations in CLP(R). In Proceedings of the 6th International Workshop on Logic Program Synthesis and Transformation, pages 204\u2013223, Sweden, 1996. Springer-Verlag, LNCS 1207."},{"key":"8_CR3","unstructured":"Edmund M. Clarke, Orna Grumberg, and Doron Peled. Model Checking. The MIT Press, 2000."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Proceedings of the Conference Record of the 5th ACM Symposium on Principles of Programming Languages, pages 84\u201397, Albuquerque, New Mexico, 1978. Also in \u201c http:\/\/www.di.ens.fr\/~cousot\/COUSOTpapers\/POPL78.shtml \u201d.","DOI":"10.1145\/512760.512770"},{"key":"8_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-49059-0_16","volume-title":"5th International Conference on Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Delzanno","year":"1999","unstructured":"G. Delzanno and A. Podelski. Model Checking in CLP. In W. R. Cleaveland, editor, 5th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pages 223\u2013239. Springer-Verlag, LNCS 1579, 1999."},{"key":"8_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-45142-0_8","volume-title":"10th International Workshop on Logic-based Program Synthesis and Transformation","author":"F. Fioravanti","year":"2000","unstructured":"Fabio Fioravanti, Alberto Pettorossi, and Maurizio Proietti. Automated strategies for specialising constraint logic programs. In Kung-Kiu Lau, editor, 10th International Workshop on Logic-based Program Synthesis and Transformation, pages 125\u2013146. Springer-Verlag, LNCS 2042, 2000."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Fabio Fioravanti, Alberto Pettorossi, and Maurizio Proietti. Verifying CTL properties of infinite state systems by specializing constraint logic programs. Technical Report DSSE-TR-2001-3, Department of Electronics and Computer Science, University of Southampton, 2001. Proceedings of the Second International Workshop on Verification and Computational Logic (VCL\u201901).","DOI":"10.1007\/3-540-45142-0_8"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"J. Gallagher. Specialisation of logic programs: A tutorial. In Proceedings PEPM\u201993, ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 88\u201398, Copenhagen, June 1993. ACM Press.","DOI":"10.1145\/154630.154640"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF03037136","volume":"6","author":"J. Gallagher","year":"1988","unstructured":"J. Gallagher, M. Codish, and E.Y. Shapiro. Specialisation of Prolog and FCP programs using abstract interpretation. New Generation Computing, 6:159\u2013186, 1988.","journal-title":"New Generation Computing"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"J. Gallagher and D.A. de Waal. Deletion of redundant unary type predicates from logic programs. In K.K. Lau and T. Clement, editors, Logic Program Synthesis and Transformation, Workshops in Computing, pages 151\u2013167. Springer-Verlag, 1993.","DOI":"10.1007\/978-1-4471-3560-9_11"},{"key":"8_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/3-540-61580-6_7","volume-title":"Partial Evaluation","author":"J. P. Gallagher","year":"1996","unstructured":"John P. Gallagher and L. Lafave. Regular approximation of computation paths in logic and functional languages. In O. Danvy, R. Gluck, and P. Thiemman, editors, Partial Evaluation, pages 115\u2013136. Springer-Verlag, LNCS 1110, 1996."},{"issue":"2\u20133","key":"8_CR12","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1012936614361","volume":"14","author":"J. P. Gallagher","year":"2001","unstructured":"John P. Gallagher and Julio C. Peralta. Regular tree languages as an abstract domain in program specialisation. Higher-Order and Symbolic Computation, 14(2\u20133):143\u2013172, 2001.","journal-title":"Higher-Order and Symbolic Computation"},{"key":"8_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/10720327_8","volume-title":"Logic-Based Program Synthesis and Transformation (LOPSTR\u201999)","author":"J.M. Howe","year":"2000","unstructured":"J.M. Howe and A. King. Specialising finite domain programs using polyhedra. In A. Bossi, editor, Logic-Based Program Synthesis and Transformation (LOPSTR\u201999), volume 1817 of Springer-Verlag Lecture Notes in Computer Science, pages 118\u2013135, April 2000."},{"issue":"20","key":"8_CR14","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19","author":"J. Jaffar","year":"1994","unstructured":"Joxan Jaffar and Michael J. Maher. Constraint logic programming: A survey. The Journal of Logic Programming, 19(20):503\u2013581, 1994.","journal-title":"The Journal of Logic Programming"},{"key":"8_CR15","unstructured":"N. Jones, C.K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Software Generation. Prentice Hall, 1993."},{"key":"8_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/BFb0032761","volume-title":"Symposium on Static Analysis (SAS\u201997)","author":"N. D. Jones","year":"1997","unstructured":"Neil D. Jones. Combining abstract interpretation and partial evaluation. In P. Van Hentenryck, editor, Symposium on Static Analysis (SAS\u201997), volume 1302 of Springer-Verlag Lecture Notes in Computer Science, pages 396\u2013405, 1997."},{"key":"8_CR17","unstructured":"M. Leuschel. Program specialisation and abstract interpretation reconciled. In Joxan Jaffar, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming JICSLP\u201998, pages 220\u2013234, Manchester, UK, June 1998. MIT Press."},{"key":"8_CR18","unstructured":"M. Leuschel and S. Gruner. Abstract partial deduction using regular types and its application to model checking. In A. Pettorossi, editor, (Pre)Proceedings of LOPSTR-2001 11th International Workshop on Logic-based Program Synthesis and Transformation (LOPSTR-2001), Paphos, Cyprus, December 2001."},{"key":"8_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/10720327_5","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M. Leuschel","year":"1999","unstructured":"M. Leuschel and T. Massart. Infinite state model checking by abstract interpretation and program specialisation. In Annalisa Bossi, editor, Logic-Based Program Synthesis and Transformation, pages 62\u201381. Springer Verlag, LNCS 1817, 1999."},{"issue":"3 & 4","key":"8_CR20","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0743-1066(91)90027-M","volume":"11","author":"J.W. Lloyd","year":"1991","unstructured":"J.W. Lloyd and J.C. Shepherdson. Partial Evaluation in Logic Programming. Journal of Logic Programming, 11(3 & 4):217\u2013242, 1991.","journal-title":"Journal of Logic Programming"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1145\/158511.158685","volume-title":"Proceedings of the Twentieth Symposium on Principles of Programming Languages","author":"K. Marriott","year":"1993","unstructured":"K. Marriott and P. Stuckey. The 3 R\u2019s of optimizing constraint logic programs: Refinement, Removal and Reordering. In Proceedings of the Twentieth Symposium on Principles of Programming Languages, pages 334\u2013344, Charleston, South Carolina, 1993. ACM Press."},{"key":"8_CR22","unstructured":"Torben \u00c6. Mogensen. Partially static structures in a self-applicable partial evaluator. In D. Bj\u00f8rner, A.P. Ershov, and N.D. Jones, editors, Partial Evaluation and Mixed Computation, pages 325\u2013347. North-Holland, 1988."},{"key":"8_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/10720327_7","volume-title":"Logic-Based Program Synthesis and Transformation","author":"J. C. Peralta","year":"1999","unstructured":"Julio C. Peralta and John P. Gallagher. Imperative program specialisation: An approach using CLP. In Annalisa Bossi, editor, Logic-Based Program Synthesis and Transformation, pages 102\u2013117. Springer Verlag, LNCS 1817, 1999."},{"key":"8_CR24","unstructured":"G. Puebla, M. Hermenegildo, and J. P. Gallagher. An integration of partial evaluation in a generic abstract interpretation framework. In Olivier Danvy, editor, Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM\u201999), Technical report BRICS-NS-99-1, University of Aarhus, pages 75\u201384, San Antonio, Texas, January 1999."},{"key":"8_CR25","unstructured":"J. C. Reynolds. Transformational systems and the algebraic structure of atomic formulas. Machine Intelligence, pages 135\u2013151, 1970."},{"key":"8_CR26","series-title":"Lect Notes Comput Sci","first-page":"282","volume-title":"LOPSTR\u201997","author":"H. Sa\u011flam","year":"1997","unstructured":"Huseyin Sa\u011flam and John P. Gallagher. Constrained regular approximations of logic programs. In N. Fuchs, editor, LOPSTR\u201997, pages 282\u2013299. Springer-Verlag, LNCS 1463, 1997."},{"issue":"2\u20133","key":"8_CR27","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0743-1066(99)00030-8","volume":"41","author":"D. Schreye De","year":"1999","unstructured":"Danny De Schreye, Robert Gl\u00fcck, Jesper J\u00f8rgensen, Michael Leuschel, Bern Martens, and Morten Heine S\u00f8rensen. Conjunctive partial deduction: Foundations, control, algorithms, and experiments. The Journal of Logic Programming, 41(2\u20133):231\u2013277, 1999. Erratum appeared in JLP 43(3): 265(2000).","journal-title":"The Journal of Logic Programming"},{"issue":"3","key":"8_CR28","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/158439.158441","volume":"25","author":"U. A. Shankar","year":"1993","unstructured":"U. A. Shankar. An Introduction to Assertional Reasoning for Concurrent systems. ACM Computing Surveys, 25(3):225\u2013262, 1993.","journal-title":"ACM Computing Surveys"}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:22:00Z","timestamp":1556680920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45013-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404385","9783540450139"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-45013-0_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}