Closed-form upper bounds in static cost analysis
The classical approach to automatic cost analysis consists of two phases. Given a program
and some measure of cost, the analysis first produces cost relations (CRs), ie, recursive …
and some measure of cost, the analysis first produces cost relations (CRs), ie, recursive …
Cost analysis of java bytecode
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 …
operand stack and its object-oriented programming features (like dynamic dispatching). This …
Cost analysis of object-oriented bytecode programs
Cost analysis statically approximates the cost of programs in terms of their input data size.
This paper presents, to the best of our knowledge, the first approach to the automatic cost …
This paper presents, to the best of our knowledge, the first approach to the automatic cost …
Automatic inference of upper bounds for recurrence relations in cost analysis
The classical approach to automatic cost analysis consists of two phases. Given a program
and some measure of cost, we first produce recurrence relations (RRs) which capture the …
and some measure of cost, we first produce recurrence relations (RRs) which capture the …
COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode
This paper describes the architecture of costa, an abstract interpretation based cos t and t
ermination a nalyzer for Java bytecode. The system receives as input a bytecode program,(a …
ermination a nalyzer for Java bytecode. The system receives as input a bytecode program,(a …
A program logic for resources
We introduce a reasoning infrastructure for proving statements about resource consumption
in a fragment of the Java Virtual Machine Language (JVML). The infrastructure is based on a …
in a fragment of the Java Virtual Machine Language (JVML). The infrastructure is based on a …
Abstraction-carrying code
Abstract Proof-Carrying Code (PCC) is a general approach to mobile code safety in which
programs are augmented with a certificate (or proof). The practical uptake of PCC greatly …
programs are augmented with a certificate (or proof). The practical uptake of PCC greatly …
Analysing memory resource bounds for low-level programs
Embedded systems are becoming more widely used but these systems are often resource
constrained. Programming models for these systems should take into formal consideration …
constrained. Programming models for these systems should take into formal consideration …
User-definable resource usage bounds analysis for Java bytecode
Automatic cost analysis of programs has been traditionally concentrated on a reduced
number of resources such as execution steps, time, or memory. However, the increasing …
number of resources such as execution steps, time, or memory. However, the increasing …
Proof-carrying code from certified abstract interpretation and fixpoint compression
Proof-carrying code (PCC) is a technique for downloading mobile code on a host machine
while ensuring that the code adheres to the host's safety policy. We show how certified …
while ensuring that the code adheres to the host's safety policy. We show how certified …