{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T20:20:35Z","timestamp":1768162835507,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540266556","type":"print"},{"value":"9783540316831","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11506676_2","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T16:07:52Z","timestamp":1279469272000},"page":"19-35","source":"Crossref","is-referenced-by-count":10,"title":["Determinacy Analysis for Logic Programs Using Mode and Type Information"],"prefix":"10.1007","author":[{"given":"P.","family":"L\u00f3pez-Garc\u00eda","sequence":"first","affiliation":[]},{"given":"F.","family":"Bueno","sequence":"additional","affiliation":[]},{"given":"M.","family":"Hermenegildo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Aspvall, B., Shiloach, Y.: A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality. In: Proc. 20th ACM Symposium on Foundations of Computer Science, October 1979, pp. 205\u2013217 (1979)","DOI":"10.1109\/SFCS.1979.1"},{"key":"2_CR2","first-page":"457","volume-title":"Proc. International Symposium on Logic Programming","author":"C. Braem","year":"1994","unstructured":"Braem, C., Le Charlier, B., Modart, S., Van Hentenryck, P.: Cardinality analysis of prolog. In: Proc. International Symposium on Logic Programming, Ithaca, NY, pp. 457\u2013471. MIT Press, Cambridge (1994)"},{"key":"2_CR3","first-page":"157","volume-title":"Types in Logic Programming","author":"P.W. Dart","year":"1992","unstructured":"Dart, P.W., Zobel, J.: A Regular Type Language for Logic Programs. In: Types in Logic Programming, pp. 157\u2013187. MIT Press, Cambridge (1992)"},{"key":"2_CR4","first-page":"424","volume-title":"1993 International Conference on Logic Programming","author":"S. Dawson","year":"1993","unstructured":"Dawson, S., Ramakrishnan, C.R., Ramakrishnan, I.V., Sekar, R.C.: Extracting Determinacy in Logic Programs. In: 1993 International Conference on Logic Programming, pp. 424\u2013438. MIT Press, Cambridge (1993)"},{"issue":"5","key":"2_CR5","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1145\/161468.161472","volume":"15","author":"S.K. Debray","year":"1993","unstructured":"Debray, S.K., Lin, N.W.: Cost analysis of logic programs. ACM Transactions on Programming Languages and Systems\u00a015(5), 826\u2013875 (1993)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"2_CR6","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/65979.65984","volume":"11","author":"S.K. Debray","year":"1989","unstructured":"Debray, S.K., Warren, D.S.: Functional computations in logic programs. ACM Transactions on Programming Languages and Systems\u00a011(3), 451\u2013481 (1989)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Demoen, B., Garcia de la Banda, M., Harvey, W., Marriott, K., Stuckey, P.: An overview of HAL. In: PPCP1999: Principles and Practice of Constraint Programming, pp. 174\u2013178 (1999)","DOI":"10.1007\/978-3-540-48085-3_13"},{"key":"2_CR8","first-page":"599","volume-title":"Proc.\u00a0of the 11th International Conference on Logic Programming","author":"J.P. Gallagher","year":"1994","unstructured":"Gallagher, J.P., de Waal, D.A.: Fast and precise regular approximations of logic programs. In: Van Hentenryck, P. (ed.) Proc.\u00a0of the 11th International Conference on Logic Programming, pp. 599\u2013613. MIT Press, Cambridge (1994)"},{"key":"2_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"2_CR10","first-page":"167","volume-title":"Symposium proceedings on 4th European symposium on programming","author":"R. Giacobazzi","year":"1992","unstructured":"Giacobazzi, R., Ricci, L.: Detecting determinate computations by bottom-up abstract interpretation. In: Symposium proceedings on 4th European symposium on programming, pp. 167\u2013181. Springer, Heidelberg (1992)"},{"issue":"4","key":"2_CR11","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1145\/504083.504085","volume":"23","author":"G. Gupta","year":"2001","unstructured":"Gupta, G., Pontelli, E., Ali, K., Carlsson, M., Hermenegildo, M.: Parallel Execution of Prolog Programs: a Survey. ACM Transactions on Programming Languages and Systems\u00a023(4), 472\u2013602 (2001)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"2_CR12","unstructured":"Henderson, F., Somogyi, Z., Conway, T.: Determinism analysis in the Mercury compiler. In: Proc. Australian Computer Science Conference, Melbourne, Australia, January 1996, pp. 337\u2013346 (1996)"},{"issue":"2\/3","key":"2_CR13","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0096-0551(96)00011-2","volume":"22","author":"M. Hermenegildo","year":"1996","unstructured":"Hermenegildo, M., Carro, M.: Relating Data\u2013Parallelism and (And\u2013) Parallelism in Logic Programs. The Computer Languages Journal\u00a022(2\/3), 143\u2013163 (1996)","journal-title":"The Computer Languages Journal"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-44898-5_8","volume-title":"Static Analysis","author":"M. Hermenegildo","year":"2003","unstructured":"Hermenegildo, M., Puebla, G., Bueno, F., L\u00f3pez-Garc\u00eda, P.: Program Development Using Abstract Interpretation (and The Ciao System Preprocessor). In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, pp. 127\u2013152. Springer, Heidelberg (2003)"},{"issue":"1","key":"2_CR15","first-page":"135","volume":"5","author":"P.M. Hill","year":"1997","unstructured":"Hill, P.M., King, A.: Determinacy and determinacy analysis. Journal of Programming Languages\u00a05(1), 135\u2013171 (1997)","journal-title":"Journal of Programming Languages"},{"issue":"2 and 3","key":"2_CR16","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0743-1066(92)90032-X","volume":"13","author":"G. Janssens","year":"1992","unstructured":"Janssens, G., Bruynooghe, M.: Deriving Descriptions of Possible Values of Program Variables by means of Abstract Interpretation. Journal of Logic Programming\u00a013(2 and 3), 205\u2013258 (1992)","journal-title":"Journal of Logic Programming"},{"key":"2_CR17","first-page":"219","volume-title":"Proc. of the Fourth International Conference on Logic Programming","author":"K. Kunen","year":"1987","unstructured":"Kunen, K.: Answer Sets and Negation as Failure. In: Proc. of the Fourth International Conference on Logic Programming, pp. 219\u2013228. MIT Press, Cambridge (1987)"},{"key":"2_CR18","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/B978-0-934613-40-8.50019-1","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"J.-L. Lassez","year":"1988","unstructured":"Lassez, J.-L., Maher, M., Marriott, K.: Unification Revisited. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 587\u2013626. Morgan Kaufmann, San Francisco (1988)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Garc\u00eda, P., Bueno, F., Hermenegildo, M.: Towards Determinacy Analysis for Logic Programs Using Mode and Type Information. Technical Report CLIP4\/2005.0, Technical University of Madrid (UPM), School of Computer Science, UPM (April 2005)","DOI":"10.1007\/11506676_2"},{"key":"2_CR20","first-page":"715","volume":"22","author":"P. L\u00f3pez-Garc\u00eda","year":"1996","unstructured":"L\u00f3pez-Garc\u00eda, P., Hermenegildo, M., Debray, S.K.: A Methodology for Granularity Based Control of Parallelism in Logic Programs. Journal of Symbolic Computation, Special Issue on Parallel Symbolic Computation\u00a022, 715\u2013734 (1996)","journal-title":"Journal of Symbolic Computation, Special Issue on Parallel Symbolic Computation"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","first-page":"86","volume-title":"Information Context: Nature, Impact, and Role","author":"J. Morales","year":"2005","unstructured":"Morales, J., Carro, M., Hermenegildo, M.: Improving the Compilation of Prolog to C Using Moded Types and Determinism Information. In: Crestani, F., Ruthven, I. (eds.) CoLIS 2005. LNCS, vol.\u00a03507, pp. 86\u2013103. Springer, Heidelberg (2005)"},{"key":"2_CR22","first-page":"49","volume-title":"1991 International Conference on Logic Programming","author":"K. Muthukumar","year":"1991","unstructured":"Muthukumar, K., Hermenegildo, M.: Combined Determination of Sharing and Freeness of Program Variables Through Abstract Interpretation. In: 1991 International Conference on Logic Programming, June 1991, pp. 49\u201363. MIT Press, Cambridge (1991)"},{"issue":"8","key":"2_CR23","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1145\/135226.135233","volume":"35","author":"W. Pugh","year":"1992","unstructured":"Pugh, W.: A Practical Algorithm for Exact Array Dependence Analysis. Communications of the ACM\u00a035(8), 102\u2013114 (1992)","journal-title":"Communications of the ACM"},{"key":"2_CR24","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/109625.109635","volume-title":"Proceedings of the 3rd. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","author":"V. Santos-Costa","year":"1991","unstructured":"Santos-Costa, V., Warren, D.H.D., Yang, R.: Andorra-I: A Parallel Prolog System that Transparently Exploits both And- and Or-parallelism. In: Proceedings of the 3rd. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, July 1991, vol.\u00a07, pp. 83\u201393. ACM, New York (1991); SIGPLAN Notices vol 26(7) (July 1991)"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Somogyi, Z., Henderson, F., Conway, T.: The execution algorithm of Mercury: an efficient purely declarative logic programming language. JLP\u00a029(1-3) (1996)","DOI":"10.1016\/S0743-1066(96)00068-4"}],"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\/11506676_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:03:27Z","timestamp":1605643407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11506676_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540266556","9783540316831"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11506676_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}