Cost analysis of java bytecode
Elvira Albert,Puri Arenas,Samir Genaim,Germán Puebla,Damiano Zanardini +4 more
- 24 Mar 2007
- pp 157-172
TL;DR: This paper develops a generic framework for the automatic cost analysis of sequential Java bytecode and generates cost relations which define at compile-time the cost of programs as a function of their input data size.
read more
Abstract: Cost analysis of Java bytecode is complicated by its unstructured control flow, the use of an operand stack and its object-oriented programming features (like dynamic dispatching) This paper addresses these problems and develops a generic framework for the automatic cost analysis of sequential Java bytecode Our method generates cost relations which define at compile-time the cost of programs as a function of their input data size To the best of our knowledge, this is the first approach to the automatic cost analysis of Java bytecode
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Multivariate amortized resource analysis
TL;DR: This article presents a novel multivariate amortized resource analysis based on a type system for a simple first-order functional language with lists and trees, proves soundness, and describes automatic type inference based on linear programming.
234
A termination analyzer for Java bytecode based on path-length
TL;DR: This article presents the first existing termination analyzer for Java bytecode dealing with any kind of data structures dynamically allocated on the heap and which does not require any help or annotation on the part of the user.
Towards automatic resource bound analysis for OCaml
Jan Hoffmann,Ankush Das,Shu-Chun Weng +2 more
- 01 Jan 2017
TL;DR: In this article, the authors present a multivariate automatic amortized resource analysis (AARA) for OCaml programs with user-defined inductive types. But their analysis is based on linear AARA for higher-order programs with first-order lists and binary trees.
136
Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
Elvira Albert,Puri Arenas,Samir Genaim,Germán Puebla +3 more
- 16 Jul 2008
TL;DR: The first practical framework for the fully automatic generation of reasonably accurate upper bounds of RRs originating from cost analysis of a wide range of programs is presented, based on the inference of ranking functions and loop invariants and on partial evaluation.
Resource aware ML
Jan Hoffmann,Klaus Aehlig,Martin Hofmann +2 more
- 07 Jul 2012
TL;DR: This tool paper describes Resource Aware ML (RAML), a functional programming language that implements a novel multivariate amortized resource analysis that automatically computes polynomial resource bounds for first-order functional programs.
References
•Book
Compilers: Principles, Techniques, and Tools
Alfred V. Aho,Ravi Sethi,Jeffrey D. Ullman +2 more
- 01 Jan 1986
TL;DR: This book discusses the design of a Code Generator, the role of the Lexical Analyzer, and other topics related to code generation and optimization.
9.7K
•Book
The Java Virtual Machine Specification
Tim Lindholm,Frank Yellin +1 more
- 19 Sep 1996
TL;DR: In this article, the authors present a detailed overview of the Java Virtual Machine, including the internal structure of the class file format, the internal form of Fully Qualified Class and Interface names, and the implementation of new class instances.
Efficiently computing static single assignment form and the control dependence graph
TL;DR: In this article, the authors present new algorithms that efficiently compute static single assignment forms and control dependence graphs for arbitrary control flow graphs using the concept of {\em dominance frontiers} and give analytical and experimental evidence that these data structures are usually linear in the size of the original program.
Proof-carrying code
George C. Necula
- 01 Jan 1997
TL;DR: It is shown in this paper how proof-carrying code might be used to develop safe assembly-language extensions of ML programs and the adequacy of concrete representations for the safety policy, the safety proofs, and the proof validation is proved.
1.9K