{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:14:13Z","timestamp":1725488053282},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540421276"},{"type":"electronic","value":"9783540451426"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45142-0_6","type":"book-chapter","created":{"date-parts":[[2007,8,1]],"date-time":"2007-08-01T01:17:34Z","timestamp":1185931054000},"page":"86-102","source":"Crossref","is-referenced-by-count":13,"title":["A Model for Inter-module Analysis and Optimizing Compilation"],"prefix":"10.1007","author":[{"given":"Francisco","family":"Bueno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Hermenegildo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Germ\u00e1n","family":"Puebla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mar\u00eda Garc\u00eda","family":"de la Banda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim","family":"Marriott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,5,2]]},"reference":[{"key":"6_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/3-540-58485-4_46","volume-title":"Proceedings of the 1st International Static Analysis Symposium","author":"T. Armstrong","year":"1994","unstructured":"T. Armstrong, K. Marriott, P. J. Schachte, and H. S\u00f8ndergaard. Boolean functions for dependency analysis: Algebraic properties and efficient representation. In Proceedings of the 1st International Static Analysis Symposium, B. Le Charlier, Ed. Lecture Notes in Computer Science, vol. 864. Springer-Verlag, Berlin, 266\u2013280, 1994."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"F. Bueno, M. Garc\u00eda de la Banda, M. Hermenegildo, K. Marriott, G. Puebla, and P. J. Stuckey. Inter-module Analysis and Optimizing Compilation. Department of Computer Science and Software Engineering, University of Melbourne, Forthcoming Technical Report, 2001.","DOI":"10.1007\/3-540-45142-0_6"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"F. Bueno, M. Garc\u00eda de la Banda, M. Hermenegildo, and K. Muthukumar. Automatic compile-time parallelization of logic programs for restricted, goal-level, independent and-parallelism. Journal of Logic Programming 38, 2, 165\u2013218.","DOI":"10.1016\/S0743-1066(98)10022-5"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"M. Codish, S. K. Debray, and R. Giacobazzi. Compositional analysis of modular logic programs. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages POPL\u201993, pages 451\u2013464, Charleston, South Carolina, 1993. ACM.","DOI":"10.1145\/158511.158703"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract Interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Fourth ACM Symposium on Principles of Programming Languages, 238\u2013252, 1977.","DOI":"10.1145\/512950.512973"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"S. I. Feldman. Make-a program for maintaining computer programs. Software-Practice and Experience, 1979.","DOI":"10.1002\/spe.4380090402"},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/349214.349216","volume":"22","author":"M. Hermenegildo","year":"2000","unstructured":"M. Hermenegildo, G. Puebla, K. Marriott, and P. J. Stuckey. Incremental analysis of constraint logic programs. ACM Transactions on Programming Languages and Systems, 22(2):187\u2013223, 2000.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"6","key":"6_CR8","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1145\/295656.295661","volume":"20","author":"A. Kelly","year":"1998","unstructured":"A. Kelly, A. Macdonald, K. Marriott, H. S\u00f8ndergaard, and P. J. Stuckey. Optimizing compilation for CLP(R). ACM Transactions on Programming Languages and Systems, 20(6):1223\u20131250, 1998.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2\/3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0743-1066(92)90035-2","volume":"13","author":"K. Muthukumar","year":"1992","unstructured":"K. Muthukumar and M. Hermenegildo. Compile-time Derivation of Variable Dependency Using Abstract Interpretation. Journal of Logic Programming, 13(2\/3):315\u2013347, July 1992.","journal-title":"Journal of Logic Programming"},{"issue":"2&3","key":"6_CR10","first-page":"279","volume":"41","author":"G. Puebla","year":"1999","unstructured":"G. Puebla and M. Hermenegildo. Abstract multiple specialization and its application to program parallelization. J. of Logic Programming. Special Issue on Synthesis, Transformation and Analysis of Logic Programs, 41(2&3):279\u2013316, 1999.","journal-title":"J. of Logic Programming. Special Issue on Synthesis, Transformation and Analysis of Logic Programs"},{"key":"6_CR11","unstructured":"G. Puebla and M. Hermenegildo. Some issues in analysis and specialization of modular Ciao-Prolog programs. In [20]."},{"key":"6_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/3-540-48166-4_15","volume-title":"Proceedings of ESEC\/FSE\u2019 99","author":"A. Rountev","year":"1999","unstructured":"A. Rountev, B. G. Ryder, and W. Landi. Data-flow analysis of program fragments. In Proceedings of ESEC\/FSE\u2019 99, volume 1687 of LNCS, pages 235\u2013252. Springer-Verlag, 1999."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Z. Shao and A. Appel. Smartest recompilation. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages POPL\u201993, pages 439\u2013450, Charleston, South Carolina, 1993. ACM.","DOI":"10.1145\/158511.158702"},{"issue":"4","key":"6_CR14","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1145\/48022.214505","volume":"10","author":"R. W. Schwanke","year":"1988","unstructured":"R. W. Schwanke and G. E. Kaiser. Smarter recompilation. ACM Transactions on Programming Languages and Systems, 10(4):627\u2013632, 1988.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1-3","key":"6_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0743-1066(96)00068-4","volume":"29","author":"Z. Somogyi","year":"1996","unstructured":"Z. Somogyi, F. Henderson and T. Conway. The execution algorithm of Mercury: an efficient purely declarative logic programming language. Journal of Logic Programming, 29(1-3):17\u201364, 1996.","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"6_CR16","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/5956.5959","volume":"8","author":"W. Tichy","year":"1986","unstructured":"W. Tichy. Smart recompilation. ACM Transactions on Programming Languages and Systems, 8(3):273\u2013291, 1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR17","unstructured":"W. Vanhoof and Bruynooghe. Towards modular binding-time analysis for firstorder Mercury. In [20]."},{"key":"6_CR18","series-title":"Lect Notes Comput Sci","volume-title":"European Symposium on Programming","author":"H. Sondergaard","year":"1986","unstructured":"H. Sondergaard. An application of abstract interpretation of logic programs: occur check reduction. In European Symposium on Programming, LNCS 123, pages 327-338. Springer-Verlag, 1986."},{"issue":"2 and 3","key":"6_CR19","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0743-1066(92)90033-Y","volume":"13","author":"W. Winsborough","year":"1992","unstructured":"W. Winsborough. Multiple specialization using minimal-function graph semantics. Journal of Logic Programming, 13(2 and 3):259\u2013290, July 1992.","journal-title":"Journal of Logic Programming"},{"key":"6_CR20","unstructured":"Special Issue on Optimization and Implementation of Declarative Programming Languages, volume 30 of Electronic Notes in Theoretical Computer Science. Elsevier-North Holland, March 2000."}],"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-45142-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T16:27:19Z","timestamp":1556728039000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45142-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540421276","9783540451426"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45142-0_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}