{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:11:57Z","timestamp":1775873517130,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030452599","type":"print"},{"value":"9783030452605","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-45260-5_2","type":"book-chapter","created":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T14:03:06Z","timestamp":1587477786000},"page":"19-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A General Framework for Static Cost Analysis of Parallel Logic Programs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8503-8379","authenticated-orcid":false,"given":"Maximiliano","family":"Klemen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1092-2071","authenticated-orcid":false,"given":"Pedro","family":"L\u00f3pez-Garc\u00eda","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6984-7419","authenticated-orcid":false,"given":"John P.","family":"Gallagher","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9782-8135","authenticated-orcid":false,"given":"Jos\u00e9 F.","family":"Morales","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7583-323X","authenticated-orcid":false,"given":"Manuel V.","family":"Hermenegildo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,22]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-25318-8_19","volume-title":"Programming Languages and Systems","author":"E Albert","year":"2011","unstructured":"Albert, E., Arenas, P., Genaim, S., G\u00f3mez-Zamalloa, M., Puebla, G.: Cost analysis of concurrent OO programs. In: Yang, H. (ed.) APLAS 2011. LNCS, vol. 7078, pp. 238\u2013254. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-25318-8_19"},{"issue":"2","key":"2_CR2","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10817-010-9174-1","volume":"46","author":"E Albert","year":"2011","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G.: Closed-form upper bounds in static cost analysis. J. Autom. Reason. 46(2), 161\u2013203 (2011)","journal-title":"J. Autom. Reason."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Albert, E., Arenas, P., Genaim, S., Zanardini, D.: Task-level analysis for a language with async-finish parallelism. In: Proceedings of LCTES 2011, pp. 21\u201330. ACM Press (2011)","DOI":"10.1145\/2016603.1967681"},{"issue":"4","key":"2_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3274278","volume":"19","author":"E Albert","year":"2018","unstructured":"Albert, E., Correas, J., Johnsen, E., Pu, K., Rom\u00e1n-D\u00edez, G.: Parallel cost analysis. ACM Trans. Comput. Logic 19(4), 1\u201337 (2018)","journal-title":"ACM Trans. Comput. Logic"},{"issue":"3","key":"2_CR5","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1137\/S0895480192232862","volume":"8","author":"L Alonso","year":"1995","unstructured":"Alonso, L., Reingold, E., Schott, R.: Multidimensional divide-and-conquer maximin recurrences. SIAM J. Discret. Math. 8(3), 428\u2013447 (1995)","journal-title":"SIAM J. Discret. Math."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Blelloch, G.E., Greiner, J.: A provable time and space efficient implementation of NESL. In: ACM International Conference on Functional Programming, pp. 213\u2013225, May 1996","DOI":"10.1145\/232629.232650"},{"issue":"5","key":"2_CR7","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1145\/161468.161472","volume":"15","author":"SK Debray","year":"1993","unstructured":"Debray, S.K., Lin, N.W.: Cost analysis of logic programs. ACM TOPLAS 15(5), 826\u2013875 (1993)","journal-title":"ACM TOPLAS"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Debray, S.K., Lin, N.W., Hermenegildo, M.V.: Task granularity analysis in logic programs. In: Proceedings of the PLDI 1990, pp. 174\u2013188. ACM, June 1990","DOI":"10.1145\/93548.93564"},{"key":"2_CR9","unstructured":"Debray, S.K., Lopez-Garcia, P., Hermenegildo, M.V., Lin, N.W.: Lower bound cost estimation for logic programs. In: ILPS 1997, pp. 291\u2013305. MIT Press (1997)"},{"issue":"4","key":"2_CR10","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.V.: Parallel execution of prolog programs: a survey. ACM TOPLAS 23(4), 472\u2013602 (2001)","journal-title":"ACM TOPLAS"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-29604-3_11","volume-title":"Functional and Logic Programming","author":"R Haemmerl\u00e9","year":"2016","unstructured":"Haemmerl\u00e9, R., L\u00f3pez-Garc\u00eda, P., Liqat, U., Klemen, M., Gallagher, J.P., Hermenegildo, M.V.: A transformational approach to parametric accumulated-cost static profiling. In: Kiselyov, O., King, A. (eds.) FLOPS 2016. LNCS, vol. 9613, pp. 163\u2013180. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-29604-3_11"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Harper, R.: Practical Foundations for Programming Languages, 2 edn. Cambridge University Press (2016). \nhttps:\/\/doi.org\/10.1017\/CBO9781316576892","DOI":"10.1017\/CBO9781316576892"},{"issue":"1\u20132","key":"2_CR13","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.scico.2005.02.006","volume":"58","author":"M Hermenegildo","year":"2005","unstructured":"Hermenegildo, M., Puebla, G., Bueno, F., Garcia, P.L.: Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor). Sci. Comput. Program. 58(1\u20132), 115\u2013140 (2005)","journal-title":"Sci. Comput. Program."},{"issue":"1","key":"2_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0743-1066(93)00007-F","volume":"22","author":"M Hermenegildo","year":"1995","unstructured":"Hermenegildo, M., Rossi, F.: Strict And non-strict independent and-parallelism in logic programs: correctness, efficiency, and compile-time conditions. J. Log. Program. 22(1), 1\u201345 (1995)","journal-title":"J. Log. Program."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Hoefler, T., Kwasniewski, G.: Automatic complexity analysis of explicitly parallel programs. In: 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2014, pp. 226\u2013235 (2014)","DOI":"10.1145\/2612669.2612685"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-662-46669-8_6","volume-title":"Programming Languages and Systems","author":"J Hoffmann","year":"2015","unstructured":"Hoffmann, J., Shao, Z.: Automatic static cost analysis for parallel programs. In: Vitek, J. (ed.) ESOP 2015. LNCS, vol. 9032, pp. 132\u2013157. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-46669-8_6"},{"issue":"3","key":"2_CR17","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1016\/S0304-3975(02)00066-X","volume":"290","author":"H Hwang","year":"2003","unstructured":"Hwang, H., Tsai, T.H.: An asymptotic theory for recurrence relations based on minimization and maximization. Theoret. Comput. Sci. 290(3), 1475\u20131501 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR18","unstructured":"Klemen, M., Lopez-Garcia, P., Gallagher, J., Morales, J., Hermenegildo, M.V.: Towards a general framework for static cost analysis of parallel logic programs. Technical report CLIP-1\/2019.0, The CLIP Lab, IMDEA Software Institute and T.U. Madrid, July 2019. \nhttp:\/\/arxiv.org\/abs\/1907.13272"},{"key":"2_CR19","unstructured":"Lopez-Garcia, P., Darmawan, L., Bueno, F.: A framework for verification and debugging of resource usage properties. In: Technical Communications of ICLP. LIPIcs, vol. 7, pp. 104\u2013113. Schloss Dagstuhl, July 2010"},{"key":"2_CR20","first-page":"167","volume":"18","author":"P Lopez-Garcia","year":"2018","unstructured":"Lopez-Garcia, P., Darmawan, L., Klemen, M., Liqat, U., Bueno, F., Hermenegildo, M.V.: Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption. TPLP 18, 167\u2013223 (2018)","journal-title":"TPLP"},{"issue":"5\u20136","key":"2_CR21","first-page":"849","volume":"16","author":"P Lopez-Garcia","year":"2016","unstructured":"Lopez-Garcia, P., Klemen, M., Liqat, U., Hermenegildo, M.V.: A general framework for static profiling of parametric resource usage. TPLP 16(5\u20136), 849\u2013865 (2016)","journal-title":"TPLP"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-78769-3_11","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M M\u00e9ndez-Lojo","year":"2008","unstructured":"M\u00e9ndez-Lojo, M., Navas, J., Hermenegildo, M.V.: A flexible, (C)LP-based approach to the analysis of object-oriented programs. In: King, A. (ed.) LOPSTR 2007. LNCS, vol. 4915, pp. 154\u2013168. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-78769-3_11"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Moura de","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-540-74610-2_24","volume-title":"Logic Programming","author":"J Navas","year":"2007","unstructured":"Navas, J., Mera, E., L\u00f3pez-Garc\u00eda, P., Hermenegildo, M.V.: User-definable resource bounds analysis for logic programs. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 348\u2013363. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-74610-2_24"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Rosendahl, M.: Automatic complexity analysis. In: Proceedings of FPCA 1989, pp. 144\u2013156. ACM Press (1989)","DOI":"10.1145\/99370.99381"},{"issue":"4\u20135","key":"2_CR26","first-page":"739","volume":"14","author":"A Serrano","year":"2014","unstructured":"Serrano, A., Lopez-Garcia, P., Hermenegildo, M.V.: Resource usage analysis of logic programs via abstract interpretation using sized types. TPLP 14(4\u20135), 739\u2013754 (2014). ICLP 2014 Special Issue","journal-title":"TPLP"},{"issue":"5","key":"2_CR27","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/BF02583023","volume":"24","author":"K Shen","year":"1996","unstructured":"Shen, K., Hermenegildo, M.: High-level characteristics of or- and Independent and-parallelism in Prolog. Int. J. Parallel Prog. 24(5), 433\u2013478 (1996). \nhttps:\/\/doi.org\/10.1007\/BF02583023","journal-title":"Int. J. Parallel Prog."},{"issue":"1","key":"2_CR28","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/S0304-3975(98)00334-X","volume":"242","author":"BF Wang","year":"2000","unstructured":"Wang, B.F.: Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences. Theoret. Comput. Sci. 242(1), 377\u2013401 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"9","key":"2_CR29","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1145\/361002.361016","volume":"18","author":"B Wegbreit","year":"1975","unstructured":"Wegbreit, B.: Mechanical program analysis. Comm. ACM 18(9), 528\u2013539 (1975)","journal-title":"Comm. ACM"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45260-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T14:05:25Z","timestamp":1587477925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45260-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030452599","9783030452605"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45260-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOPSTR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logic-Based Program Synthesis and Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cs.unibo.it\/projects\/lopstr19\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}