Cost analysis of java bytecode

Authors:
E. Albert;P. Arenas;S. Genaim;G. Puebla;D. Zanardini
Affiliations:
DSIC, Complutense University of Madrid, Madrid, Spain;DSIC, Complutense University of Madrid, Madrid, Spain;CLIP, Technical University of Madrid, Madrid, Spain;CLIP, Technical University of Madrid, Madrid, Spain;CLIP, Technical University of Madrid, Madrid, Spain
Venue:
ESOP'07 Proceedings of the 16th European conference on Programming
Year:
2007

Citing 17
Cited 48

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Automatic complexity analysis

FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Efficiently computing static single assignment form and the control dependence graph

ACM Transactions on Programming Languages and Systems (TOPLAS)
Cost analysis of logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Lower bound cost estimation for logic programs

ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Resource bound certification

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic time-bound analysis for a higher-order language

PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Automatic discovery of linear restraints among variables of a program

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Java Virtual Machine Specification

Java Virtual Machine Specification
Algorithms and Complexity

Algorithms and Complexity
Automated higher-order complexity analysis

Theoretical Computer Science - Implicit computational complexity
MOBIUS: mobility, ubiquity, security objectives and progress report

TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Timing analysis and timing predictability

FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Certified memory usage analysis

FM'05 Proceedings of the 2005 international conference on Formal Methods
Mobile resource guarantees for smart devices

CASSIS'04 Proceedings of the 2004 international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices
Combining static analysis and profiling for estimating execution times

PADL'07 Proceedings of the 9th international conference on Practical Aspects of Declarative Languages

Experiments in Cost Analysis of Java Bytecode

Electronic Notes in Theoretical Computer Science (ENTCS)
Heap space analysis for java bytecode

Proceedings of the 6th international symposium on Memory management
Removing useless variables in cost analysis of Java bytecode

Proceedings of the 2008 ACM symposium on Applied computing
Parametric prediction of heap memory requirements

Proceedings of the 7th international symposium on Memory management
Analysing memory resource bounds for low-level programs

Proceedings of the 7th international symposium on Memory management
Characterizations of polynomial complexity classes with a better intensionality

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Towards execution time estimation in abstract machine-based languages

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Termination Analysis of Java Bytecode

FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis

SAS '08 Proceedings of the 15th international symposium on Static Analysis
Long-Run Cost Analysis by Approximation of Linear Operators over Dioids

AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Platform Independent Timing of Java Virtual Machine Bytecode Instructions

Electronic Notes in Theoretical Computer Science (ENTCS)
COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode

Formal Methods for Components and Objects
Test Data Generation of Bytecode by CLP Partial Evaluation

Logic-Based Program Synthesis and Transformation
Context-Aware Adaptive Services: The PLASTIC Approach

FASE '09 Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Live heap space analysis for languages with garbage collection

Proceedings of the 2009 international symposium on Memory management
Decompilation of Java bytecode to Prolog by partial evaluation

Information and Software Technology
Cost Relation Systems: A Language-Independent Target Language for Cost Analysis

Electronic Notes in Theoretical Computer Science (ENTCS)
On transforming Java-like programs into memory-predictable code

Proceedings of the 7th International Workshop on Java Technologies for Real-Time and Embedded Systems
User-Definable Resource Usage Bounds Analysis for Java Bytecode

Electronic Notes in Theoretical Computer Science (ENTCS)
Termination and Cost Analysis with COSTA and its User Interfaces

Electronic Notes in Theoretical Computer Science (ENTCS)
Asymptotic Resource Usage Bounds

APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
A termination analyzer for Java bytecode based on path-length

ACM Transactions on Programming Languages and Systems (TOPLAS)
Parametric inference of memory requirements for garbage collected languages

Proceedings of the 2010 international symposium on Memory management
Comparing cost functions in resource analysis

FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Multivariate amortized resource analysis

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verified resource guarantees using COSTA and KeY

Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation
Closed-Form Upper Bounds in Static Cost Analysis

Journal of Automated Reasoning
More precise yet widely applicable cost analysis

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Amortized resource analysis with polymorphic recursion and partial big-step operational semantics

APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Live heap space bounds for real-time systems

APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Task-level analysis for a language with async/finish parallelism

Proceedings of the 2011 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
Inference of field initialization

Proceedings of the 33rd International Conference on Software Engineering
Simulating concurrent behaviors with worst-case cost bounds

FM'11 Proceedings of the 17th international conference on Formal methods
Collected size semantics for functional programs over lists

IFL'08 Proceedings of the 20th international conference on Implementation and application of functional languages
Static Resource Analysis for Java Bytecode Using Amortisation and Separation Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
Cost analysis of object-oriented bytecode programs

Theoretical Computer Science
Cost analysis of concurrent OO programs

APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Symbolic execution of concurrent objects in CLP

PADL'12 Proceedings of the 14th international conference on Practical Aspects of Declarative Languages
Modular termination analysis of java bytecode and its application to phoneME core libraries

FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
Automatic inference of resource consumption bounds

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Verified resource guarantees for heap manipulating programs

FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
Resource aware ML

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Multivariate amortized resource analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Resource-Driven CLP-Based test case generation

LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
A static cost analysis for a higher-order language

PLPV '13 Proceedings of the 7th workshop on Programming languages meets program verification
Modeling resource-aware virtualized applications for the cloud in real-time ABS

ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Engineering virtualized services

Proceedings of the Second Nordic Symposium on Cloud Computing & Internet Technologies
Reachability analysis of program variables

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

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.