{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:55:35Z","timestamp":1754484935019,"version":"3.40.3"},"publisher-location":"Cham","reference-count":63,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030654733"},{"type":"electronic","value":"9783030654740"}],"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"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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-65474-0_2","type":"book-chapter","created":{"date-parts":[[2021,1,13]],"date-time":"2021-01-13T13:13:42Z","timestamp":1610543622000},"page":"7-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Cost Analysis of Smart Contracts Via Parametric Resource Analysis"],"prefix":"10.1007","author":[{"given":"V\u00edctor","family":"P\u00e9rez","sequence":"first","affiliation":[]},{"given":"Maximiliano","family":"Klemen","sequence":"additional","affiliation":[]},{"given":"Pedro","family":"L\u00f3pez-Garc\u00eda","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 Francisco","family":"Morales","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Hermenegildo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,13]]},"reference":[{"key":"2_CR1","unstructured":"The Michelson Language Site. https:\/\/www.michelson-lang.com"},{"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","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-18275-4_5","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"E Albert","year":"2011","unstructured":"Albert, E., Genaim, S., Masud, A.N.: More precise yet widely applicable cost analysis. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 38\u201353. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18275-4_5"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Albert, E., Correas, J., Gordillo, P., Rom\u00e1n-D\u00edez, G., Rubio, A.: GASOL: gas analysis and optimization for ethereum smart contracts. In: Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2020. LNCS, vol. 12079, pp. 118\u2013125. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-45237-7_7","DOI":"10.1007\/978-3-030-45237-7_7"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Albert, E., Gordillo, P., Rubio, A., Sergey, I.: Running on fumes - preventing out-of-gas vulnerabilities in ethereum smart contracts using static resource analysis. In: VECoS 2019. LNCS, vol. 11847, pp. 63\u201378. Springer, October 2019. DOI: https:\/\/doi.org\/10.1007\/978-3-030-35092-5_5","DOI":"10.1007\/978-3-030-35092-5_5"},{"key":"2_CR6","unstructured":"Allombert, V., Bourgoin, M., Tesson, J.: Introduction to the tezos blockchain. CoRR abs\/1909.08458 (2019). http:\/\/arxiv.org\/abs\/1909.08458"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Avanzini, M., Lago, U.D.: Automating sized-type inference for complexity analysis. Proc. ACM Program. Lang. 1(ICFP), 43:1\u201343:29 (2017). https:\/\/doi.org\/10.1145\/3110287","DOI":"10.1145\/3110287"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Blazy, S., Pichardie, D., Trieu, A.: Verifying constant-time implementations by abstract interpretation. In: European Symposium on Research in Computer Security - ESORICS 2017. Lecture Notes in Computer Science, vol. 10492, pp. 260\u2013277. Springer, September 2017. https:\/\/doi.org\/10.1007\/978-3-319-66402-6_16","DOI":"10.1007\/978-3-319-66402-6_16"},{"key":"2_CR9","unstructured":"Bueno, F., Cabeza, D., Carro, M., Hermenegildo, M.V., Lopez-Garcia, P., Puebla-(Eds.), G.: The Ciao System. Ref. Manual (v1.13). Tech. rep., School of Computer Science, T.U. of Madrid (UPM) (2009). http:\/\/ciao-lang.org"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Chen, T., Li, X., Luo, X., Zhang, X.: Under-optimized smart contracts devour your money. In: IEEE 24th International Conference on Software Analysis, Evolution and Reengineering, SANER 2017. pp. 442\u2013446. IEEE Computer Society, February 2017 https:\/\/doi.org\/10.1109\/SANER.2017.7884650","DOI":"10.1109\/SANER.2017.7884650"},{"key":"2_CR11","unstructured":"\u00c7i\u00e7ek, E., Barthe, G., Gaboardi, M., Garg, D., Hoffmann, J.: Relational cost analysis. In: Castagna, G., Gordon, A.D. (eds.) Principles of Programming Languages, POPL 2017, pp. 316\u2013329. ACM (2017). http:\/\/dl.acm.org\/citation.cfm?id=3009858"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: ACM Symposium on Principles of Programming Languages (POPL 1977), pp. 238\u2013252. ACM Press (1977)","DOI":"10.1145\/512950.512973"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"De Angelis, E., Fioravanti, F., Pettorossi, A., Proietti, M.: Semantics-based generation of verification conditions by program specialization. In: 17th International Symposium on Principles and Practice of Declarative Programming, pp. 91\u2013102. ACM (July 2015). https:\/\/doi.org\/10.1145\/2790449.2790529","DOI":"10.1145\/2790449.2790529"},{"issue":"5","key":"2_CR14","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 Trans. Program. Lang. Syst. 15(5), 826\u2013875 (1993)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Debray, S.K., Lin, N.W., Hermenegildo, M.V.: Task granularity analysis in logic programs. In: Proceedings 1990 ACM Conference on Programming Language Design and Implementation (PLDI), pp. 174\u2013188. ACM Press (June 1990)","DOI":"10.1145\/93542.93564"},{"key":"2_CR16","unstructured":"Debray, S.K., Lopez-Garcia, P., Hermenegildo, M.V., Lin, N.W.: Lower bound cost estimation for logic programs. In: 1997 International Logic Programming Symposium, pp. 291\u2013305. MIT Press, Cambridge, MA (October 1997)"},{"issue":"5","key":"2_CR17","first-page":"45","volume":"2","author":"Y Futamura","year":"1971","unstructured":"Futamura, Y.: Partial evaluation of computation process - an approach to a compiler-compiler. Systems, Computers, Controls 2(5), 45\u201350 (1971)","journal-title":"Systems, Computers, Controls"},{"key":"2_CR18","unstructured":"Gallagher, J., Hermenegildo, M.V., Kafle, B., Klemen, M., Lopez-Garcia, P., Morales, J.: From big-step to small-step semantics and back with interpreter specialization (invited paper). In: International WS on Verification and Program Transformation (VPT 2020). pp. 50\u201365. EPTCS, Open Publishing Association (2020). http:\/\/eptcs.web.cse.unsw.edu.au\/paper.cgi?VPTHCVS2020.4"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Giesl, J., Str\u00f6der, T., Schneider-Kamp, P., Emmes, F., Fuhs, C.: Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs. In: Proceedings of PPDP 2012, pp. 1\u201312. ACM (2012)","DOI":"10.1145\/2370776.2370778"},{"key":"2_CR20","first-page":"1409","volume":"51","author":"M G\u00f3mez-Zamalloa","year":"2009","unstructured":"G\u00f3mez-Zamalloa, M., Albert, E., Puebla, G.: Decompilation of java bytecode to prolog by partial evaluation. JIST 51, 1409\u20131427 (2009)","journal-title":"JIST"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Grebenshchikov, S., Lopes, N.P., Popeea, C., Rybalchenko, A.: Synthesizing software verifiers from proof rules. In: Vitek, J., Lin, H., Tip, F. (eds.) ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2012, pp. 405\u2013416. ACM (2012). https:\/\/doi.org\/10.1145\/2254064.2254112","DOI":"10.1145\/2254064.2254112"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Grech, N., Kong, M., Jurisevic, A., Brent, L., Scholz, B., Smaragdakis, Y.: MadMax: surviving out-of-gas conditions in ethereum smart contracts. PACMPL 2(OOPSLA), 116:1\u2013116:27 (2018). https:\/\/doi.org\/10.1145\/3276486","DOI":"10.1145\/3276486"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Grobauer, B.: Cost recurrences for DML programs. In: Proceedings of ICFP 2001, pp. 253\u2013264. ACM, New York (2001). https:\/\/doi.org\/10.1145\/507635.507666, http:\/\/doi.acm.org\/10.1145\/507635.507666","DOI":"10.1145\/507635.507666"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Mehra, K.K., Chilimbi, T.M.: SPEED: precise and efficient static estimation of program computational complexity. In: The 36th Symposium on Principles of Programming Languages (POPL 2009), pp. 127\u2013139. ACM (2009)","DOI":"10.1145\/1594834.1480898"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Gurfinkel, A., Kahsai, T., Komuravelli, A., Navas, J.A.: The seahorn verification framework. In: International Conference on Computer Aided Verification, CAV 2015, pp. 343\u2013361. No. 9206 in LNCS, Springer (July 2015)","DOI":"10.1007\/978-3-319-21690-4_20"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Handley, M.A.T., Vazou, N., Hutton, G.: Liquidate your assets: reasoning about resource usage in liquid haskell. Proc. ACM Program. Lang. 4(POPL), 24:1\u201324:27 (2020). https:\/\/doi.org\/10.1145\/3371092","DOI":"10.1145\/3371092"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Henriksen, K.S., Gallagher, J.P.: Abstract interpretation of pic programs through logic programming. In: SCAM 2006. pp. 184\u2013196. IEEE Computer Society (2006)","DOI":"10.1109\/SCAM.2006.1"},{"key":"2_CR28","unstructured":"Hermenegildo, M.V., et al.: An overview of Ciao and its design philosophy. TPLP 12(1\u20132), 219\u2013252 (2012). http:\/\/arxiv.org\/abs\/1102.5497"},{"issue":"1\u20132","key":"2_CR29","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.scico.2005.02.006","volume":"58","author":"MV Hermenegildo","year":"2005","unstructured":"Hermenegildo, M.V., Puebla, G., Bueno, F., Lopez-Garcia, P.: Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor). Sci. Comput. Program. 58(1\u20132), 115\u2013140 (2005). https:\/\/doi.org\/10.1016\/j.scico.2005.02.006","journal-title":"Sci. Comput. Program."},{"issue":"2","key":"2_CR30","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/349214.349216","volume":"22","author":"MV Hermenegildo","year":"2000","unstructured":"Hermenegildo, M.V., Puebla, G., Marriott, K., Stuckey, P.: Incremental analysis of constraint logic programs. ACM TOPLAS 22(2), 187\u2013223 (2000)","journal-title":"ACM TOPLAS"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Hoffmann, J., Aehlig, K., Hofmann, M.: Multivariate amortized resource analysis. ACM TOPLAS 34(3), 14:1\u201314:62 (2012)","DOI":"10.1145\/2362389.2362393"},{"key":"2_CR32","doi-asserted-by":"publisher","unstructured":"Hofmann, M., Moser, G.: Multivariate amortised resource analysis for term rewrite systems. In: Altenkirch, T. (ed.) 13th International Conference on Typed Lambda Calculi and Applications. LIPIcs, vol. 38, pp. 241\u2013256. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (July 2015). https:\/\/doi.org\/10.4230\/LIPIcs.TLCA.2015.241","DOI":"10.4230\/LIPIcs.TLCA.2015.241"},{"key":"2_CR33","unstructured":"Igarashi, A., Kobayashi, N.: Resource usage analysis. In: Symposium on Principles of Programming Languages, pp. 331\u2013342. ACM (2002). http:\/\/www.citeseer.ist.psu.edu\/igarashi02resource.html"},{"key":"2_CR34","doi-asserted-by":"publisher","unstructured":"Kahn, G.: Natural semantics. Lecture Notes in Computer Science, vol. 247, pp. 22\u201339. Springer, Cham, February 1987. https:\/\/doi.org\/10.1007\/BFb0039592","DOI":"10.1007\/BFb0039592"},{"key":"2_CR35","doi-asserted-by":"publisher","unstructured":"Kahsai, T., R\u00fcmmer, P., Sanchez, H., Sch\u00e4f, M.: JayHorn: a framework for verifying Java programs. In: Chaudhuri, S., Farzan, A. (eds.) Computer Aided Verification - 28th International Conference, CAV 2016. LNCS, vol. 9779, pp. 352\u2013358. Springer, Cham, July 2016. https:\/\/doi.org\/10.1007\/978-3-319-41528-4_19","DOI":"10.1007\/978-3-319-41528-4_19"},{"key":"2_CR36","doi-asserted-by":"publisher","unstructured":"Kincaid, Z., Breck, J., Cyphert, J., Reps, T.W.: Closed forms for numerical loops. Proc. ACM Program. Lang. 3(POPL), 55:1\u201355:29 (2019). https:\/\/doi.org\/10.1145\/3290368","DOI":"10.1145\/3290368"},{"key":"2_CR37","doi-asserted-by":"publisher","unstructured":"Klemen, M., Lopez-Garcia, P., Gallagher, J., Morales, J., Hermenegildo, M.V.: A general framework for static cost analysis of parallel logic programs. In: International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR\u201919). LNCS, vol. 12042, pp. 19\u201335. Springer, Heidelberg, April 2020. https:\/\/doi.org\/10.1007\/978-3-030-45260-5_2","DOI":"10.1007\/978-3-030-45260-5_2"},{"key":"2_CR38","doi-asserted-by":"publisher","unstructured":"Klemen, M., Stulova, N., Lopez-Garcia, P., Morales, J.F., Hermenegildo, M.V.: Static performance guarantees for programs with run-time checks. In: International Symposium on Principles and Practice of Declarative Programming (PPDP 2018). ACM, September 2018. https:\/\/doi.org\/10.1145\/3236950.3236970","DOI":"10.1145\/3236950.3236970"},{"key":"2_CR39","doi-asserted-by":"crossref","unstructured":"Liqat, U., Bankovi\u0107, Z., Lopez-Garcia, P., Hermenegildo, M.V.: Inferring energy bounds via static program analysis and evolutionary modeling of basic blocks. In: Logic-Based Program Synthesis and Transformation - 27th International Symposium. LNCS, vol. 10855. Springer (2018)","DOI":"10.1007\/978-3-319-94460-9_4"},{"key":"2_CR40","doi-asserted-by":"publisher","unstructured":"Liqat, U., et al.: Inferring parametric energy consumption functions at different software levels: ISA vs. LLVM IR. In: Proceedings of FOPARA. LNCS, vol. 9964, pp. 81\u2013100. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-319-46559-3_5","DOI":"10.1007\/978-3-319-46559-3_5"},{"key":"2_CR41","doi-asserted-by":"publisher","unstructured":"Liqat, U., et al.: Energy consumption analysis of programs based on XMOS ISA-level models. In: Proceedings of LOPSTR 2013. LNCS, vol. 8901, pp. 72\u201390. Springer, New York (2014). https:\/\/doi.org\/10.1007\/978-3-319-14125-1_5","DOI":"10.1007\/978-3-319-14125-1_5"},{"key":"2_CR42","doi-asserted-by":"crossref","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. Theory and Practice of Logic Programming, Special Issue on Computational Logic for Verification 18(2), 167\u2013223 (March 2018), https:\/\/arxiv.org\/abs\/1803.04451","DOI":"10.1017\/S1471068418000042"},{"key":"2_CR43","doi-asserted-by":"publisher","unstructured":"Lopez-Garcia, P., Klemen, M., Liqat, U., Hermenegildo, M.V.: A general framework for static profiling of parametric resource usage. TPLP (ICLP 2016 Special Issue) 16(5\u20136), 849\u2013865 (2016). https:\/\/doi.org\/10.1017\/S1471068416000442","DOI":"10.1017\/S1471068416000442"},{"key":"2_CR44","doi-asserted-by":"publisher","unstructured":"Marescotti, M., Blicha, M., Hyv\u00e4rinen, A.E.J., Asadi, S., Sharygina, N.: Computing exact worst-case gas consumption for smart contracts. In: Leveraging Applications of Formal Methods, Verification and Validation (ISoLA 2018). LNCS, vol. 11247, pp. 450\u2013465. Springer, Cham, November 2018. https:\/\/doi.org\/10.1007\/978-3-030-03427-6_33","DOI":"10.1007\/978-3-030-03427-6_33"},{"key":"2_CR45","doi-asserted-by":"publisher","unstructured":"Maroneze, A.O., Blazy, S., Pichardie, D., Puaut, I.: A formally verified WCET estimation tool. In: Workshop on Worst-Case Execution Time Analysis - WCET 2014. OASICS, vol. 39, pp. 11\u201320. Schloss Dagstuhl (2014). https:\/\/doi.org\/10.4230\/OASIcs.WCET.2014.11","DOI":"10.4230\/OASIcs.WCET.2014.11"},{"key":"2_CR46","doi-asserted-by":"publisher","unstructured":"M\u00e9ndez-Lojo, M., Navas, J., Hermenegildo, M.: A flexible (C)LP-based approach to the analysis of object-oriented programs. In: LOPSTR. LNCS, vol. 4915, pp. 154\u2013168. Springer, Heidelberg, August 2007. https:\/\/doi.org\/10.1007\/978-3-540-78769-3_11","DOI":"10.1007\/978-3-540-78769-3_11"},{"key":"2_CR47","doi-asserted-by":"publisher","unstructured":"Mera, E., Lopez-Garcia, P., Carro, M., Hermenegildo, M.V.: Towards execution time estimation in abstract machine-based languages. In: PPDP 2008, pp. 174\u2013184. ACM Press, July 2008. https:\/\/doi.org\/10.1145\/1389449.1389471","DOI":"10.1145\/1389449.1389471"},{"key":"2_CR48","doi-asserted-by":"publisher","unstructured":"Moser, G., Schneckenreither, M.: Automated amortised resource analysis for term rewrite systems. Sci. Comput. Program. 185 (2020). https:\/\/doi.org\/10.1016\/j.scico.2019.102306","DOI":"10.1016\/j.scico.2019.102306"},{"issue":"2\/3","key":"2_CR49","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0743-1066(92)90035-2","volume":"13","author":"K Muthukumar","year":"1992","unstructured":"Muthukumar, K., Hermenegildo, M.: Compile-time derivation of variable dependency using abstract interpretation. J. Logic Program. 13(2\/3), 315\u2013347 (1992)","journal-title":"J. Logic Program."},{"key":"2_CR50","unstructured":"Navas, J., M\u00e9ndez-Lojo, M., Hermenegildo, M.: Safe upper-bounds inference of energy consumption for java bytecode applications. In: The Sixth NASA Langley Formal Methods Workshop (LFM 2008). pp. 29\u201332, April 2008. Extended Abstract"},{"key":"2_CR51","doi-asserted-by":"crossref","unstructured":"Navas, J., M\u00e9ndez-Lojo, M., Hermenegildo, M.V.: User-definable resource usage bounds analysis for java bytecode. In: BYTECODE 2009. ENTCS, vol. 253, pp. 6\u201386. Elsevier, March 2009. http:\/\/www.cliplab.org\/papers\/resources-bytecode09.pdf","DOI":"10.1016\/j.entcs.2009.11.015"},{"key":"2_CR52","doi-asserted-by":"publisher","unstructured":"Navas, J., Mera, E., Lopez-Garcia, P., Hermenegildo, M.: User-definable resource bounds analysis for logic programs. In: Proceedings of ICLP 2007. LNCS, vol. 4670, pp. 348\u2013363. Springer, New York (2007). https:\/\/doi.org\/10.1007\/978-3-540-74610-2_24","DOI":"10.1007\/978-3-540-74610-2_24"},{"key":"2_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-45927-8_18","volume-title":"Programming Languages and Systems","author":"F Nielson","year":"2002","unstructured":"Nielson, F., Nielson, H.R., Seidl, H.: Automatic complexity analysis. In: Le M\u00e9tayer, D. (ed.) ESOP 2002. LNCS, vol. 2305, pp. 243\u2013261. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45927-8_18"},{"key":"2_CR54","doi-asserted-by":"crossref","unstructured":"Peralta, J., Gallagher, J., Sa\u011flam, H.: Analysis of imperative programs through analysis of constraint logic programs. In: Levi, G. (ed.) Static Analysis. 5th International Symposium, SAS 1998, Pisa. LNCS, vol. 1503, pp. 246\u2013261 (1998)","DOI":"10.1007\/3-540-49727-7_15"},{"key":"2_CR55","unstructured":"Plotkin, G.: A structural approach to operational semantics. Technical report DAIMI FN-19, Computer Science Department, Aarhus University, Denmark (1981)"},{"key":"2_CR56","doi-asserted-by":"crossref","unstructured":"Puebla, G., Bueno, F., Hermenegildo, M.V.: An assertion language for constraint logic programs. In: Analysis and Visualization Tools for Constraint Programming, pp. 23\u201361. No. 1870 in LNCS, Springer, New York (2000)","DOI":"10.1007\/10722311_2"},{"key":"2_CR57","doi-asserted-by":"publisher","unstructured":"Qu, W., Gaboardi, M., Garg, D.: Relational cost analysis for functional-imperative programs. Proc. ACM Program. Lang. 3(ICFP), 92:1\u201392:29 (2019). https:\/\/doi.org\/10.1145\/3341696","DOI":"10.1145\/3341696"},{"key":"2_CR58","doi-asserted-by":"crossref","unstructured":"Serrano, A., Lopez-Garcia, P., Bueno, F., Hermenegildo, M.V.: Sized type analysis for logic programs (technical communication). In: Swift, T., Lamma, E. (eds.) Theory and Practice of Logic Programming, 29th International Conference on Logic Programming (ICLP 2013) Special Issue, On-line Supplement, vol. 13, pp. 1\u201314. Cambridge University Press, August 2013","DOI":"10.1017\/S1471068413000112"},{"key":"2_CR59","doi-asserted-by":"publisher","unstructured":"Serrano, A., Lopez-Garcia, P., Hermenegildo, M.V.: Resource usage analysis of logic programs via abstract interpretation using sized types. TPLP, ICLP 2014 Special Issue 14(4\u20135), 739\u2013754 (2014). https:\/\/doi.org\/10.1017\/S147106841400057X","DOI":"10.1017\/S147106841400057X"},{"key":"2_CR60","doi-asserted-by":"publisher","unstructured":"Szabo, N.: Formalizing and securing relationships on public networks. First Monday 2(9) (1997). https:\/\/doi.org\/10.5210\/fm.v2i9.548","DOI":"10.5210\/fm.v2i9.548"},{"key":"2_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-540-27861-0_6","volume-title":"Implementation of Functional Languages","author":"PB Vasconcelos","year":"2004","unstructured":"Vasconcelos, P.B., Hammond, K.: Inferring cost equations for recursive, polymorphic and higher-order functional programs. In: Trinder, P., Michaelson, G.J., Pe\u00f1a, R. (eds.) IFL 2003. LNCS, vol. 3145, pp. 86\u2013101. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27861-0_6"},{"issue":"9","key":"2_CR62","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. Commun. ACM 18(9), 528\u2013539 (1975)","journal-title":"Commun. ACM"},{"key":"2_CR63","unstructured":"Wood, G.: Ethereum: A secure decentralised generalised transaction ledger (2016). https:\/\/gavwood.com\/paper.pdf"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65474-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,13]],"date-time":"2021-01-13T13:41:37Z","timestamp":1610545297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65474-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030654733","9783030654740"],"references-count":63,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65474-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"13 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Static Analysis Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chicago, IL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sas2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/sas-2020","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"34","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":"14","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":"41% - 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":"7","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic the event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}