A Transformational Approach to Resource Analysis with Typed-norms Inference

Author:

ALBERT ELVIRA,GENAIM SAMIRORCID,GUTIÉRREZ RAÚL,MARTIN-MARTIN ENRIQUEORCID

Abstract

AbstractIn order to automatically infer the resource consumption of programs, analyzers track how data sizes change along program’s execution. Typically, analyzers measure the sizes of data by applying norms which are mappings from data to natural numbers that represent the sizes of the corresponding data. When norms are defined by taking type information into account, they are named typed-norms. This article presents a transformational approach to resource analysis with typed-norms that are inferred by a data-flow analysis. The analysis is based on a transformation of the program into an intermediate abstract program in which each variable is abstracted with respect to all considered norms which are valid for its type. We also present the data-flow analysis to automatically infer the required, useful, typed-norms from programs. Our analysis is formalized on a simple rule-based representation to which programs written in different programming paradigms (e.g., functional, logic, and imperative) can be automatically translated. Experimental results on standard benchmarks used by other type-based analyzers show that our approach is both efficient and accurate in practice.

Publisher

Cambridge University Press (CUP)

Subject

Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software

Reference38 articles.

1. Bossi, A. , Cocco, N. , and Fabris, M. 1991. Proving termination of logic programs by exploiting term properties. In APSOFT 1991: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8–12, 1991, Volume 2: Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Developmemnt (CCPSD), Abramsky, S. and Maibaum, T. S. E. , Eds. Lecture Notes in Computer Science, vol. 494. Springer, 153–180.

2. A lattice-theoretical fixpoint theorem and its applications

3. Puebla, G. and Hermenegildo, M. 1996. Optimized algorithms for the incremental analysis of logic programs. In International Static Analysis Symposium (SAS 1996), vol. 1145. Lecture Notes in Computer Science. Springer-Verlag, 270–284.

4. Flores-Montoya, A. and Hähnle, R. 2014. Resource analysis of complex programs with cost equations. In Programming Languages and Systems – 12th Asian Symposium, APLAS 2014, Singapore, November 17–19, 2014, Proceedings. LNCS, vol. 8858. Springer, 275–295.

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Multiple Query Satisfiability of Constrained Horn Clauses;Practical Aspects of Declarative Languages;2023

2. Constrained Horn Clauses Satisfiability via Catamorphic Abstractions;Logic-Based Program Synthesis and Transformation;2023

3. Verifying Catamorphism-Based Contracts using Constrained Horn Clauses;Theory and Practice of Logic Programming;2022-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3