{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T23:10:09Z","timestamp":1710285009781},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1007\/bf03038311","type":"journal-article","created":{"date-parts":[[2009,4,27]],"date-time":"2009-04-27T04:03:09Z","timestamp":1240804989000},"page":"117-154","source":"Crossref","is-referenced-by-count":9,"title":["Deriving linear size relations for logic programs by abstract interpretation"],"prefix":"10.1007","volume":"13","author":[{"given":"Danny","family":"De Schreye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristof","family":"Verschaetse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"BF03038311_CR1","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/151646.151650","volume":"15","author":"R. Barbuti","year":"1991","unstructured":"Barbuti, R., Giacobazzi, R., and Levi, G., \u201cA General Framework for Semanties-Based Bottom-up Abstract Interpretation of Logic Programs,\u201dACM Transactions on Programming Languages and Systems, 15, 1, pp. 133\u2013181, 1991.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"BF03038311_CR2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(92)00019-N","volume":"124","author":"A. Bossi","year":"1994","unstructured":"Bossi, A., Cocco, N., and Fabris, M., \u201cNorms on Terms and Their Use in Proving Universal Termination of a Logic Program,\u201dTheoretical Computer Science, 124, 2, pp. 297\u2013328, 1994.","journal-title":"Theoretical Computer Science"},{"key":"BF03038311_CR3","doi-asserted-by":"crossref","unstructured":"Brodsky, A. and Sagiv, Y., \u201cInference of Inequality Constraints in Logic Programs,\u201d inProceedings of the 10th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Denver, Colorado, pp. 227\u2013240, 1991.","DOI":"10.1145\/113413.113434"},{"key":"BF03038311_CR4","unstructured":"Bruynooghe, M., \u201cA Framework for the Abstract Interpretation of Logic Programs,\u201dTechnical Report CW-report, Department of Computer Science, K. U. Leuven, 1989."},{"issue":"2","key":"BF03038311_CR5","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0743-1066(91)80001-T","volume":"10","author":"M. Bruynooghe","year":"1991","unstructured":"Bruynooghe, M., \u201cA Practical Framework for the Abstract Interpretation of Logic Programs,\u201dJournal of Logic Programming, 10, 2, pp. 91\u2013124, 1991.","journal-title":"Journal of Logic Programming"},{"key":"BF03038311_CR6","doi-asserted-by":"crossref","unstructured":"Bruynooghe, M. and Boulanger, D., \u201cAbstract Interpretation for (Constraint) Logic Programming,\u201d inCosntraint Programming (E. Tyogu, B. Mayoh and J. Penjam, eds.), NATO Advanced Science Series, Springer-Verlag, pp. 228\u2013260, 1994.","DOI":"10.1007\/978-3-642-85983-0_9"},{"key":"BF03038311_CR7","doi-asserted-by":"crossref","unstructured":"Bruynooghe, M., Dumortier, V., and Janssens, G., \u201cImproving the Efficiency of Constraint Logic Programming Languages by Deriving Specialized Versions,\u201d inProceedings PDK\u201991, LNAI567, Kaiserslautern, Springer-Verlag, pp. 309\u2013317, 1991.","DOI":"10.1007\/BFb0013540"},{"issue":"2 & 3","key":"BF03038311_CR8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P. Cousot","year":"1992","unstructured":"Cousot, P. and Cousot, R., \u201cAbstract Interpretation and Application to Logic Programming,\u201dJournal of Logic Programming, 13, 2 & 3, pp. 103\u2013180, 1992.","journal-title":"Journal of Logic Programming"},{"key":"BF03038311_CR9","doi-asserted-by":"crossref","unstructured":"Cousot, P. and Halbwachs, N., \u201cAutomatic Discovery of Linear Restraints among Variables of a Program,\u201d inProceedings 5th ACM Symposium on Principles of Programming Languages, pp. 84\u201396, 1978.","DOI":"10.1145\/512760.512770"},{"key":"BF03038311_CR10","doi-asserted-by":"crossref","unstructured":"De Schreye, D. and Decorte, S., \u201cTermination of Logic Programs: The Never-Ending Story,\u201dJournal of Logic Programming, pp. 199\u2013261, 1994.","DOI":"10.1016\/0743-1066(94)90027-2"},{"key":"BF03038311_CR11","unstructured":"De Schreye, D., Verschaetse, K., and Bruynooghe, M., \u201cA Framework for Analysing the Termination of Definite Logic Programs with Respect to Call Patterns,\u201d inProceedings FGCS\u201992, Tokyo, ICOT, pp. 481\u2013488, 1992."},{"key":"BF03038311_CR12","unstructured":"Debray, S. K. and Lin, N.-W., \u201cAutomatic Complexity Analysis of Logic Programs,\u201d inProceedings ICLP\u201991, pp. 599\u2013613, 1991."},{"key":"BF03038311_CR13","doi-asserted-by":"crossref","unstructured":"Debray, S. K., Lin, N.-W., and Hermenegildo, M., \u201cTask Granularity Analysis in Logic Programs,\u201d inProceedings ACM SIGPLAN\u201990 Conference on Programming Language Design and Implementation, pp. 174\u2013188, 1990.","DOI":"10.1145\/93548.93564"},{"issue":"3","key":"BF03038311_CR14","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","volume":"69","author":"M. Falaschi","year":"1989","unstructured":"Falaschi, M., Levi, G., Martelli, M., and Palamidessi, C., \u201cDeclatative Modeling of the Operational Behaviour of Logic Languages,\u201dTheoretical Computer Science, 69, 3, pp. 289\u2013318, 1989.","journal-title":"Theoretical Computer Science"},{"key":"BF03038311_CR15","unstructured":"Gill, P. E., Murray, W., and Wright, M. H.,Numerical Linear Algebra and Optimizaiton, Volume 1, Addsion-Wesley, 1991."},{"issue":"2 & 3","key":"BF03038311_CR16","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0743-1066(92)90032-X","volume":"13","author":"G. Janssens","year":"1992","unstructured":"Janssens, G. and Bruynooghe, M., \u201cDeriving descriptions of Possible Values of Program Variables by Means of Abstract Interpretation,\u201dJournal of Logic Programming, 13, 2 & 3, pp. 205\u2013258, 1992.","journal-title":"Journal of Logic Programming"},{"key":"BF03038311_CR17","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF00268497","volume":"6","author":"M. Karr","year":"1976","unstructured":"Karr, M., \u201cAffine Relationships among Variables of a Program,\u201dActa Informatica, 6, pp. 133\u2013151, 1976.","journal-title":"Acta Informatica"},{"key":"BF03038311_CR18","first-page":"733","volume-title":"Proceedings ICSLP, 88","author":"K. Marriott","year":"1988","unstructured":"Marriott, K. and S\u00f8ndergaard, H., \u201cBottom-up Abstract Interpretation of Logic Programs,\u201d inProceedings ICSLP, 88 (R. A. Kowalski and K. A. Bowen, eds.), Seattle, MIT Press, pp. 733\u2013748, 1988."},{"key":"BF03038311_CR19","unstructured":"Millroth, H., \u201cReforming Compilation of Logic Programs,\u201dPh. D thesis, UPMAIL Computing Science Department, Uppsala University, 1990. [To appear inLNCS, Springer-Verlag.]"},{"key":"BF03038311_CR20","doi-asserted-by":"crossref","unstructured":"Pl\u00fcmer, L., \u201cTermination Proofs for Logic Programs,\u201dNumber 446 in LNAI, Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52837-7"},{"key":"BF03038311_CR21","unstructured":"Schrijver, A.,Theory of Linear and Interger Programming, Wiley & Sons, 1986."},{"issue":"2","key":"BF03038311_CR22","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/42282.42285","volume":"35","author":"J. D. Ullman","year":"1988","unstructured":"Ullman, J. D. and Van Gelder, A., \u201cEfficient Tests for Top-down Termination of Logical Rules,\u201dJournal ACM, 35, 2, pp. 345\u2013373, 1988.","journal-title":"Journal ACM"},{"key":"BF03038311_CR23","doi-asserted-by":"crossref","unstructured":"Van Gelder, A., \u201cDeriving Constraints among Arguments Sizes in Logic Programs,\u201d inProceedings PODS91, ACM Press, pp. 47\u201360, 1991.","DOI":"10.1145\/298514.298541"},{"key":"BF03038311_CR24","unstructured":"Verschaetse, K., \u201cStatic Termination Analysis for Definite Horn Clause Programs,\u201dPh. D thesis, Department of Computer Science, K. U. Leuven, 1992."},{"key":"BF03038311_CR25","first-page":"301","volume-title":"Proceedings ICLP\u201991","author":"K. Verschaetse","year":"1991","unstructured":"Verschaetse, K. and De Schreye, D., \u201cDeriving Termination Proofs for Logic Programs, Using Abstract Procedures,\u201d inProceedings ICLP\u201991, Paris, MIT Press, pp. 301\u2013315, 1991."},{"key":"BF03038311_CR26","first-page":"296","volume-title":"Proceedings PLILP\u201992, LNCS","author":"K. Verschaetse","year":"1992","unstructured":"Verschaetse, K. and De Schreye, D., \u201cDerivation of Linear Size Relations by Abstract Interpretation,\u201d inProceedings PLILP\u201992, LNCS (M. Bruynooghe and M. Wirsing, eds.), Leuven, Springer-Verlag, pp. 296\u2013310, 1992."},{"key":"BF03038311_CR27","doi-asserted-by":"crossref","unstructured":"Verschaetse, K., Decorte, S., and De Schreye, D., \u201cAutomatic Termination Analysis,\u201d inProceedings LOPSTR\u201992, LNCS (K. K. Lau and T. Clement, eds.), Springer-Verlag, 1993.","DOI":"10.1007\/978-1-4471-3560-9_12"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03038311.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03038311\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03038311","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T22:56:20Z","timestamp":1710284180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03038311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["BF03038311"],"URL":"https:\/\/doi.org\/10.1007\/bf03038311","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}