{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:55Z","timestamp":1725664195310},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584858"},{"type":"electronic","value":"9783540490050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58485-4_48","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:28:06Z","timestamp":1330255686000},"page":"297-313","source":"Crossref","is-referenced-by-count":2,"title":["Extracting Non-strict independent and-parallelism using sharing and freeness information"],"prefix":"10.1007","author":[{"given":"Daniel Cabeza","family":"Gras","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Hermenegildo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"19_CR1","first-page":"227","volume-title":"Combinations of Abstract Domains for Logic Programming","author":"B. Charlier Le","year":"1994","unstructured":"B. Le Charlier A. Cortesi, and P. Van Hentenryck. Combinations of Abstract Domains for Logic Programming. In POPL'94: 21ST ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 227\u2013239, Portland, Oregon, January 1994. ACM."},{"key":"19_CR2","first-page":"669","volume-title":"An Instance of Abstract Interpretation Integrating Type and Mode Inference","author":"M. Bruynooghe","year":"1988","unstructured":"M. Bruynooghe, and G. Janssens. An Instance of Abstract Interpretation Integrating Type and Mode Inference. In Fifth International Conference and Symposium on Logic Programming, pages 669\u2013683, Seattle, Washington, August 1988. MIT Press."},{"key":"19_CR3","volume-title":"Technical Report TR Number CLIP7\/93.0","author":"F. Bueno","year":"1993","unstructured":"F. Bueno, M. Garc\u00eda de la Banda, and M. Hermenegildo. Effectiveness of Global Analysis in Strict Independence-Based Automatic Program Parallelization. Technical Report TR Number CLIP7\/93.0, T.U. of Madrid (UPM), Facultad Inform\u00e1tica UPM, 28660-Boadilla del Monte, Madrid-Spain, October 1993."},{"key":"19_CR4","volume-title":"Technical Report TR Number CLIP5\/92.1","author":"D. Cabeza","year":"1993","unstructured":"D. Cabeza, and M. Hermenegildo. Towards Extracting Non-strict Independent And-parallelism Using Sharing and Freeness Information. Technical Report TR Number CLIP5\/92.1, U. of Madrid (UPM), Facultad Informatica UPM, 28660-Boadilla del Monte, Madrid-Spain, August 1993."},{"unstructured":"M. Carlsson. Sicstus Prolog User's Manual. Po Box 1263, S-16313 Spanga, Sweden, February 1988.","key":"19_CR5"},{"doi-asserted-by":"crossref","unstructured":"M. Codish, A. Mulkers, M. Bruynooghe, M.J.Garc\u00eda de la Banda, and M. Hermenegildo. Improving Abstract Interpretations by Combining Domains. In Proc. ACM SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation, pages 194\u2013206. ACM, June 1993.","key":"19_CR6","DOI":"10.1145\/154630.154650"},{"unstructured":"Michael Codish, Dennis Dams, Gilberto File, and Maurice Bruynooghe. Freeness Analysis for Logic Programs \u2014 And Correctness? In Proc. Intl. Conf. on Logic Programming. MIT Press, 1993. To appear.","key":"19_CR7"},{"key":"19_CR8","series-title":"Technical Report 204","volume-title":"PhD thesis","author":"J. S. Conery","year":"1983","unstructured":"J. S. Conery. The And\/Or Process Model for Parallel Interpretation of Logic Programs. PhD thesis, The University of California At Irvine, 1983. Technical Report 204."},{"doi-asserted-by":"crossref","unstructured":"A. Cortesi and G. File. Abstract Interpretation of Logic Programs: an Abstract Domain for Groundness, Sharing, Freeness and Compoundness Analysis. In ACM Symposium on Partial Evaluation and Semantic Based Program Manipulation, pages 52\u201361, New York, 1991.","key":"19_CR9","DOI":"10.1145\/115866.115872"},{"unstructured":"D. DeGroot. Restricted AND-Parallelism. In International Conference on Fifth Generation Computer Systems, pages 471\u2013478. Tokyo, November 1984.","key":"19_CR10"},{"unstructured":"V. Dumortier, G. Janssens, M. Bruynooghe, and M. Codish. Freeness Analysis in the Presence of Numerical Constraints. In Tenth International Conference on Logic Programming, pages 100\u2013115. MIT Press, June 1993.","key":"19_CR11"},{"unstructured":"G. Gupta and B. Jayaraman. Compiled And-Or Parallelism on Shared Memory Multiprocessors. In 1989 North American Conference on Logic Programming, pages 332\u2013349. MIT Press, October 1989.","key":"19_CR12"},{"unstructured":"S. Haridi and S. Janson. Kernel Andorra Prolog and its Computation Model. In Proceedings of the Seventh International Conference on Logic Programming, pages 31\u201346. MIT Press, June 1990.","key":"19_CR13"},{"unstructured":"M. Hermenegildo and K. Greene. &-Prolog and its Performance: Exploiting Independent And-Parallelism. In 1990 International Conference on Logic Programming, pages 253\u2013268. MIT Press, June 1990.","key":"19_CR14"},{"issue":"3","key":"19_CR15","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF03037164","volume":"9","author":"M. Hermenegildo","year":"1991","unstructured":"M. Hermenegildo, and K. Greene. The &-prolog System: Exploiting Independent And-Parallelism. New Generation Computing, 9(3,4):233\u2013257, 1991.","journal-title":"New Generation Computing"},{"unstructured":"M. Hermenegildo and F. Rossi. On the Correctness and Efficiency of Independent And-Parallelism in Logic Programs. In 1989 North American Conference on Logic Programming, pages 369\u2013390. MIT Press, October 1989.","key":"19_CR16"},{"unstructured":"M. Hermenegildo and F. Rossi. Non-Strict Independent And-Parallelism. In 1990 International Conference on Logic Programming, pages 237\u2013252. MIT Press, June 1990.","key":"19_CR17"},{"doi-asserted-by":"crossref","unstructured":"M. Hermenegildo and F. Rossi. Strict and Non-Strict Independent And-Parallelism in Logic Programs: Correctness, Efficiency, and Compile-Time Conditions. Journal of Logic Programming, 1994. To appear.","key":"19_CR18","DOI":"10.1016\/0743-1066(93)00007-F"},{"unstructured":"D. Jacobs and A. Langen. Accurate and Efficient Approximation of Variable Aliasing in Logic Programs. In 1989 North American Conference on Logic Programming. MIT Press, October 1989.","key":"19_CR19"},{"unstructured":"S. Janson and S. Haridi. Programming Paradigms of the Andorra Kernel Language. In 1991 International Logic Programming Symposium, pages 167\u2013183. MIT Press, 1991.","key":"19_CR20"},{"unstructured":"K. Muthukumar and M. Hermenegildo. Determination of Variable Dependence Information at Compile-Time Through Abstract Interpretation. In 1989 North American Conference on Logic Programming, pages 166\u2013189. MIT Press, October 1989.","key":"19_CR21"},{"unstructured":"K. Muthukumar and M. Hermenegildo. The CDG, UDG, and MEL Methods for Automatic Compile-time Parallelization of Logic Programs for Independent And-parallelism. In 1990 International Conference on Logic Programming, pages 221\u2013237. MIT Press, June 1990.","key":"19_CR22"},{"unstructured":"K. Muthukumar and M. Hermenegildo. Combined Determination of Sharing and Freeness of Program Variables Through Abstract Interpretation. In 1991 International Conference on Logic Programming, pages 49\u201363. MIT Press, June 1991.","key":"19_CR23"},{"unstructured":"B. Ramkumar and L. V. Kale. Compiled Execution of the Reduce-OR Process Model on Multiprocessors. In 1989 North American Conference on Logic Programming, pages 313\u2013331. MIT Press, October 1989.","key":"19_CR24"},{"key":"19_CR25","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0304-3975(84)90119-1","volume":"34","author":"T. Sato","year":"1984","unstructured":"T. Sato, and H. Tamaki. Enumeration of Success Patterns in Logic Programs. Theoretical Computer Science, 34:227\u2013240, 1984.","journal-title":"Theoretical Computer Science"},{"unstructured":"K. Shen. Studies in And\/Or Parallelism in Prolog. PhD thesis, U. of Cambridge, 1992.","key":"19_CR26"},{"doi-asserted-by":"crossref","unstructured":"H. Sondergaard. An application of abstract interpretation of logic programs: occur check reduction. In European Symposium on Programming, LNCS 123, pages 327\u2013338. Springer-Verlag, 1986.","key":"19_CR27","DOI":"10.1007\/3-540-16442-1_25"},{"key":"19_CR28","volume-title":"Parallel Logic Programming Workshop","author":"D.H.D. Warren","year":"1990","unstructured":"D.H.D. Warren. The Extended Andorra Model with Implicit Control. In Sverker Jansson, editor, Parallel Logic Programming Workshop, Box 1263, S-163 13 Spanga, SWEDEN, June 1990. SICS."}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58485-4_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:22:22Z","timestamp":1605630142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58485-4_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584858","9783540490050"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-58485-4_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}