We present a simple algorithm for register allocation which is competitive with the iterated
register coalescing algorithm of George and Appel. We base our algorithm on the …

We present a static analysis that infers both upper and lower bounds on the usage that a
logic program makes of a set of user-definable resources. The inferred bounds will in …

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 …

Program logics for bytecode languages such as Java bytecode or the. NET CIL can be used
to apply Proof-Carrying Code concepts to bytecode programs and to verify correctness …

Abstract We present the Mobile Resource Guarantees framework: a system for ensuring that
downloaded programs are free from run-time violations of resource bounds. Certificates are …

We present a program logic for verifying the heap consumption of low-level programs. The
proof rules employ a uniform assertion format and have been derived from a general …

We define a compositional program logic in the style of Floyd and Hoare for a simple, typed,
stack-based abstract machine with unstructured control flow, global variables and mutually …

Through their global, uniform provision of services and their distributed nature, global
computers have the potential to profoundly enhance our daily life. However, they will not …

Abstract We present the Bytecode Modeling Language (BML), the Java bytecode cousin of
JML. BML allows the application developer to specify the behaviour of an application in the …

This paper introduces notions of resource policy for mobile code to be run on smart devices,
to integrate with the proof-carrying code architecture of the Mobile Resource Guarantees …